Large gradients via correlation in random parameterized quantum circuits

Abstract

Scaling of variational quantum algorithms to large problem sizes requires efficient optimization of random parameterized quantum circuits. For such circuits with uncorrelated parameters, the presence of exponentially vanishing gradients in cost function landscapes is an obstacle to optimization by gradient descent methods. In this work, we prove that reducing the dimensionality of the parameter space by utilizing circuit modules containing spatially or temporally correlated gate layers can allow one to circumvent the vanishing gradient phenomenon. Examples are drawn from random separable circuits and asymptotically optimal variational versions of Grover's algorithm based on the quantum alternating operator ansatz (QAOA). In the latter scenario, our bounds on cost function variation imply a transition between vanishing gradients and efficient trainability as the number of layers is increased toward $\mathcal{O}(2^{n/2})$, the optimal oracle complexity of quantum unstructured search.

arXiv comment21 pages, 3 figures

References in corpus (52)

• A variational eigenvalue solver on a quantum processor
• Quantum Mechanics helps in searching for a needle in a haystack
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• Quantum Teleportation is a Universal Computational Primitive
• A Quantum Approximate Optimization Algorithm
• Quantum Convolutional Neural Networks
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Lieb-Robinson bounds and the generation of correlations and topological quantum order
• Efficient variational quantum simulator incorporating active error minimisation
• Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
• Grover's quantum searching algorithm is optimal
• Measurement-driven entanglement transition in hybrid quantum circuits
• Theory of variational quantum simulation
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Quantum-assisted quantum compiling
• Absence of Barren Plateaus in Quantum Convolutional Neural Networks
• Quantum Data Hiding
• Sequential generation of entangled multi-qubit states
• Layerwise learning for quantum neural networks
• Local random quantum circuits are approximate polynomial-designs
• Subspace-search variational quantum eigensolver for excited states
• Variational quantum algorithms for discovering Hamiltonian spectra
• Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
• Stochastic gradient descent for hybrid quantum-classical optimization
• Variational Quantum State Diagonalization
• Noise Resilience of Variational Quantum Compiling
• Variational algorithms for linear algebra
• Variational Quantum State Eigensolver
• Near-optimal quantum circuit for Grover's unstructured search using a transverse field
• An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
• Low-depth gradient measurements can improve convergence in variational hybrid quantum-classical algorithms
• Globally controlled quantum wires for perfect qubit transport, mirroring and computing
• Local asymptotic normality for qubit states
• Learning to learn with quantum neural networks via classical neural networks
• Quantum approximate optimization is computationally universal
• Variational Consistent Histories as a Hybrid Algorithm for Quantum Foundations
• Near-term quantum algorithms for linear systems of equations
• Depth optimization of quantum search algorithms beyond Grover's algorithm
• Variationally Learning Grover's Quantum Search Algorithm
• Subspace Variational Quantum Simulator
• Quantum computation via translation-invariant operations on a chain of qubits
• Noise-Resilient Quantum Dynamics Using Symmetry-Preserving Ansatzes
• Learning Unitaries by Gradient Descent
• Operator Sampling for Shot-frugal Optimization in Variational Algorithms
• Quantum linear system solver based on time-optimal adiabatic quantum computing and quantum approximate optimization algorithm
• Variational quantum state preparation via quantum data buses
• Quadratic Clifford expansion for efficient benchmarking and initialization of variational quantum algorithms
• Efficient trainability of linear optical modules in quantum optical neural networks

Cited by in corpus (98)

