Trainability issues in quantum policy gradients

Abstract

This research explores the trainability of Parameterized Quantum circuit-based policies in Reinforcement Learning, an area that has recently seen a surge in empirical exploration. While some studies suggest improved sample complexity using quantum gradient estimation, the efficient trainability of these policies remains an open question. Our findings reveal significant challenges, including standard Barren Plateaus with exponentially small gradients and gradient explosion. These phenomena depend on the type of basis-state partitioning and mapping these partitions onto actions. For a polynomial number of actions, a trainable window can be ensured with a polynomial number of measurements if a contiguous-like partitioning of basis-states is employed. These results are empirically validated in a multi-armed bandit environment.

References in corpus (10)

• Variational Quantum Algorithms
• Barren plateaus in quantum neural network training landscapes
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Evaluating analytic gradients on quantum hardware
• Stabilizer Rényi entropy
• Effect of barren plateaus on gradient-free optimization
• Quantum agents in the Gym: a variational quantum algorithm for deep Q-learning
• On barren plateaus and cost function locality in variational quantum algorithms
• Universal Variational Quantum Computation
• Quantum Deep Hedging