Quantum Policy Gradient Algorithm with Optimized Action Decoding
Abstract
Quantum machine learning implemented by variational quantum circuits (VQCs) is considered a promising concept for the noisy intermediate-scale quantum computing era. Focusing on applications in quantum reinforcement learning, we propose a specific action decoding procedure for a quantum policy gradient approach. We introduce a novel quality measure that enables us to optimize the classical post-processing required for action selection, inspired by local and global quantum measurements. The resulting algorithm demonstrates a significant performance improvement in several benchmark environments. With this technique, we successfully execute a full training routine on a 5-qubit hardware device. Our method introduces only negligible classical overhead and has the potential to improve VQC-based algorithms beyond the field of quantum reinforcement learning.
Cite
@article{arxiv.2212.06663,
title = {Quantum Policy Gradient Algorithm with Optimized Action Decoding},
author = {Nico Meyer and Daniel D. Scherer and Axel Plinge and Christopher Mutschler and Michael J. Hartmann},
journal= {arXiv preprint arXiv:2212.06663},
year = {2023}
}
Comments
Accepted to the 40th International Conference on Machine Learning (ICML 2023), Honolulu, Hawaii, USA. 22 pages, 10 figures, 3 tables