Lune

FOCS2025Top-tier venue

Learning quantum Gibbs states locally and efficiently

Chi-Fang Chen, Anurag Anshu, Quynh T. Nguyen

2025Year
13Citations

Abstract

Learning the Hamiltonian underlying a quantum many-body system in thermal equilibrium is a fundamental task in quantum learning theory and experimental sciences. To learn the Gibbs state of local Hamiltonians at any inverse temperature β, the state-of-the-art provable algorithms fall short of the optimal sample and computational complexity, in sharp contrast with the locality and simplicity in the classical cases. In this work, we present a learning algorithm that learns each local term of a n-qubit D-dimensional Hamiltonian to an additive error ϵ with sample complexity Õ e poly(β) β 2 ϵ 2 log(n). The protocol uses parallelizable local quantum measurements that act within bounded regions of the lattice and near-linear-time classical post-processing. Thus, our complexity is near optimal with respect to n, ϵ and is polynomially tight with respect to β. We also give a learning algorithm for Hamiltonians with bounded interaction degree with sample and time complexities of similar scaling on n but worse on β, ϵ. At the heart of our algorithm is the interplay between locality, the Kubo-Martin-Schwinger condition, and the operator Fourier transform at arbitrary temperatures.

A. The protocol and key ideas B. Prior work C. Discussion and open problems Roadmap II. Preliminaries Notations A. Gibbs state and KMS inner product B. Hamiltonians on bounded degree interaction graph and on lattices C. Operator Fourier tranforms D. Regularizing the operator Fourier transform at low-temperatures III. The identifiability equation A. Double Bohr frequency decomposition B. Relaxing a local commutator C. Regularizing high-frequency parts D. Local commutators are faithful IV. The learning protocol A. Robustness of the identifiability observable Q B. Identifiability of test Hamiltonian: existence and uniqueness C. Measuring the identifiability observables D. A simple local learning algorithm for Hamiltonians with any connectivity E. An efficient high-precision learning algorithm for D-dimensional lattices

Ask about this paper

Your agent reads all of it.

Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.

Questions to start from

Your agent calls

Luneget_paper_fulltext

Ask in Lune

Free to start. No credit card required.

Builds on3

Related papers

Dusk over the sea between two cliffs drawn in fine vertical lines