Absence of barren plateaus in finite local-depth circuits with long-range entanglement

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.

arXiv comment38 pages, 8 figures

References in corpus (91)

• Quantum Computing in the NISQ era and beyond
• Fault-tolerant quantum computation by anyons
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Anyons in an exactly solved model and beyond
• A variational eigenvalue solver on a quantum processor
• The density-matrix renormalization group in the age of matrix product states
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Topological entanglement entropy
• Quantum computational advantage using photons
• Entanglement renormalization
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Logical quantum processor based on reconfigurable atom arrays
• Fast Scramblers
• An Area Law for One Dimensional Quantum Systems
• The Variational Quantum Eigensolver: a review of methods and best practices
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Classification of Gapped Symmetric Phases in 1D Spin Systems
• A class of quantum many-body states that can be efficiently simulated
• Classifying quantum phases using Matrix Product States and PEPS
• Lieb-Robinson bounds and the generation of correlations and topological quantum order
• Time-evolution methods for matrix-product states
• Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Criticality, the area law, and the computational power of PEPS
• Stripe order in the underdoped region of the two-dimensional Hubbard model
• Tensor networks for complex quantum systems
• Simulating quantum computation by contracting tensor networks
• Towards the fast scrambling conjecture
• Training variational quantum algorithms is NP-hard
• Quantum orders in an exact soluble model
• Complete classification of 1D gapped quantum phases in interacting spin systems
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Sequential generation of entangled multi-qubit states
• The computational complexity of PEPS
• Absence of superconductivity in the pure two-dimensional Hubbard model
• 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
• Numerical evidence of fluctuating stripes in the normal state of high-Tc cuprate superconductors
• Structure optimization for parameterized quantum circuits
• Long-range quantum entanglement in noisy cluster states
• Quantum circuit architecture search for variational quantum algorithms
• Hyper-optimized tensor network contraction
• Sequential minimal optimization for quantum-classical hybrid algorithms
• Lecture Notes of Tensor Network Contractions
• Differentiable Quantum Architecture Search
• Solving the sampling problem of the Sycamore quantum circuits
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
• Isometric Tensor Network States in Two Dimensions
• Barren plateaus preclude learning scramblers
• TensorCircuit: a Quantum Software Framework for the NISQ Era
• Sequential Generation of Matrix-Product States in Cavity QED
• Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
• Hierarchy of topological order from finite-depth unitaries, measurement and feedforward
• Quantum Circuits assisted by LOCC: Transformations and Phases of Matter
• Identification of symmetry-protected topological states on noisy quantum computers
• On barren plateaus and cost function locality in variational quantum algorithms
• Preparation of matrix product states with log-depth quantum circuits
• Phase diagram of the toric code model in a parallel magnetic field
• 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
• Contracting Arbitrary Tensor Networks: General Approximate Algorithm and Applications in Graphical Models and Quantum Circuit Simulations
• Variational Quantum-Neural Hybrid Eigensolver
• Methods for simulating string-net states and anyons on a digital quantum computer
• Classical algorithms for quantum mean values
• Characterizing the loss landscape of variational quantum circuits
• Isometric Tensor Network representation of string-net liquids
• Contracting projected entangled pair states is average-case hard
• Sequentially generated states for the study of two dimensional systems
• The Presence and Absence of Barren Plateaus in Tensor-network Based Machine Learning
• Universal Effectiveness of High-Depth Circuits in Variational Eigenproblems
• Sequential Quantum Circuits as Maps between Gapped Phases
• Tensor Network Contractions for #SAT
• 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
• Approximating local observables on projected entangled pair states
• 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
• How local is the information in MPS/PEPS tensor networks?
• 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