Tensor network techniques for the computation of dynamical observables in 1D quantum spin systems

Abstract

We analyze the recently developed folding algorithm [Phys. Rev. Lett. 102, 240603 (2009)] to simulate the dynamics of infinite quantum spin chains, and relate its performance to the kind of entanglement produced under the evolution of product states. We benchmark the accomplishments of this technique with respect to alternative strategies using Ising Hamiltonians with transverse and parallel fields, as well as XY models. Additionally, we evaluate its ability to find ground and thermal equilibrium states.

33 pages, 22 figures

References in corpus (16)

• Real time evolution using the density matrix renormalization group
• Matrix Product Density Operators: Simulation of finite-T and dissipative systems
• Classical simulation of infinite-size quantum lattice systems in one spatial dimension
• Classical simulation of infinite-size quantum lattice systems in two spatial dimensions
• DMRG and periodic boundary conditions: a quantum information perspective
• Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions
• Entropy scaling and simulability by Matrix Product States
• Evolution of entanglement entropy following a quantum quench: Analytic results for the XY chain in a transverse magnetic field
• Operator space entanglement entropy in transverse Ising chain
• Matrix Product States for dynamical simulation of infinite chains
• The Dynamics of 1D Quantum Spin Systems Can Be Approximated Efficiently
• Is efficiency of classical simulations of quantum dynamics related to integrability?
• Operator Space Entanglement Entropy in XY Spin Chains
• Monte Carlo simulation with Tensor Network States
• Dynamical simulation of integrable and non-integrable models in the Heisenberg picture
• Observations Outside the Light-Cone: Algorithms for Non-Equilibrium and Thermal States