Absence of barren plateaus in finite local-depth circuits with long-range entanglement
arXiv:2311.01393 · doi:10.1103/PhysRevLett.132.150603
Abstract
Ground state preparation is classically intractable for general Hamiltonians. On quantum devices, shallow parameterized circuits can be effectively trained to obtain short-range entangled states under the paradigm of variational quantum eigensolver, while deep circuits are generally untrainable due to the barren plateau phenomenon. In this Letter, we give a general lower bound on the variance of circuit gradients for arbitrary quantum circuits composed of local 2-designs. Based on our unified framework, we prove the absence of barren plateaus in training finite local-depth circuits (FLDC) for the ground states of local Hamiltonians. FLDCs are allowed to be deep in the conventional circuit depth to generate long-range entangled ground states, such as topologically ordered states, but their local depths are finite, i.e., there is only a finite number of gates acting on individual qubits. This characteristic sets FLDC apart from shallow circuits: FLDC in general cannot be classically simulated to estimate local observables efficiently by existing tensor network methods in two and higher dimensions. We validate our analytical results with extensive numerical simulations and demonstrate the effectiveness of variational training using the generalized toric code model.
38 pages, 8 figures
References in corpus (43)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- The density-matrix renormalization group in the age of matrix product states
- Variational Quantum Algorithms
- Quantum computational advantage using photons
- Logical quantum processor based on reconfigurable atom arrays
- The Variational Quantum Eigensolver: a review of methods and best practices
- A class of quantum many-body states that can be efficiently simulated
- Lieb-Robinson bounds and the generation of correlations and topological quantum order
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- Criticality, the area law, and the computational power of PEPS
- Training variational quantum algorithms is NP-hard
- Information Scrambling in Computationally Complex Quantum Circuits
- Breakdown of a topological phase: Quantum phase transition in a loop gas model with tension
- Effect of barren plateaus on gradient-free optimization
- Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
- Solving the sampling problem of the Sycamore quantum circuits
- Equivalence of quantum barren plateaus to cost concentration and narrow gorges
- TensorCircuit: a Quantum Software Framework for the NISQ Era
- Sequential Generation of Matrix-Product States in Cavity QED
- Hierarchy of topological order from finite-depth unitaries, measurement and feedforward
- Quantum Circuits assisted by LOCC: Transformations and Phases of Matter
- On barren plateaus and cost function locality in variational quantum algorithms
- Preparation of matrix product states with log-depth quantum circuits
- ADAPT-VQE is insensitive to rough parameter landscapes and barren plateaus
- The Variational Power of Quantum Circuit Tensor Networks
- Shortest Route to Non-Abelian Topological Order on a Quantum Processor
- Barren plateaus in quantum tensor network optimization
- Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
- Variational Quantum-Neural Hybrid Eigensolver
- Methods for simulating string-net states and anyons on a digital quantum computer
- Sequentially generated states for the study of two dimensional systems
- The Presence and Absence of Barren Plateaus in Tensor-network Based Machine Learning
- Sequential Quantum Circuits as Maps between Gapped Phases
- Non-zero momentum requires long-range entanglement
- Probing many-body localization by excited-state VQE
- Variational waveguide QED simulators
- Automatically Differentiable Quantum Circuit for Many-qubit State Preparation
- Training variational quantum algorithms with random gate activation
- Quantum-classical eigensolver using multiscale entanglement renormalization
- Quantum phase transition between symmetry enriched topological phases in tensor-network states
- Barren plateaus from learning scramblers with local cost functions
- Parametrized quantum circuit for weight-adjustable quantum loop gas
- Sequential quantum simulation of spin chains with a single circuit QED device
Cited by in corpus (27)
- Barren Plateaus in Variational Quantum Computing
- A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
- Does provable absence of barren plateaus imply classical simulability?
- Classically estimating observables of noiseless quantum circuits
- Quantum algorithms for scientific computing
- Efficient MPS representations and quantum circuits from the Fourier modes of classical image data
- Automatic quantum circuit encoding of a given arbitrary quantum state
- Equivalence of cost concentration and gradient vanishing for quantum circuits: An elementary proof in the Riemannian formulation
- Stabilizer ground states for simulating quantum many-body physics: theory, algorithms, and applications
- Variational quantum computing for quantum simulation: principles, implementations, and challenges
- Quantum computing for genomics: conceptual challenges and practical perspectives
- Pitfalls when tackling the exponential concentration of parameterized quantum models
- Variational LOCC-assisted quantum circuits for long-range entangled states
- Tangent Space Excitation Ansatz for Quantum Circuits
- Cost of Locally Approximating High-Dimensional Ground States of Contextual Quantum Models
- Typical Machine Learning Datasets as Low-Depth Quantum Circuits
- Quantitative convergence of trained quantum neural networks to a Gaussian process
- Estimates of loss function concentration in noisy parametrized quantum circuits
- The Dual Role of Low-Weight Pauli Propagation: A Flawed Simulator but a Powerful Initializer for Variational Quantum Algorithms
- Efficient Online Quantum Circuit Learning with No Upfront Training
- OnionVQE Optimization Strategy for Ground State Preparation on NISQ Devices
- Exploiting many-body localization for scalable variational quantum simulation
- Quantum solver for single-impurity Anderson models with particle-hole symmetry
- Equivalence between exponential concentration in quantum machine learning kernels and barren plateaus in variational algorithms
- Gradient Scalability and Taylor Surrogation of Quantum Cost Landscapes
- Superior resilience to poisoning and amenability to unlearning in quantum machine learning
- Noisy Monitored Quantum Circuits