Tensor network techniques for the computation of dynamical observables in one-dimensional quantum spin systems

Abstract

We analyze the recently developed folding algorithm (Bañuls et al 2009 Phys. Rev. Lett.102 240603) for simulating the dynamics of infinite quantum spin chains and we 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. Also, we evaluate its capability of finding ground and thermal equilibrium states.