• Variational Quantum Algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• The Variational Quantum Eigensolver: a review of methods and best practices
• The power of quantum neural networks
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Challenges and Opportunities in Quantum Machine Learning
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Generalization in quantum machine learning from few training data
• Absence of Barren Plateaus in Quantum Convolutional Neural Networks
• Layerwise learning for quantum neural networks
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Barren Plateaus in Variational Quantum Computing
• Variational Quantum Linear Solver
• Quantum circuit architecture search for variational quantum algorithms
• Trainability of Dissipative Perceptron-Based Quantum Neural Networks
• Group-Invariant Quantum Machine Learning
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• Entanglement Devised Barren Plateau Mitigation
• Variational Quantum State Eigensolver
• Barren plateaus preclude learning scramblers
• Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
• Capacity and quantum geometry of parametrized quantum circuits
• Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
• Avoiding barren plateaus using classical shadows
• Quantum computing models for artificial neural networks
• Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicator
• Theory for Equivariant Quantum Neural Networks
• Quantum Machine Learning: from physics to software engineering
• The Variational Power of Quantum Circuit Tensor Networks
• Variational Quantum Algorithm for Estimating the Quantum Fisher Information
• Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
• Hamiltonian variational ansatz without barren plateaus
• Reformulation of the No-Free-Lunch Theorem for Entangled Data Sets
• The Adjoint Is All You Need: Characterizing Barren Plateaus in Quantum Ansätze
• Variational Hamiltonian Diagonalization for Dynamical Quantum Simulation
• Universal Effectiveness of High-Depth Circuits in Variational Eigenproblems
• Reflection Equivariant Quantum Neural Networks for Enhanced Image Classification
• Benchmarking simulated and physical quantum processing units using quantum and hybrid algorithms
• Avoiding Barren Plateaus with Classical Deep Neural Networks
• MoG-VQE: Multiobjective genetic variational quantum eigensolver
• Detecting and quantifying entanglement on near-term quantum devices
• Natural Evolutionary Strategies for Variational Quantum Computation
• Gradient Ascent Pulse Engineering with Feedback
• Symmetry enhanced variational quantum spin eigensolver
• Variational Quantum Anomaly Detection: Unsupervised mapping of phase diagrams on a physical quantum computer
• Trainability Enhancement of Parameterized Quantum Circuits via Reduced-Domain Parameter Initialization
• Long-time simulations with high fidelity on quantum hardware
• Grover search revisited; application to image pattern matching
• Dynamical simulation via quantum machine learning with provable generalization
• Entanglement entropy production in Quantum Neural Networks
• Classification of dynamical Lie algebras for translation-invariant 2-local spin systems in one dimension
• Retrieving information from a black hole using quantum machine learning
• Engineered dissipation to mitigate barren plateaus
• Tight and Efficient Gradient Bounds for Parameterized Quantum Circuits
• Variational quantum algorithms to estimate rank, quantum entropies, fidelity and Fisher information via purity minimization
• Classical Splitting of Parametrized Quantum Circuits
• Isometric tensor network optimization for extensive Hamiltonians is free of barren plateaus
• Approximate complex amplitude encoding algorithm and its application to data classification problems
• The Unified Effect of Data Encoding, Ansatz Expressibility and Entanglement on the Trainability of HQNNs
• Symmetry breaking in geometric quantum machine learning in the presence of noise
• The quantum cost function concentration dependency on the parametrization expressivity
• Barren plateaus from learning scramblers with local cost functions
• Beyond unital noise in variational quantum algorithms: noise-induced barren plateaus and limit sets
• Evolution strategies: Application in hybrid quantum-classical neural networks
• Mitigated barren plateaus in the time-nonlocal optimization of analog quantum-algorithm protocols
• VQE Method: A Short Survey and Recent Developments
• Hybrid quantum learning with data re-uploading on a small-scale superconducting quantum simulator
• Variational Quantum Algorithms for Trace Distance and Fidelity Estimation
• Measurement-induced entanglement phase transitions in variational quantum circuits
• Sequential optimal selection of a single-qubit gate and its relation to barren plateau in parameterized quantum circuits
• Bayesian Learning of Parameterised Quantum Circuits
• Characterization of variational quantum algorithms using free fermions
• Near-term Efficient Quantum Algorithms for Entanglement Analysis
• Energy-dependent barren plateau in bosonic variational quantum circuits
• Maximising Quantum-Computing Expressive Power through Randomised Circuits
• Machine-Learning Insights into the Entanglement-trainability Correlation of Parameterized Quantum Circuits
• Scalability Challenges in Variational Quantum Optimization under Stochastic Noise
• Single entanglement connection architecture between multi-layer bipartite Hardware Efficient Ansatz
• Quantum Extremal Learning
• Backpropagation scaling in parameterised quantum circuits
• Restricting to the chip architecture maintains the quantum neural network accuracy
• Sketching the Best Approximate Quantum Compiling Problem
• Perturbative gadgets for gate-based quantum computing: Non-recursive constructions without subspace restrictions
• Universal compiling and (No-)Free-Lunch theorems for continuous variable quantum learning
• Learning to learn with an evolutionary strategy applied to variational quantum algorithms
• Barren plateaus are amplified by the dimension of qudits
• Quantum Generative Training Using Rényi Divergences
• An Efficient Gradient Sensitive Alternate Framework for VQE with Variable Ansatz
• Policy Gradient Approach to Compilation of Variational Quantum Circuits
• Symmetry-enhanced Counterdiabatic Quantum Algorithm for Qudits
• A general approach to quantum integration of cross sections in high-energy physics
• Mitigating Noise-Induced Gradient Vanishing in Variational Quantum Algorithm Training
• Batched Line Search Strategy for Navigating through Barren Plateaus in Quantum Circuit Training
• Efficient trainability of linear optical modules in quantum optical neural networks
• Improving the trainability of VQE on NISQ computers for solving portfolio optimization using convex interpolation
• Gradient Scalability and Taylor Surrogation of Quantum Cost Landscapes
• Hamiltonian Expressibility for Ansatz Selection in Variational Quantum Algorithms