Fast convergence of imaginary time evolution tensor network algorithms by recycling the environment

Abstract

We propose an environment recycling scheme to speed up a class of tensor network algorithms that produce an approximation to the ground state of a local Hamiltonian by simulating an evolution in imaginary time. Specifically, we consider the time-evolving block decimation (TEBD) algorithm applied to infinite systems in 1D and 2D, where the ground state is encoded, respectively, in a matrix product state (MPS) and in a projected entangled-pair state (PEPS). An important ingredient of the TEBD algorithm (and a main computational bottleneck, especially with PEPS in 2D) is the computation of the so-called environment, which is used to determine how to optimally truncate the bond indices of the tensor network so that their dimension is kept constant. In current algorithms, the environment is computed at each step of the imaginary time evolution, to account for the changes that the time evolution introduces in the many-body state represented by the tensor network. Our key insight is that close to convergence, most of the changes in the environment are due to a change in the choice of gauge in the bond indices of the tensor network, and not in the many-body state. Indeed, a consistent choice of gauge in the bond indices confirms that the environment is essentially the same over many time steps and can thus be re-used, leading to very substantial computational savings. We demonstrate the resulting approach in 1D and 2D by computing the ground state of the quantum Ising model in a transverse magnetic field.

17 pages, 28 figures

References in corpus (17)

• The density-matrix renormalization group in the age of matrix product states
• Real time evolution using the density matrix renormalization group
• Classical simulation of infinite-size quantum lattice systems in one spatial dimension
• Classical simulation of infinite-size quantum lattice systems in two spatial dimensions
• Tensor renormalization group approach to 2D classical lattice models
• DMRG and periodic boundary conditions: a quantum information perspective
• Criticality, the area law, and the computational power of PEPS
• Accurate determination of tensor network state of quantum lattice models in two dimensions
• The iTEBD algorithm beyond unitary evolution
• From density-matrix renormalization group to matrix product states
• Valence Bond Solids for Quantum Computation
• Algorithms for finite Projected Entangled Pair States
• Applying matrix product operators to model systems with long-range interactions
• Variational quantum Monte Carlo simulations with tensor-network states
• Simulation of fermionic lattice models in two dimensions with Projected Entangled-Pair States: Next-nearest neighbor Hamiltonians
• Efficient simulation of infinite tree tensor network states on the Bethe lattice
• Fate of the cluster state on the square lattice in a magnetic field

Cited by in corpus (2)

• Variational tensor network renormalization in imaginary time: benchmark results in the Hubbard model at finite temperature
• Projected Entangled Pair States at Finite Temperature: Iterative Self-Consistent Bond Renormalization for Exact Imaginary Time Evolution