Skip to content
Preprint

Near-Optimal Learning of Quantum Many-Body Systems from Gibbs and Thermal Metastable States via the Stationarity Test

Nov 2026 · 0 citations · 61 references
Physics Mathematics

Abstract

We study the problem of learning a finite-range quantum Hamiltonian on an $n$-qubit $D$-dimensional lattice from copies of its Gibbs states at a known inverse temperature $\beta$ or its thermal metastable states. Existing efficient algorithms at arbitrary temperature have sample guarantees with an $e^{\poly(\beta)}$ dependence, leaving open whether the exponent can be made linear in $\beta$. We achieve this improvement: for $\beta\ge1$, our algorithm learns all Hamiltonian coefficients to $\ell_\infty$-error $\epsilon$ with probability at least $1-\delta$ using $\tO\bigl(e^{O(\beta)}\epsilon^{-2}\log(n/\delta)\bigr)$ copies and total time $\tO\bigl(n e^{O(\beta)}\epsilon^{-2}\log(n/\delta)\bigr)$. The measurements act on individual copies and are supported on balls of radius $O\bigl(\beta^2+\beta\log(1/\epsilon)\bigr)$. Our sample complexity achieves the optimal exponential order in $\beta$, with optimal $\epsilon^{-2}$ dependence up to logarithmic factors. Building on the stationarity-test framework \citep{Bergamaschi2026Stationarity}, we prove a unified Fisher-information coercivity bound showing that errors in the candidate Hamiltonian produce a detectable signal with only an $e^{-O(\beta)}$ loss in sensitivity. The key is a smooth frequency filter whose bandwidth remains independent of temperature, together with sharper estimates relating this signal to the Hamiltonian coefficients. For thermal metastable states, the guarantee holds under local drift $\zeta\le e^{-C\beta^{2D+1}}$, for a geometry-dependent constant $C>0$, and above an accuracy floor $\tO(e^{O(\beta)}\zeta)$. The argument applies to both Gibbs and thermal metastable states and, combined with local measurements and projected stochastic gradient descent (SGD), yields both learning guarantees.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.