Barren Plateaus in Variational Quantum Computing

Abstract

Variational quantum computing offers a flexible computational paradigm with applications in diverse areas. However, a key obstacle to realizing their potential is the Barren Plateau (BP) phenomenon. When a model exhibits a BP, its parameter optimization landscape becomes exponentially flat and featureless as the problem size increases. Importantly, all the moving pieces of an algorithm -- choices of ansatz, initial state, observable, loss function and hardware noise -- can lead to BPs when ill-suited. Due to the significant impact of BPs on trainability, researchers have dedicated considerable effort to develop theoretical and heuristic methods to understand and mitigate their effects. As a result, the study of BPs has become a thriving area of research, influencing and cross-fertilizing other fields such as quantum optimal control, tensor networks, and learning theory. This article provides a comprehensive review of the current understanding of the BP phenomenon.

24 pages, 10 boxes, updated to published version

References in corpus (172)

• Quantum Machine Learning
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Supervised learning with quantum enhanced feature spaces
• Barren plateaus in quantum neural network training landscapes
• Solving the Quantum Many-Body Problem with Artificial Neural Networks
• Noisy intermediate-scale quantum (NISQ) algorithms
• Machine learning phases of matter
• Error mitigation for short-depth quantum circuits
• An introduction to quantum machine learning
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Exact solutions to the nonlinear dynamics of learning in deep linear neural networks
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Power of data in quantum machine learning
• Towards Practical Quantum Variational Algorithms
• Efficient Learning for Deep Quantum Neural Networks
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Quantum Error Mitigation
• Quantum generative adversarial learning
• Hybrid quantum-classical algorithms and quantum error mitigation
• Quantum Natural Gradient
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• Training variational quantum algorithms is NP-hard
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• A generative modeling approach for benchmarking and training shallow quantum circuits
• Quantum-assisted quantum compiling
• Absence of Barren Plateaus in Quantum Convolutional Neural Networks
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• Most quantum states are too entangled to be useful as computational resources
• Differentiable Learning of Quantum Circuit Born Machine
• Opportunities and challenges for quantum-assisted machine learning in near-term quantum computers
• Deep autoregressive models for the efficient variational simulation of many-body quantum systems
• Learning the quantum algorithm for state overlap
• Is there evidence for exponential quantum advantage in quantum chemistry?
• The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Effect of barren plateaus on gradient-free optimization
• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
• Quantum circuit architecture search for variational quantum algorithms
• Exploiting symmetry in variational quantum machine learning
• Trainability of Dissipative Perceptron-Based Quantum Neural Networks
• Theory of overparametrization in quantum neural networks
• Fundamental limits of quantum error mitigation
• Differentiable Quantum Architecture Search
• Group-Invariant Quantum Machine Learning
• The Born Supremacy: Quantum Advantage and Training of an Ising Born Machine
• Reachability Deficits in Quantum Approximate Optimization
• Large gradients via correlation in random parameterized quantum circuits
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• Variational Quantum State Eigensolver
• Entanglement Devised Barren Plateau Mitigation
• Barren plateaus preclude learning scramblers
• Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
• Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
• Are random pure states useful for quantum computation?
• On barren plateaus and cost function locality in variational quantum algorithms
• Digitized-counterdiabatic quantum approximate optimization algorithm
• Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation
• From pulses to circuits and back again: A quantum optimal control perspective on variational quantum algorithms
• Universal expressiveness of variational quantum classifiers and quantum kernels for support vector machines
• Theory for Equivariant Quantum Neural Networks
• Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
• Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networks
• Tunable Efficient Unitary Neural Networks (EUNN) and their application to RNNs
• ADAPT-VQE is insensitive to rough parameter landscapes and barren plateaus
• Universal discriminative quantum neural networks
• Symmetry Principles in Quantum Systems Theory
• Matchgate Shadows for Fermionic Quantum Simulation
• Barren plateaus in quantum tensor network optimization
• The Meta-Variational Quantum Eigensolver (Meta-VQE): Learning energy profiles of parameterized Hamiltonians for quantum simulation
• Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
• Correlation-Informed Permutation of Qubits for Reducing Ansatz Depth in VQE
• On the practical usefulness of the Hardware Efficient Ansatz
• Hamiltonian variational ansatz without barren plateaus
• Learning quantum data with the quantum Earth Mover's distance
• Shadows of quantum machine learning
• Solving Nuclear Structure Problems with the Adaptive Variational Quantum Algorithm
• Avoiding barren plateaus via transferability of smooth solutions in Hamiltonian Variational Ansatz
• Variational Quantum Eigensolver for Frustrated Quantum Systems
• The Adjoint Is All You Need: Characterizing Barren Plateaus in Quantum Ansätze
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition
• Universal Sampling Lower Bounds for Quantum Error Mitigation
• Adaptive pruning-based optimization of parameterized quantum circuits
• Mutual information-assisted Adaptive Variational Quantum Eigensolver
• Iterative Quantum Assisted Eigensolver
• The Presence and Absence of Barren Plateaus in Tensor-network Based Machine Learning
• Constrained mixers for the quantum approximate optimization algorithm
• Building spatial symmetries into parameterized quantum circuits for faster training
• Quantum natural gradient generalised to noisy and non-unitary circuits
• Graph neural network initialisation of quantum approximate optimisation
• TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit ansätze
• Training Saturation in Layerwise Quantum Approximate Optimisation
• Benchmarking adaptive variational quantum eigensolvers
• Abrupt Transitions in Variational Quantum Circuit Training
• MoG-VQE: Multiobjective genetic variational quantum eigensolver
• Variational quantum compiling with double Q-learning
• Progress toward favorable landscapes in quantum combinatorial optimization
• Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
• Characterization of solvable spin models via graph invariants
• Trainability barriers and opportunities in quantum generative modeling
• Mitigating Barren Plateaus with Transfer-learning-inspired Parameter Initializations
• The Power of Noisy Fermionic Quantum Computation
• Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths
• Quantum-to-Classical Correspondence and Hubbard-Stratonovich Dynamical Systems, a Lie-Algebraic Approach
• Quantum algorithms for approximate function loading
• Absence of barren plateaus in finite local-depth circuits with long-range entanglement
• Provably Trainable Rotationally Equivariant Quantum Machine Learning
• Efficient solvability of Hamiltonians and limits on the power of some quantum computational models
• High Dimensional Quantum Machine Learning With Small Quantum Computers
• Trainability Enhancement of Parameterized Quantum Circuits via Reduced-Domain Parameter Initialization
• Non-trivial symmetries in quantum landscapes and their resilience to quantum noise
• A semi-agnostic ansatz with variable structure for quantum machine learning
• Quantum Deep Hedging
• Representation Theory for Geometric Quantum Machine Learning
• Efficient classical algorithms for simulating symmetric quantum systems
• Pulse based Variational Quantum Optimal Control for hybrid quantum computing
• Quantum Computational Phase Transition in Combinatorial Problems
• Variational Quantum Time Evolution without the Quantum Geometric Tensor
• On fundamental aspects of quantum extreme learning machines
• Fourier expansion in variational quantum algorithms
• Classification of dynamical Lie algebras for translation-invariant 2-local spin systems in one dimension
• On the Sample Complexity of Quantum Boltzmann Machine Learning
• Variational quantum simulation: a case study for understanding warm starts
• Alleviating Barren Plateaus in Parameterized Quantum Machine Learning Circuits: Investigating Advanced Parameter Initialization Strategies
• Engineered dissipation to mitigate barren plateaus
• Learning shallow quantum circuits
• Tight and Efficient Gradient Bounds for Parameterized Quantum Circuits
• Efficient estimation of trainability for variational quantum circuits
• Tensor Programs V: Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfer
• Low-depth Hamiltonian Simulation by Adaptive Product Formula
• Shortcuts to Quantum Approximate Optimization Algorithm
• Quantum Convolutional Neural Networks are Effectively Classically Simulable
• Isometric tensor network optimization for extensive Hamiltonians is free of barren plateaus
• Computing exact moments of local random quantum circuits via tensor networks
• The Unified Effect of Data Encoding, Ansatz Expressibility and Entanglement on the Trainability of HQNNs
• The quantum cost function concentration dependency on the parametrization expressivity
• Barren plateaus from learning scramblers with local cost functions
• On the universality of $S_n$-equivariant $k$-body gates
• Beyond unital noise in variational quantum algorithms: noise-induced barren plateaus and limit sets
• Mitigated barren plateaus in the time-nonlocal optimization of analog quantum-algorithm protocols
• Optimizing Variational Quantum Algorithms with qBang: Efficiently Interweaving Metric and Momentum to Navigate Flat Energy Landscapes
• Analyzing variational quantum landscapes with information content
• Improving Gradient Methods via Coordinate Transformations: Applications to Quantum Machine Learning
• Constrained and Vanishing Expressivity of Quantum Fourier Models
• Convergence of Digitized-Counterdiabatic QAOA: circuit depth versus free parameters
• The role of data embedding in equivariant quantum convolutional neural networks
• Noise-induced shallow circuits and absence of barren plateaus
• Measurement-induced entanglement phase transitions in variational quantum circuits
• Trainability Barriers in Low-Depth QAOA Landscapes
• Emergence of noise-induced barren plateaus in arbitrary layered noise models
• Characterization of variational quantum algorithms using free fermions
• Energy-dependent barren plateau in bosonic variational quantum circuits
• Sequential optimal selection of a single-qubit gate and its relation to barren plateau in parameterized quantum circuits
• F-Divergences and Cost Function Locality in Generative Modelling with Quantum Circuits
• Laziness, Barren Plateau, and Noise in Machine Learning
• Barren plateaus are swamped with traps
• Equivalence of cost concentration and gradient vanishing for quantum circuits: An elementary proof in the Riemannian formulation
• Mitigating Quantum Errors via Truncated Neumann Series
• The power and limitations of learning quantum dynamics incoherently
• Beyond Quantum Annealing: Optimal control solutions to MaxCut problems
• Efficient quantum-enhanced classical simulation for patches of quantum landscapes
• Perturbative gadgets for gate-based quantum computing: Non-recursive constructions without subspace restrictions
• Dynamic parameterized quantum circuits: expressive and barren-plateau free

