Two Dimensional Isometric Tensor Networks on an Infinite Strip
arXiv:2211.14337 · doi:10.1103/PhysRevB.107.245118
Abstract
The exact contraction of a generic two-dimensional (2D) tensor network state (TNS) is known to be exponentially hard, making simulation of 2D systems difficult. The recently introduced class of isometric TNS (isoTNS) represents a subset of TNS that allows for efficient simulation of such systems on finite square lattices. The isoTNS ansatz requires the identification of an "orthogonality column" of tensors, within which one-dimensional matrix product state (MPS) methods can be used for calculation of observables and optimization of tensors. Here we extend isoTNS to infinitely long strip geometries and introduce an infinite version of the Moses Move algorithm for moving the orthogonality column around the network. Using this algorithm, we iteratively transform an infinite MPS representation of a 2D quantum state into a strip isoTNS and investigate the entanglement properties of the resulting state. In addition, we demonstrate that the local observables can be evaluated efficiently. Finally, we introduce an infinite time-evolving block decimation algorithm (iTEBD\textsuperscript{2}) and use it to approximate the ground state of the 2D transverse field Ising model on lattices of infinite strip geometry.
arXiv comment21 pages, 12 figures; Version accepted for publication
References in corpus (53)
- The density-matrix renormalization group in the age of matrix product states
- Efficient classical simulation of slightly entangled quantum computations
- Efficient simulation of one-dimensional quantum many-body systems
- Classical simulation of infinite-size quantum lattice systems in one spatial dimension
- Time-dependent variational principle for quantum lattices
- Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
- Unifying time evolution and optimization with matrix product states
- Classical simulation of infinite-size quantum lattice systems in two spatial dimensions
- The ALPS project release 2.0: Open source software for strongly correlated systems
- Time-evolution methods for matrix-product states
- Accurate determination of tensor network state of quantum lattice models in two dimensions
- The iTEBD algorithm beyond unitary evolution
- Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
- Simulation of two dimensional quantum systems on an infinite lattice revisited: corner transfer matrix for tensor contraction
- Tensor Network Renormalization
- Sequential generation of entangled multi-qubit states
- Algorithms for entanglement renormalization
- The computational complexity of PEPS
- Differentiable Programming Tensor Networks
- Variational optimization with infinite projected entangled-pair states
- The iPEPS algorithm, improved: fast full update and gauge fixing
- Algorithms for finite Projected Entangled Pair States
- Gradient methods for variational optimization of projected entangled-pair states
- Tangent-space methods for uniform matrix product states
- Lecture Notes of Tensor Network Contractions
- Isometric Tensor Network States in Two Dimensions
- Faster Methods for Contracting Infinite 2D Tensor Networks
- Unifying Projected Entangled Pair States contractions
- Parallel Quantum Simulation of Large Systems on Small Quantum Computers
- Quantum phase transition in spin-3/2 systems on the hexagonal lattice - optimum ground state approach
- A Density Matrix Algorithm for 3D Classical Models
- Holographic quantum algorithms for simulating correlated spin systems
- The Variational Power of Quantum Circuit Tensor Networks
- Density matrix renormalization group on a cylinder in mixed real and momentum space
- Riemannian optimization of isometric tensor networks
- Dynamical phase transitions in the two-dimensional transverse-field Ising model
- Finding purifications with minimal entanglement
- Gradient optimization of finite projected entangled pair states
- Isometric Tensor Network representation of string-net liquids
- Contracting projected entangled pair states is average-case hard
- Fermionic Implementation of Projected Entangled Pair States Algorithm
- Sequentially generated states for the study of two dimensional systems
- Sequential generation of projected entangled-pair states
- Accurate simulation for finite projected entangled pair states in two dimensions
- Conversion of projected entangled pair states into a canonical form
- Direct sampling of projected entangled-pair states
- Efficient Simulation of Dynamics in Two-Dimensional Quantum Spin Systems with Isometric Tensor Networks
- Simulating groundstate and dynamical quantum phase transitions on a superconducting quantum computer
- Automatic differentiation of dominant eigensolver and its applications in quantum physics
- QGOpt: Riemannian optimization for quantum technologies
- Three-dimensional isometric tensor networks
- Projected Entangled Pair States: Fundamental analytical and numerical limitations
- Infinite Matrix Product States vs Infinite Projected Entangled-Pair States on the Cylinder: a comparative study