$TimeEvolver$: A Program for Time Evolution With Improved Error Bound

Abstract

We present $TimeEvolver$, a program for computing time evolution in a generic quantum system. It relies on well-known Krylov subspace techniques to tackle the problem of multiplying the exponential of a large sparse matrix $iH$, where $H$ is the Hamiltonian, with an initial vector $v$. The fact that $H$ is Hermitian makes it possible to provide an easily computable bound on the accuracy of the Krylov approximation. Apart from effects of numerical roundoff, the resulting a posteriori error bound is rigorous, which represents a crucial novelty as compared to existing software packages such as $Expokit$ (R. Sidje, ACM Trans. Math. Softw. 24 (1) 1998). On a standard notebook, $TimeEvolver$ allows to compute time evolution with adjustable precision in Hilbert spaces of dimension greater than $10^6$. Additionally, we provide routines for deriving the matrix $H$ from a more abstract representation of the Hamiltonian operator.

arXiv comment18 pages, 4 figures

References in corpus (8)

• Time-evolution methods for matrix-product states
• Black Hole Metamorphosis and Stabilization by Memory Burden
• A Microscopic Model of Holography: Survival by the Burden of Memory
• Finding Critical States of Enhanced Memory Capacity in Attractive Cold Bosons
• Massively parallel implementation and approaches to simulate quantum dynamics using Krylov subspace techniques
• Computable upper error bounds for Krylov approximations to matrix exponentials and associated $\phi$-functions
• A Posteriori Error Estimates of Krylov Subspace Approximations to Matrix Functions
• Critically excited states with enhanced memory and pattern recognition capacities in quantum brain networks: Lesson from black holes

Cited by in corpus (2)

• The Timescales of Quantum Breaking
• Fast simulation for multi-photon, atomic-ensemble quantum model of linear optical systems addressing the curse of dimensionality