Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

Automatic evolutionary design of quantum rule-based systems and applications to quantum reinforcement learning

Manuel Pegalájar Cuéllar, M.C. Pegalajar, Carlos Cano

Published May 11, 2024• 7 citations
Publisher

Abstract

Abstract Explainable artificial intelligence is a research topic whose relevance has increased in recent years, especially with the advent of large machine learning models. However, very few attempts have been proposed to improve interpretability in the case of quantum artificial intelligence, and many existing quantum machine learning models in the literature can be considered almost as black boxes. In this article, we argue that an appropriate semantic interpretation of a given quantum circuit that solves a problem can be of interest to the user not only to certify the correct behavior of the learned model, but also to obtain a deeper insight into the problem at hand and its solution. We focus on decision-making problems that can be formulated as classification tasks and propose a method for learning quantum rule-based systems to solve them using evolutionary optimization algorithms. The approach is tested to learn rules that solve control and decision-making tasks in reinforcement learning environments, to provide interpretable agent policies that help to understand the internal dynamics of an unknown environment. Our results conclude that the learned policies are not only highly explainable, but can also help detect non-relevant features of problems and produce a minimal set of rules.

DOI
10.1007/s11128-024-04391-0

Related papers

Explainability of Decision-Making in Hybrid Quantum-Classical Classification Models

Sayali Ramesh Kote

This research paper explores the explainability of decision-making in hybrid quantum–classical classification models. Quantum Machine Learning (QML) combines the power of quantum computing with classical machine learning techniques to solve complex computational problems. However, understanding how these hybrid models make decisions remains a significant challenge. The study focuses on analyzing hybrid quantum–classical architectures and evaluating methods that improve the interpretability of their predictions. Techniques from Explainable Artificial Intelligence (XAI) are applied to investigate the internal decision-making processes of the models. The research also compares classical machine learning approaches with quantum-enhanced models to understand their performance and transparency. The results demonstrate that explainability techniques can help researchers better interpret model predictions, identify important features, and improve trust in hybrid quantum–classical systems. This work contributes to the development of transparent and reliable quantum machine learning applications in areas such as healthcare, finance, and data analytics.

•Mar 9, 2026•0 citations

Reinforcement Learning for Quantum Technology

Marin Bukov, Florian Marquardt

Many challenges arising in Quantum Technology can be successfully addressed using a set of machine learning algorithms collectively known as reinforcement learning (RL), based on adaptive decision-making through interaction with the quantum device. After a concise and intuitive introduction to RL aimed at a broad physics readership, we discuss the key ideas and core concepts in reinforcement learning with a particular focus on quantum systems. We then survey recent progress in RL in all relevant areas. We discuss state preparation in few- and many-body quantum systems, the design and optimization of high-fidelity quantum gates, and the automated construction of quantum circuits, including applications to variational quantum eigensolvers and architecture search. We further highlight the interactive capabilities of RL agents, emphasizing recent progress in quantum feedback control and quantum error correction, and briefly discuss quantum reinforcement learning as well as applications to quantum metrology. The review concludes with a discussion of open challenges -- such as scalability, interpretability, and integration with experimental platforms -- and outlines promising directions for future research. Throughout, we highlight experimental implementations that exemplify the increasing role of reinforcement learning in shaping the development of quantum technologies.

quant-pharXiv:2601.18953•Jan 28, 2026•0 citations

Agentic Hybrid Quantum–Neuromorphic AI Architecture With Explainable Reinforcement Learning for Next-Generation Intelligent Systems

Divyanshu Sinha, Udit Mamodiya, Indra Kishor +2 more

Artificial intelligence systems are shifting away to passive prediction systems into architectures that are supposed to rationalize and modify according to their needs as well as explain what they are doing. The current methods tend to maximize the precision at the expense of transparency and long-term flexibility, creating a gap in the systems with both accountable reasoning and learning processes. To solve this, we present an Agentic Hybrid Quantum -Neuromorphic AI system with an Explainable Reinforcement Learning core. It consists of a combination of quantum-assisted exploration, spiking neuromorphic adaptation, interpretable policy optimization to enable the system to adapt computational strategy depending on the dynamics of rewards, confidence, and environmental change. Experiments exhibit enhanced convergence speed, ability to maintain behavior in the case of sudden changes in the environment and a far greater enhancement in explanation coherence than traditional reinforcement learning agents and adaptive immersive systems.

Advances in computational intelligence and robotics book series•Mar 4, 2026•2 citations

Quantum Policy Gradient Algorithms

Sofiène Jerbi, Arjan Cornelissen, Māris Ozols +1 more

