Equivalence of cost concentration and gradient vanishing for quantum circuits: An elementary proof in the Riemannian formulation

Abstract

The optimization of quantum circuits can be hampered by a decay of average gradient amplitudes with increasing system size. When the decay is exponential, this is called the barren plateau problem. Considering explicit circuit parametrizations (in terms of rotation angles), it has been shown in Arrasmith et al., Quantum Sci. Technol. 7, 045015 (2022) that barren plateaus are equivalent to an exponential decay of the variance of cost-function differences. We show that the issue is particularly simple in the (parametrization-free) Riemannian formulation of such optimization problems and obtain a tighter bound for the cost-function variance. An elementary derivation shows that the single-gate variance of the cost function is strictly equal to half the variance of the Riemannian single-gate gradient, where we sample variable gates according to the uniform Haar measure. The total variances of the cost function and its gradient are then both bounded from above by the sum of single-gate variances and, conversely, bound single-gate variances from above. So, decays of gradients and cost-function variations go hand in hand, and barren plateau problems cannot be resolved by avoiding gradient-based in favor of gradient-free optimization methods.

arXiv comment8 pages main text, 4 pages appendix, 6 figures; improved presentation, added numerical confirmation for MERA, extended discussion section, demonstrating that single-gate gradient variances can provide more detailed and useful trainability information than total variances alone; published version

References in corpus (17)

• The density-matrix renormalization group in the age of matrix product states
• Variational Quantum Algorithms
• Barren plateaus in quantum neural network training landscapes
• Entanglement renormalization
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• A class of quantum many-body states that can be efficiently simulated
• Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
• Classical simulation of quantum many-body systems with a tree tensor network
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Layerwise learning for quantum neural networks
• Effect of barren plateaus on gradient-free optimization
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• Avoiding barren plateaus via transferability of smooth solutions in Hamiltonian Variational Ansatz
• Absence of barren plateaus in finite local-depth circuits with long-range entanglement
• Optimizing quantum circuits with Riemannian gradient flow
• Isometric tensor network optimization for extensive Hamiltonians is free of barren plateaus
• Quantum-classical eigensolver using multiscale entanglement renormalization

Cited by in corpus (4)

• Barren Plateaus in Variational Quantum Computing
• Barren plateaus are swamped with traps
• Absence of barren plateaus and scaling of gradients in the energy optimization of isometric tensor network states
• Benchmarking Variational Quantum Algorithms for Combinatorial Optimization in Practice