A Survey on Quantum Reinforcement Learning
Nico Meyer, Christian Ufrecht, Maniraman Periyasamy, Daniel D. Scherer, Axel Plinge, Christopher Mutschler
TL;DR
This survey maps the landscape of quantum reinforcement learning, spanning quantum-inspired methods, variational quantum circuits, and fully quantum algorithms that leverage subroutines like amplitude estimation and Grover search. It highlights how near-term devices enable hybrid quantum-classical RL with variational function approximators, while also detailing fully quantum approaches that promise provable advantages in restricted settings. The key contributions include a taxonomy of algorithm classes, critical assessments of demonstrated results, and a synthesis of architectural and data-encoding considerations that influence trainability and scalability. The study underscores that, despite intriguing progress, broad quantum advantage remains elusive on current hardware, and it outlines concrete directions—architecture design, offline and multi-agent RL, and quantum-accessible environments—for achieving practical impact in the future.
Abstract
Quantum reinforcement learning is an emerging field at the intersection of quantum computing and machine learning. While we intend to provide a broad overview of the literature on quantum reinforcement learning - our interpretation of this term will be clarified below - we put particular emphasis on recent developments. With a focus on already available noisy intermediate-scale quantum devices, these include variational quantum circuits acting as function approximators in an otherwise classical reinforcement learning setting. In addition, we survey quantum reinforcement learning algorithms based on future fault-tolerant hardware, some of which come with a provable quantum advantage. We provide both a birds-eye-view of the field, as well as summaries and reviews for selected parts of the literature.
