PPO-Q: Proximal Policy Optimization with Parametrized Quantum Policies or Values
Yu-Xin Jin, Zi-Wei Wang, Hong-Ze Xu, Wei-Feng Zhuang, Meng-Jun Hu, and, Dong E. Liu

TL;DR
This paper introduces PPO-Q, a hybrid quantum-classical reinforcement learning algorithm that enhances performance in complex environments with high-dimensional states and continuous actions, while reducing training parameters and being compatible with current quantum hardware.
Contribution
PPO-Q integrates hybrid quantum-classical networks into PPO, enabling effective learning in complex environments and successful deployment on real quantum hardware.
Findings
Achieved state-of-the-art performance in complex environments
Reduced training parameters compared to classical PPO
Successfully trained on real quantum hardware
Abstract
Quantum machine learning (QML), which combines quantum computing with machine learning, is widely believed to hold the potential to outperform traditional machine learning in the era of noisy intermediate-scale quantum (NISQ). As one of the most important types of QML, quantum reinforcement learning (QRL) with parameterized quantum circuits as agents has received extensive attention in the past few years. Various algorithms and techniques have been introduced, demonstrating the effectiveness of QRL in solving some popular benchmark environments such as CartPole, FrozenLake, and MountainCar. However, tackling more complex environments with continuous action spaces and high-dimensional state spaces remains challenging within the existing QRL framework. Here we present PPO-Q, which, by integrating hybrid quantum-classical networks into the actor or critic part of the proximal policy…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
