arXiv:2509.07614 · IEEE International Conference on Quantum Computing and Engineering (QCE)
From Classical Data to Quantum Advantage – Quantum Policy Evaluation on Quantum Hardware
Daniel M. Hein, Simon M. Wiedemann, Markus Baumann, Patrik Felbinger, Justin Klein, Maximilian Schieder, Jonas Stein, Daniëlle Schuman, Thomas Cope, Steffen Udluft
Quantum policy evaluation (QPE) is a reinforcement learning (RL) algorithm which is quadratically more efficient than an analogous classical Monte Carlo estimation. It makes use of a direct quantum mechanical realization of a finite Markov decision process, in which the agent and the environment are modeled by unitary operators and exchange states, actions, and rewards in superposition. Previously, the quantum environment has been implemented and parametrized manually for an illustrative benchmark using a quantum simulator. In this paper, we demonstrate how these environment parameters can be learned from a batch of classical observational data through quantum machine learning (QML) on quantum hardware. The learned quantum environment is then applied in QPE to also compute policy evaluations on quantum hardware. Our experiments reveal that, despite challenges such as noise and short coherence times, the integration of QML and QPE shows promising potential for achieving quantum advantage in RL.
Quantum policy evaluation (QPE) is a reinforcement learning (RL) algorithm which is quadratically more efficient than an analogous classical Monte Carlo estimation. It makes use of a direct quantum mechanical realization of a finite Markov decision process, in which the agent and the environment are modeled by unitary operators and exchange states, actions, and rewards in superposition. Previously, the quantum environment has been implemented and parametrized manually for an illustrative benchmark using a quantum simulator. In this paper, we demonstrate how these environment parameters can be learned from a batch of classical observational data through quantum machine learning (QML) on quantum hardware. The learned quantum environment is then applied in QPE to also compute policy evaluations on quantum hardware. Our experiments reveal that, despite challenges such as noise and short coherence times, the integration of QML and QPE shows promising potential for achieving quantum advantage in RL.
We present a full implementation and simulation of a novel quantum reinforcement learning method. Our work is a detailed and formal proof of concept for how quantum algorithms can be used to solve reinforcement learning problems and shows that, given access to error-free, efficient quantum realizations of the agent and environment, quantum methods can yield provable improvements over classical Monte-Carlo based methods in terms of sample complexity. Our approach shows in detail how to combine amplitude estimation and Grover search into a policy evaluation and improvement scheme. We first develop quantum policy evaluation (QPE) which is quadratically more efficient compared to an analogous classical Monte Carlo estimation and is based on a quantum mechanical realization of a finite Markov decision process (MDP). Building on QPE, we derive a quantum policy iteration that repeatedly improves an initial policy using Grover search until the optimum is reached. Finally, we present an implementation of our algorithm for a two-armed bandit MDP which we then simulate.
Quantum computing has emerged as a promising computational paradigm for machine learning (ML), with the potential to offer computational advantages over classical approaches. At this stage, the evidence supporting the performance and advantages of quantum machine learning (QML) models relative to classical models is insufficient. To address this gap, this paper presents an empirical study on the performance of QML models and their classical counterparts. We compare seven model pairs spanning supervised learning and reinforcement learning. Our results indicate that the evaluated quantum machine learning models do not yet surpass the classical baselines in overall prediction performance, policy stability, or training time. Nevertheless, QML remains a promising approach for filtering noise and controlling false positives. Our research findings summarize the challenges facing quantum machine learning across hardware environments, training efficiency, and convergence stability, providing a foundation for research into the robustness and parameter optimization of QML. This work is publicly available at https://github.com/Z-537-437/QML.
This paper investigates the potential of quantum-inspired algorithms to improve reinforcement learning (RL) policy optimization. Traditional RL methods often struggle with slow convergence and exploration challenges, particularly in complex environments. We propose a novel approach that draws inspiration from quantum mechanics, specifically superposition and entanglement, to address these limitations. Our algorithms aim to exploit superposition to simultaneously evaluate multiple action possibilities and utilize entanglement to model correlations between states, thereby accelerating the learning process. We present a framework for incorporating these concepts into RL, focusing on algorithmic design rather than a direct quantum simulation. The theoretical analysis suggests that our approach could significantly enhance exploration efficiency and, consequently, policy convergence rates. This work represents a direct application of quantum-inspired ideas to RL policy optimization, offering a potentially transformative pathway for developing more efficient and robust RL agents.
This paper investigates the application of quantum-inspired algorithms to the field of reinforcement learning (RL). Traditional RL methods often struggle with exploration challenges and can be computationally expensive, particularly in complex environments. We propose a novel RL algorithm that leverages concepts from quantum mechanics, specifically superposition and entanglement, to address these limitations. The core idea is to represent states, actions, and rewards using quantum-inspired representations, allowing the agent to explore the environment more efficiently and potentially converge to optimal policies faster. This work presents a detailed formulation of the algorithm, including the mathematical framework and key considerations for implementation. The potential benefits of this approach, including improved exploration and reduced computational complexity, are discussed. The algorithm is designed to iteratively refine its policy based on simulated quantum measurements, aiming to minimize the expected return. The exploration strategy is guided by the inherent probabilistic nature of quantum states, leading to a more diverse and potentially faster learning process. Further research is warranted to fully explore the capabilities and limitations of this approach across various RL benchmark problems.
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.
Quantum Machine Learning (QML) integrates quantum algorithms into machine learning programs to enhance and expedite classical machine learning techniques. It leverages quantum data and hybrid quantum-classical models, utilizing the principles of superposition and entanglement to handle complex joint probability distributions that would require exponential classical computational resources. QML aims to harness the unique properties of quantum computers for practical machine learning tasks, with the goal of achieving quantum advantage over classical approaches. QML finds applications in diverse fields such as chemical and quantum matter simulation, quantum control, quantum communication networks, and quantum metrology. Quantum algorithms can analyze quantum states and improve computational speed and data storage. Two main frameworks, quantum kernel methods and variational quantum algorithms, are widely used due to their implement ability on quantum hardware and capacity to work on general datasets. Quantum computers can solve linear algebraic problems, calculate eigenvectors and eigenvalues, and perform support vector algorithms at exponentially faster rates than classical computers. Despite its potential, QML faces significant challenges related to quantum hardware capabilities, including limited qubit connectivity, noise, coherence times, and errors in state preparation and measurement. Hardware constraints, compatibility issues, high computational and memory requirements, and the difficulty of quantum programming also pose obstacles. Overcoming these hardware and software limitations is crucial for realizing the full potential of quantum machine learning