A Study on Optimization Techniques for Variational Quantum Circuits in Reinforcement Learning
Michael Kölle, Timo Witter, Tobias Rohe, Gerhard Stenzel, Philipp Altmann, Thomas Gabor
TL;DR
This work investigates optimization techniques for variational quantum circuits used as actors in a quantum PPO framework for reinforcement learning. By evaluating data re-uploading, input scaling, output scaling, and exponential learning-rate decay in Frozen Lake and Cart Pole environments, the authors systematically assess parameter-efficiency and learning robustness against a classical PPO baseline. Key findings show that data re-uploading and trainable output scaling substantially improve stability and learning speed, while exponential learning-rate decay further stabilizes training; however, none of the VQC-based approaches consistently outperform the classical PPO with an equivalent parameter count. The study provides practical guidance for designing VQC-based RL agents in the NISQ era and highlights directions for future work, including continuous action spaces and deployment on real quantum hardware to assess quantum-noise effects.
Abstract
Quantum Computing aims to streamline machine learning, making it more effective with fewer trainable parameters. This reduction of parameters can speed up the learning process and reduce the use of computational resources. However, in the current phase of quantum computing development, known as the noisy intermediate-scale quantum era (NISQ), learning is difficult due to a limited number of qubits and widespread quantum noise. To overcome these challenges, researchers are focusing on variational quantum circuits (VQCs). VQCs are hybrid algorithms that merge a quantum circuit, which can be adjusted through parameters, with traditional classical optimization techniques. These circuits require only few qubits for effective learning. Recent studies have presented new ways of applying VQCs to reinforcement learning, showing promising results that warrant further exploration. This study investigates the effects of various techniques -- data re-uploading, input scaling, output scaling -- and introduces exponential learning rate decay in the quantum proximal policy optimization algorithm's actor-VQC. We assess these methods in the popular Frozen Lake and Cart Pole environments. Our focus is on their ability to reduce the number of parameters in the VQC without losing effectiveness. Our findings indicate that data re-uploading and an exponential learning rate decay significantly enhance hyperparameter stability and overall performance. While input scaling does not improve parameter efficiency, output scaling effectively manages greediness, leading to increased learning speed and robustness.
