Benchmarking Quantum Reinforcement Learning

Abstract

Benchmarking and establishing proper statistical validation metrics for reinforcement learning (RL) remain ongoing challenges, where no consensus has been established yet. The emergence of quantum computing and its potential applications in quantum reinforcement learning (QRL) further complicate benchmarking efforts. To enable valid performance comparisons and to streamline current research in this area, we propose a novel benchmarking methodology, which is based on a statistical estimator for sample complexity and a definition of statistical outperformance. Furthermore, considering QRL, our methodology casts doubt on some previous claims regarding its superiority. We conducted experiments on a novel benchmarking environment with flexible levels of complexity. While we still identify possible advantages, our findings are more nuanced overall. We discuss the potential limitations of these results and explore their implications for empirical research on quantum advantage in QRL.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keymeyer2025benchmarking

Related papers

• An Introduction To Quantum Reinforcement Learning (QRL) (2024)0.00
• Efficient Quantum Recurrent Reinforcement Learning Via Quantum Reservoir Computing (2023)0.00
• MADQRL: Distributed Quantum Reinforcement Learning Framework For Multi-agent Environments (2026)0.00
• A Survey On Quantum Reinforcement Learning (2022)0.00
• Exponential Improvements For Quantum-accessible Reinforcement Learning (2017)0.00
• From Classical Data To Quantum Advantage -- Quantum Policy Evaluation On Quantum Hardware (2025)0.00
• Hybrid Quantum-classical Algorithm For Near-optimal Planning In Pomdps (2025)0.00
• Reliable Validation Of Reinforcement Learning Benchmarks (2022)0.00