arXiv:2609.35114
Accurate and bounded approximation of quantum correlation functions
Alexander van Lomwel, Florian Mintert
Abstract
The exact classical simulation of non-integrable quantum systems rapidly becomes intractable beyond small system sizes, yet its role is central to predicting many-body dynamics. Approximate methods alleviate this cost but typically lack rigorous guarantees on their deviation from the exact result. For the infinite-temperature correlation function, we derive a rigorous error bound for approximating the full dynamics within a computable finite-sized region. Applied to autocorrelations, this finite-region approach is especially accurate across one-dimensional systems and beyond, and can further provide rigorous error bounds for other approximate methods, demonstrated here for matrix-product-operator simulations.
AI Summary
The paper addresses how to certify classical approximations to infinite-temperature dynamical correlation functions without simulating the full system. It approximates $C_F(t)=2^{-n}\operatorname{tr}[A_F(t)B]$ by evolving observables inside a finite spatial window and derives an error bound requiring only window dynamics and boundary couplings. For observables supported inside the window and boundary interaction $V$ satisfying $\operatorname{tr}_{\mathrm{out}}V=0$, exact integral identities and Cauchy–Schwarz give $|C_F(t)-C_W(t)|\leq\mathcal B_C(t)$, where $\mathcal B_C(t)=\int_0^t dr\,\|[V(r),A_W(t,r)]\|\int_0^r dp\,\|[V(p),B_W(p)]\|$, using normalized Hilbert–Schmidt norms. If the individual observable errors begin at orders $t^{m_A}$ and $t^{m_B}$, both the correlation error and its bound begin no earlier than $t^{m_A+m_B}$. Autocorrelations therefore have doubled short-time error order. The bound is independent of total system size and applies in the thermodynamic limit. Tests use Ising and Heisenberg chains with windows up to 13 spins, plus honeycomb-lattice Ising windows. Comparison with exactly computable transverse-field Ising dynamics checks bound tightness. For the largest honeycomb window, the correlation bound reaches $10^{-2}$ at $gt=2.011$, versus $0.742$ for the observable-based bound. Other approximations, including MPO simulations, receive the certificate $|C_F-C_A|\leq\mathcal B_C+|C_W-C_A|$. The scope is infinite-temperature correlations. Certification remains limited to times when the finite-window bound is small; larger windows extend this interval, with less spatial reach per spin beyond one dimension. Extensions to OTOCs and full counting statistics are suggested but not established.
Error found: The MPO figure caption incorrectly claims that |C_A-C_W|<=2B_C guarantees accuracy at least as good as the window approximation, whereas it establishes only that such accuracy is possible. The uniform nearest-neighbor isotropic Heisenberg chain in Eq. (XXX) is integrable, contrary to its repeated description as non-integrable. The mixed-field Ising numerical examples omit the field strengths h_x and h_z needed to reproduce their correlation curves and reported error-bound threshold times.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.