Understanding the power and limitations of quantum access to data in machine learning tasks is primordial to assess the potential of quantum computing in artificial intelligence. Previous works have already shown that speed-ups in learning are possible when given quantum access to reinforcement learning environments. Yet, the applicability of quantum algorithms in this setting remains very limited, notably in environments with large state and action spaces. In this work, we design quantum algorithms to train state-of-the-art reinforcement learning policies by exploiting quantum interactions with an environment. However, these algorithms only offer full quadratic speed-ups in sample complexity over their classical analogs when the trained policies satisfy some regularity conditions. Interestingly, we find that reinforcement learning policies derived from parametrized quantum circuits are well-behaved with respect to these conditions, which showcases the benefit of a fully-quantum reinforcement learning framework.

arXiv:2212.09328•Leibniz international proceedings in informatics•Dec 19, 2022•8 citations

Explaining quantum circuits with Shapley values: towards explainable quantum machine learning

Raoul Heese, Thore Gerlach, Sascha Mücke +3 more

Abstract Methods of artificial intelligence (AI) and especially machine learning (ML) have been growing ever more complex, and at the same time have more and more impact on people’s lives. This leads to explainable AI (XAI) manifesting itself as an important research field that helps humans to better comprehend ML systems. In parallel, quantum machine learning (QML) is emerging with the ongoing improvement of quantum computing hardware combined with its increasing availability via cloud services. QML enables quantum-enhanced ML in which quantum mechanics is exploited to facilitate ML tasks, typically in the form of quantum-classical hybrid algorithms that combine quantum and classical resources. Quantum gates constitute the building blocks of gate-based quantum hardware and form circuits that can be used for quantum computations. For QML applications, quantum circuits are typically parameterized and their parameters are optimized classically such that a suitably defined objective function is minimized. Inspired by XAI, we raise the question of the explainability of such circuits by quantifying the importance of (groups of) gates for specific goals. To this end, we apply the well-established concept of Shapley values. The resulting attributions can be interpreted as explanations for why a specific circuit works well for a given task, improving the understanding of how to construct parameterized (or variational) quantum circuits, and fostering their human interpretability in general. An experimental evaluation on simulators and two superconducting quantum hardware devices demonstrates the benefits of the proposed framework for classification, generative modeling, transpilation, and optimization. Furthermore, our results shed some light on the role of specific gates in popular QML approaches.

arXiv:2301.09138•Quantum Machine Intelligence•Feb 25, 2025•30 citations

Evolutionary quantum architecture search for parametrized quantum circuits

Li Ding, Lee C. Spector

