Connecting Entanglement in Time and Space: Improving the Folding Algorithm

Abstract

The "folding algorithm"\cite{fold1} is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the temporal entanglement. We show that this temporal entanglement is, in many cases, equal to the spatial entanglement of a modified Hamiltonian. This inspires a modification to the folding algorithm, that we call the "hybrid algorithm". We find that this leads to improved accuracy for the same numerical effort. We then use these algorithms to study relaxation in a transverse plus parallel field Ising model, finding persistent quasi-periodic oscillations for certain choices of initial conditions.

16 pages, 11 figures

References in corpus (12)

• The density-matrix renormalization group in the age of matrix product states
• Thermalization and its mechanism for generic isolated quantum systems
• Real time evolution using the density matrix renormalization group
• Classical simulation of infinite-size quantum lattice systems in one spatial dimension
• Lieb-Robinson bounds and the generation of correlations and topological quantum order
• Exact relaxation in a class of non-equilibrium quantum lattice systems
• Entanglement and correlation functions following a local quench: a conformal field theory approach
• Strong and weak thermalization of infinite non-integrable quantum systems
• Continuous Matrix Product States for Quantum Fields
• Matrix Product States for dynamical simulation of infinite chains
• Tensor network techniques for the computation of dynamical observables in 1D quantum spin systems
• Upper bounds on entangling rates of bipartite Hamiltonians