paper

Fast Time-Evolution of Matrix-Product States using the QR decomposition

arXiv:2212.09782 · doi:10.1103/PhysRevB.107.155133

Abstract

We propose and benchmark a modified time evolution block decimation (TEBD) algorithm that uses a truncation scheme based on the QR decomposition instead of the singular value decomposition (SVD). The modification reduces the scaling with the dimension of the physical Hilbert space from down to . Moreover, the QR decomposition has a lower computational complexity than the SVD and allows for highly efficient implementations on GPU hardware. In a benchmark simulation of a global quench in a quantum clock model, we observe a speedup of up to three orders of magnitude comparing QR and SVD based updates on an A100 GPU.

6 pages, 4 figures

References in corpus (16)

Cited by in corpus (6)