Recent advancements in quantum computing have shown promising computational advantages in many problem areas. As one of those areas with increasing attention, hybrid quantum-classical machine learning systems have demonstrated the capability to solve various data-driven learning tasks. Recent works show that parameterized quantum circuits (PQCs) can be used to solve challenging reinforcement learning (RL) tasks with provable learning advantages. While existing works yield potentials of PQC-based methods, the design choices of PQC architectures and their influences on the learning tasks are generally underexplored. In this work, we introduce EQAS-PQC, an evolutionary quantum architecture search framework for PQC-based models, which uses a population-based genetic algorithm to evolve PQC architectures by exploring the search space of quantum operations. Experimental results show that our method can significantly improve the performance of hybrid quantum-classical models in solving benchmark reinforcement problems. We also model the probability distributions of quantum operations in top-performing architectures to identify essential design choices that are critical to the performance.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 9, 2022•32 citations
Abstract Explainable artificial intelligence is a research topic whose relevance has increased in recent years, especially with the advent of large machine learning models. However, very few attempts have been proposed to improve interpretability in the case of quantum artificial intelligence, and many existing quantum machine learning models in the literature can be considered almost as black boxes. In this article, we argue that an appropriate semantic interpretation of a given quantum circuit that solves a problem can be of interest to the user not only to certify the correct behavior of the learned model, but also to obtain a deeper insight into the problem at hand and its solution. We focus on decision-making problems that can be formulated as classification tasks and propose a method for learning quantum rule-based systems to solve them using evolutionary optimization algorithms. The approach is tested to learn rules that solve control and decision-making tasks in reinforcement learning environments, to provide interpretable agent policies that help to understand the internal dynamics of an unknown environment. Our results conclude that the learned policies are not only highly explainable, but can also help detect non-relevant features of problems and produce a minimal set of rules.
This research paper explores the explainability of decision-making in hybrid quantum–classical classification models. Quantum Machine Learning (QML) combines the power of quantum computing with classical machine learning techniques to solve complex computational problems. However, understanding how these hybrid models make decisions remains a significant challenge. The study focuses on analyzing hybrid quantum–classical architectures and evaluating methods that improve the interpretability of their predictions. Techniques from Explainable Artificial Intelligence (XAI) are applied to investigate the internal decision-making processes of the models. The research also compares classical machine learning approaches with quantum-enhanced models to understand their performance and transparency. The results demonstrate that explainability techniques can help researchers better interpret model predictions, identify important features, and improve trust in hybrid quantum–classical systems. This work contributes to the development of transparent and reliable quantum machine learning applications in areas such as healthcare, finance, and data analytics.
Many challenges arising in Quantum Technology can be successfully addressed using a set of machine learning algorithms collectively known as reinforcement learning (RL), based on adaptive decision-making through interaction with the quantum device. After a concise and intuitive introduction to RL aimed at a broad physics readership, we discuss the key ideas and core concepts in reinforcement learning with a particular focus on quantum systems. We then survey recent progress in RL in all relevant areas. We discuss state preparation in few- and many-body quantum systems, the design and optimization of high-fidelity quantum gates, and the automated construction of quantum circuits, including applications to variational quantum eigensolvers and architecture search. We further highlight the interactive capabilities of RL agents, emphasizing recent progress in quantum feedback control and quantum error correction, and briefly discuss quantum reinforcement learning as well as applications to quantum metrology. The review concludes with a discussion of open challenges -- such as scalability, interpretability, and integration with experimental platforms -- and outlines promising directions for future research. Throughout, we highlight experimental implementations that exemplify the increasing role of reinforcement learning in shaping the development of quantum technologies.
Artificial intelligence systems are shifting away to passive prediction systems into architectures that are supposed to rationalize and modify according to their needs as well as explain what they are doing. The current methods tend to maximize the precision at the expense of transparency and long-term flexibility, creating a gap in the systems with both accountable reasoning and learning processes. To solve this, we present an Agentic Hybrid Quantum -Neuromorphic AI system with an Explainable Reinforcement Learning core. It consists of a combination of quantum-assisted exploration, spiking neuromorphic adaptation, interpretable policy optimization to enable the system to adapt computational strategy depending on the dynamics of rewards, confidence, and environmental change. Experiments exhibit enhanced convergence speed, ability to maintain behavior in the case of sudden changes in the environment and a far greater enhancement in explanation coherence than traditional reinforcement learning agents and adaptive immersive systems.
Understanding the power and limitations of quantum access to data in machine learning tasks is primordial to assess the potential of quantum computing in artificial intelligence. Previous works have already shown that speed-ups in learning are possible when given quantum access to reinforcement learning environments. Yet, the applicability of quantum algorithms in this setting remains very limited, notably in environments with large state and action spaces. In this work, we design quantum algorithms to train state-of-the-art reinforcement learning policies by exploiting quantum interactions with an environment. However, these algorithms only offer full quadratic speed-ups in sample complexity over their classical analogs when the trained policies satisfy some regularity conditions. Interestingly, we find that reinforcement learning policies derived from parametrized quantum circuits are well-behaved with respect to these conditions, which showcases the benefit of a fully-quantum reinforcement learning framework.
Abstract Methods of artificial intelligence (AI) and especially machine learning (ML) have been growing ever more complex, and at the same time have more and more impact on people’s lives. This leads to explainable AI (XAI) manifesting itself as an important research field that helps humans to better comprehend ML systems. In parallel, quantum machine learning (QML) is emerging with the ongoing improvement of quantum computing hardware combined with its increasing availability via cloud services. QML enables quantum-enhanced ML in which quantum mechanics is exploited to facilitate ML tasks, typically in the form of quantum-classical hybrid algorithms that combine quantum and classical resources. Quantum gates constitute the building blocks of gate-based quantum hardware and form circuits that can be used for quantum computations. For QML applications, quantum circuits are typically parameterized and their parameters are optimized classically such that a suitably defined objective function is minimized. Inspired by XAI, we raise the question of the explainability of such circuits by quantifying the importance of (groups of) gates for specific goals. To this end, we apply the well-established concept of Shapley values. The resulting attributions can be interpreted as explanations for why a specific circuit works well for a given task, improving the understanding of how to construct parameterized (or variational) quantum circuits, and fostering their human interpretability in general. An experimental evaluation on simulators and two superconducting quantum hardware devices demonstrates the benefits of the proposed framework for classification, generative modeling, transpilation, and optimization. Furthermore, our results shed some light on the role of specific gates in popular QML approaches.
Recent advancements in quantum computing have shown promising computational advantages in many problem areas. As one of those areas with increasing attention, hybrid quantum-classical machine learning systems have demonstrated the capability to solve various data-driven learning tasks. Recent works show that parameterized quantum circuits (PQCs) can be used to solve challenging reinforcement learning (RL) tasks with provable learning advantages. While existing works yield potentials of PQC-based methods, the design choices of PQC architectures and their influences on the learning tasks are generally underexplored. In this work, we introduce EQAS-PQC, an evolutionary quantum architecture search framework for PQC-based models, which uses a population-based genetic algorithm to evolve PQC architectures by exploring the search space of quantum operations. Experimental results show that our method can significantly improve the performance of hybrid quantum-classical models in solving benchmark reinforcement problems. We also model the probability distributions of quantum operations in top-performing architectures to identify essential design choices that are critical to the performance.