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

TL;DR

This paper evaluates the folding algorithm for simulating the dynamics of infinite quantum spin chains, analyzing its performance, entanglement effects, and ability to find ground and thermal states, with benchmarking against other methods.

Contribution

It provides a detailed analysis of the folding algorithm's effectiveness in simulating quantum spin chain dynamics and compares it with alternative strategies.

Findings

Folding algorithm effectively simulates dynamics of infinite quantum spin chains.

Performance depends on entanglement generated during evolution.

Benchmarking shows competitive accuracy for ground and thermal states.

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.