Isometric tensor network optimization for extensive Hamiltonians is free of barren plateaus

Abstract

We explain why and numerically confirm that there are no barren plateaus in the energy optimization of isometric tensor network states (TNS) for extensive Hamiltonians with finite-range interactions which are, for example, typical in condensed matter physics. Specifically, we consider matrix product states (MPS) with open boundary conditions, tree tensor network states (TTNS), and the multiscale entanglement renormalization ansatz (MERA). MERA are isometric by construction and, for the MPS and TTNS, the tensor network gauge freedom allows us to choose all tensors as partial isometries. The variance of the energy gradient, evaluated by taking the Haar average over the TNS tensors, has a leading system-size independent term and decreases according to a power law in the bond dimension. For a hierarchical TNS (TTNS and MERA) with branching ratio $b$, the variance of the gradient with respect to a tensor in layer $\tau$ scales as $(b\eta {)}^{\tau }$, where $\eta$ is the second largest eigenvalue of a Haar-average doubled layer-transition channel and decreases algebraically with increasing bond dimension. The absence of barren plateaus substantiates that isometric TNS are a promising route for an efficient quantum-computation-based investigation of strongly-correlated quantum matter. The observed scaling properties of the gradient amplitudes bear implications for efficient TNS initialization procedures.

arXiv comment7 pages, 5 figures; improved and extended discussion; added analysis showing that power-law decay observed in [Liu et al., arXiv:1902.02663] for MPS is a finite-size effect

References in corpus (54)

• 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
• The foundations of statistical mechanics from entanglement: Individual states vs. averages
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• A class of quantum many-body states that can be efficiently simulated
• Operator Spreading in Random Unitary Circuits
• Canonical Typicality
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Quantum Entanglement Growth Under Random Unitary Dynamics
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Classical simulation of quantum many-body systems with a tree tensor network
• Random Quantum Circuits
• The Bloch Vector for N-Level Systems
• A class of ansatz wave functions for 1D spin systems and their relation to DMRG
• Training variational quantum algorithms is NP-hard
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Bloch vectors for qudits
• Layerwise learning for quantum neural networks
• Algorithms for entanglement renormalization
• Local random quantum circuits are approximate polynomial-designs
• Emergent statistical mechanics of entanglement in random unitary circuits
• Simulation of two-dimensional quantum systems using a tree tensor network that exploits the entropic area law
• Simulating Strongly Correlated Quantum Systems with Tree Tensor Networks
• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• The power of quantum systems on a line
• Trainability of Dissipative Perceptron-Based Quantum Neural Networks
• Variational Quantum Eigensolver with Fewer Qubits
• Large gradients via correlation in random parameterized quantum circuits
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• Entanglement Devised Barren Plateau Mitigation
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates
• Expressibility of the alternating layered ansatz for quantum computation
• Holographic quantum algorithms for simulating correlated spin systems
• The Variational Power of Quantum Circuit Tensor Networks
• Barren plateaus in quantum tensor network optimization
• Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
• Riemannian optimization of isometric tensor networks
• Avoiding barren plateaus via transferability of smooth solutions in Hamiltonian Variational Ansatz
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage
• Typicality in random matrix product states
• The Presence and Absence of Barren Plateaus in Tensor-network Based Machine Learning
• Abrupt Transitions in Variational Quantum Circuit Training
• Riemannian geometry and automatic differentiation for optimization problems of quantum physics and quantum technologies
• Statistical properties of random matrix product states
• Optimizing quantum circuits with Riemannian gradient flow
• Real-space renormalization yields finite correlations
• Holographic simulation of correlated electrons on a trapped ion quantum processor
• The Complexity of Translationally-Invariant Spin Chains with Low Local Dimension
• Quantum-classical eigensolver using multiscale entanglement renormalization
• Barren plateaus from learning scramblers with local cost functions
• On the closedness and geometry of tensor network state sets

Cited by in corpus (12)

• 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?
• Quantum Magic and Multi-Partite Entanglement in the Structure of Nuclei
• Quantum Convolutional Neural Networks are Effectively Classically Simulable
• Machine learning with tree tensor networks, CP rank constraints, and tensor dropout
• Equivalence of cost concentration and gradient vanishing for quantum circuits: An elementary proof in the Riemannian formulation
• Absence of barren plateaus and scaling of gradients in the energy optimization of isometric tensor network states
• Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems
• Survey on Computational Applications of Tensor Network Simulations
• Scaling of contraction costs for entanglement renormalization algorithms including tensor Trotterization and variational Monte Carlo
• A quantum eigenvalue solver based on tensor networks