2014/11/28 by M. B. Hastings, Raghu Mahajan, R. Mahajan · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Computer science #Folding (DSP implementation) #Ising model #Mathematical analysis #Mathematics #Matrix product state #Physics #Physics of Superconductivity and Magnetism #Product (mathematics) #Quantum #Quantum Computing Algorithms and Architecture #Quantum entanglement #Quantum many-body systems #Quantum mechanics #Quasiperiodic function #Spacetime #Statistical physics #cond-mat.str-el #hep-th #quant-ph
paper · pdf · doi:10.1103/physreva.91.032306
published as Phys. Rev. A 91, 032306 (2015) · 16 pages, 11 figures
arxiv created 2014/11/28 · openalex publication_date 2015/03/12 · arxiv updated 2015/03/18 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/06
The ``folding algorithm'' [M. C. Ba\~nuls, M. B. Hastings, F. Verstraete, and J. I. Cirac, Phys. Rev. Lett. 102, 240603 (2009)] 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, which 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 quasiperiodic oscillations for certain choices of initial conditions.