Cited by in corpus (95)

• Artificial Intelligence for Quantum Computing
• Classically estimating observables of noiseless quantum circuits
• Quantum Convolutional Neural Networks are Effectively Classically Simulable
• Scalable Quantum Simulations of Scattering in Scalar Field Theory on 120 Qubits
• Neural quantum kernels: training quantum kernels with quantum neural networks
• Constrained and Vanishing Expressivity of Quantum Fourier Models
• Quantum DeepONet: Neural operators accelerated by quantum computing
• Efficient Quantum Circuit Compilation for Near-Term Quantum Advantage
• Quantum Kernel Learning for Small Dataset Modeling in Semiconductor Fabrication: Application to Ohmic Contact
• Adversarial Robustness Guarantees for Quantum Classifiers
• Quantum continual learning on a programmable superconducting processor
• Approximate Unitary $k$-Designs from Shallow, Low-Communication Circuits
• Quantum reservoir computing on random regular graphs
• Double-bracket quantum algorithms for quantum imaginary-time evolution
• Towards Variational Quantum Algorithms for generalized linear and nonlinear transport phenomena
• Analyzing the quantum approximate optimization algorithm: ansätze, symmetries, and Lie algebras
• Quantum Dynamics Simulation of the Advection-Diffusion Equation
• Quantum computing for genomics: conceptual challenges and practical perspectives
• Compressed space quantum approximate optimization algorithm for constrained combinatorial optimization
• Scalability Challenges in Variational Quantum Optimization under Stochastic Noise
• Efficient quantum-enhanced classical simulation for patches of quantum landscapes
• Energy Landscape Plummeting in Variational Quantum Eigensolver: Subspace Optimization, Non-iterative Corrections and Generator-informed Initialization for Improved Quantum Efficiency
• Parallel-in-time quantum simulation via Page and Wootters quantum time
• On the similarity of bandwidth-tuned quantum kernels and classical kernels
• Deep Circuit Compression for Quantum Dynamics via Tensor Networks
• Inequality constraints in variational quantum circuits with qudits
• Optimization via Quantum Preconditioning
• Exploring nontrivial topology at quantum criticality in a superconducting processor
• Classical Benchmarks for Variational Quantum Eigensolver Simulations of the Hubbard Model
• Exact spectral gaps of random one-dimensional quantum circuits
• Non-linear classification capability of quantum neural networks due to emergent quantum metastability
• The Electronic Structure of the Hydrogen Molecule: A Tutorial Exercise in Classical and Quantum Computation
• Harnessing Quantum Computing for Energy Materials: Opportunities and Challenges
• Pitfalls when tackling the exponential concentration of parameterized quantum models
• Almost fault-tolerant quantum machine learning with drastic overhead reduction
• Architectures and random properties of symplectic quantum circuits
• Deep-Circuit QAOA
• Certified Random Number Generation using Quantum Computers
• Regularizing quantum loss landscapes by noise injection
• Quantum Physics-Informed Neural Networks for Maxwell's Equations: Circuit Design, "Black Hole" Barren Plateaus Mitigation, and GPU Acceleration
• Exponential distillation of dominant eigenproperties
• Quantitative convergence of trained quantum neural networks to a Gaussian process
• Fighting Exponentially Small Gaps by Counterdiabatic Driving
• Toward scalable quantum computations of atomic nuclei
• Quantum generative modeling for financial time series with temporal correlations
• An Efficient Decomposition of the Carleman Linearized Burgers' Equation
• The Lie Algebra of XY-mixer Topologies and Warm Starting QAOA for Constrained Optimization
• Bridging Quantum Computing and Nuclear Structure: Atomic Nuclei on a Trapped-Ion Quantum Computer
• Generative flow-based warm start of the variational quantum eigensolver
• Optimal quantum reservoir learning in proximity to universality
• The Dual Role of Low-Weight Pauli Propagation: A Flawed Simulator but a Powerful Initializer for Variational Quantum Algorithms
• Guided Graph Compression for Quantum Graph Neural Networks
• Approximate Quadratization of High-Order Hamiltonians for Combinatorial Quantum Optimization
• An Error Mitigated Non-Orthogonal Quantum Eigensolver via Shadow Tomography
• Graph Coloring via Quantum Optimization on a Rydberg-Qudit Atom Array
• Weighted Approximate Quantum Natural Gradient for Variational Quantum Eigensolver
• Notes on Quantum Computing for Thermal Science
• Quantum natural gradient with thermal-state initialization
• Double descent in quantum kernel methods
• Efficient Estimation and Sequential Optimization of Cost Functions in Variational Quantum Algorithms
• Estimates of loss function concentration in noisy parametrized quantum circuits
• Resource-efficient quantum algorithm for linear systems of equations
• Exploiting many-body localization for scalable variational quantum simulation
• Feasibility of performing quantum chemistry calculations on quantum computers
• Symmetry-based quantum algorithms for open-shop scheduling with hard constraints
• Who can compete with quantum computers? Lecture notes on quantum inspired tensor networks computational techniques
• Interpolation-based coordinate descent method for parameterized quantum circuits
• Optimizing Unitary Coupled Cluster Wave Functions on Quantum Hardware: Error Bound and Resource-Efficient Optimizer
• Performance evaluation of variational quantum eigensolver and quantum dynamics algorithms on the advection-diffusion equation
• Quantum Simulation-Based Optimization for Cooling System Design
• Direct Gradient Computation for Barren Plateaus in Parameterized Quantum Circuits
• Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization
• Gradient Scalability and Taylor Surrogation of Quantum Cost Landscapes
• Role of overparametrization in quantum approximate optimization
• Preparation of the single-spinon wave function on a quantum computer
• Superior resilience to poisoning and amenability to unlearning in quantum machine learning
• Decoded Quantum Interferometry Under Noise
• A penalty-free quantum algorithm to find energy eigenstates
• Double-bracket quantum algorithms for high-fidelity ground state preparation
• Evidence for effectively constant shot complexity in the quantum approximate optimization algorithm without per-instance optimization
• Slice-Wise Initial State Optimization to Improve Cost and Accuracy of the VQE on Lattice Models
• Quantum approximate optimization of finite-state bosonic systems
• Qubit-efficient quantum combinatorial optimization solver
• Recent quantum runtime (dis)advantages
• Quantum feature-map learning with reduced resource overhead
• Adaptive time Compressed QITE (ACQ) and its geometrical interpretation
• Data-driven Quantum Dynamical Embedding Method for Long-term Prediction on Near-term Quantum Computers
• Exploring fixed points and eigenstates of quantum systems with reinforcement learning
• Moments of Quantum Channel Ensembles
• Exploring the performance of superposition of product states: from 1D to 3D quantum spin systems
• Learning complexity gradually in quantum machine learning models
• Equivalence between exponential concentration in quantum machine learning kernels and barren plateaus in variational algorithms
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions
• Designing a Machine Learning-Driven, Cross-Hardware Emulator for Noisy Quantum Computers with Gate-Based Protocols
• Quantum Encoding of Structured Data with Matrix Product States