arXiv:2611.01520
Near-Optimal Learning of Quantum Many-Body Systems from Gibbs and Thermal Metastable States via the Stationarity Test
Tai Hsuan Yang
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 $β$ or its thermal metastable states. Existing efficient algorithms at arbitrary temperature have sample guarantees with an $e^{\poly(β)}$ dependence, leaving open whether the exponent can be made linear in $β$. We achieve this improvement: for $β\ge1$, our algorithm learns all Hamiltonian coefficients to $\ell_\infty$-error $ε$ with probability at least $1-δ$ using $\tO\bigl(e^{O(β)}ε^{-2}\log(n/δ)\bigr)$ copies and total time $\tO\bigl(n e^{O(β)}ε^{-2}\log(n/δ)\bigr)$. The measurements act on individual copies and are supported on balls of radius $O\bigl(β^2+β\log(1/ε)\bigr)$. Our sample complexity achieves the optimal exponential order in $β$, with optimal $ε^{-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(β)}$ 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 $ζ\le e^{-Cβ^{2D+1}}$, for a geometry-dependent constant $C>0$, and above an accuracy floor $\tO(e^{O(β)}ζ)$. 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.
AI Summary
The paper asks whether finite-range lattice Hamiltonians can be learned from thermal states with an $e^{O(\beta)}$ temperature dependence, rather than existing $e^{\mathrm{poly}(\beta)}$ guarantees. It considers $n$ qubits in fixed dimension $D$, known inverse temperature, and a known Pauli interaction dictionary with bounded range, weight, degree, and coefficients. For $\beta\ge1$, it gives an algorithm recovering every coefficient to additive error $\epsilon$, with probability $1-\delta$, using $\widetilde O(e^{O(\beta)}\epsilon^{-2}\log(n/\delta))$ copies and $\widetilde O(ne^{O(\beta)}\epsilon^{-2}\log(n/\delta))$ total runtime. Measurements use individual copies but require coherent operations within balls of radius $O(\beta^2+\beta\log(1/\epsilon))$. The bounds match the exponential order of known worst-case temperature lower bounds and the $\epsilon^{-2}$ dependence up to logarithmic factors. The method builds on stationarity testing: local observable drifts under a candidate detailed-balanced Gibbs sampler provide parameter-update directions. A smooth frequency filter with temperature-independent bandwidth yields a Fisher-information coercivity bound with sensitivity $e^{-O(\beta)}$. Local short-time sampler evolution estimates these drifts; projected stochastic updates and a spatial dependency-cone analysis avoid system-size-dependent sampling variance. No global mixing, spectral-gap, or correlation-decay assumption is required. The same guarantees extend to thermal metastable states, provided each site-summed sampler generator has trace-norm drift at most $\zeta\le e^{-C\beta^{2D+1}}$ and $\epsilon\gtrsim\widetilde O(e^{O(\beta)}\zeta)$. Stated open limitations include relaxing this restrictive metastability promise, reducing measurement radius, sharpening exponential constants, and learning unknown interaction structure.
The proof was generated with OpenAI GPT 6 Astra Ultra. Gemini 4 Argon was used to assist with writing the manuscript.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 43 pages, 1 table