Benchmarking Quantum Reinforcement Learning
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912741726355456 |
|---|---|
| author | Meyer, Nico Ufrecht, Christian Yammine, George Kontes, Georgios Mutschler, Christopher Scherer, Daniel D. |
| author_facet | Meyer, Nico Ufrecht, Christian Yammine, George Kontes, Georgios Mutschler, Christopher Scherer, Daniel D. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_15893 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Benchmarking Quantum Reinforcement Learning Meyer, Nico Ufrecht, Christian Yammine, George Kontes, Georgios Mutschler, Christopher Scherer, Daniel D. Quantum Physics Machine Learning 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. |
| title | Benchmarking Quantum Reinforcement Learning |
| topic | Quantum Physics Machine Learning |
| url | https://arxiv.org/abs/2501.15893 |