Direct Gradient Computation for Barren Plateaus in Parameterized Quantum Circuits

Abstract

The barren plateau phenomenon, where the gradients of parametrized quantum circuits become vanishingly small, poses a significant challenge in quantum machine learning. While previous studies attempted to explain the barren plateau phenomenon using the Weingarten formula, the reliance on the Weingarten formula leads to inaccurate conclusions. In this study, we consider a unitary operator \(U\) consisting of rotation gates and perform an exact calculation of the expectation required for the gradient computation. Our approach allows us to obtain the gradient expectation and variance directly. Our analysis reveals that gradient expectations are not zero, as opposed to the results derived using the Weingarten formula, but depend on the number of qubits in the system. Furthermore, we demonstrate how the number of effective parameters, circuit depth, and gradient variance are interconnected in deep parameterized quantum circuits. Numerical simulations further confirm the validity of our theoretical results. Our approach provides a more accurate framework for analyzing quantum circuit optimization.

20 pages, 4 figures

References in corpus (23)

• Barren plateaus in quantum neural network training landscapes
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Barren Plateaus in Variational Quantum Computing
• Quantum machine learning beyond kernel methods
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• Entanglement Devised Barren Plateau Mitigation
• Barren plateaus preclude learning scramblers
• On barren plateaus and cost function locality in variational quantum algorithms
• MAXCUT QAOA performance guarantees for p >1
• Does provable absence of barren plateaus imply classical simulability?
• Out-of-distribution generalization for learning quantum dynamics
• On the practical usefulness of the Hardware Efficient Ansatz
• Information Scrambling in Quantum Neural Networks
• Towards large-scale quantum optimization solvers with few qubits
• Classical simulation of short-time quantum dynamics
• Trainability Enhancement of Parameterized Quantum Circuits via Reduced-Domain Parameter Initialization
• Classification of dynamical Lie algebras for translation-invariant 2-local spin systems in one dimension
• Tight and Efficient Gradient Bounds for Parameterized Quantum Circuits
• Avoiding Barren Plateaus with Entanglement
• Concentration bounds for quantum states and limitations on the QAOA from polynomial approximations