Learning quantum Hamiltonians at any temperature in polynomial time
Ainesh Bakshi, Allen Liu, Ankur Moitra, Ewin Tang

TL;DR
This paper presents a polynomial-time algorithm for learning local quantum Hamiltonians from Gibbs states at any temperature, resolving a major open problem in quantum Hamiltonian learning.
Contribution
It introduces a novel flat polynomial approximation to the exponential function and a polynomial system formulation, enabling efficient learning at any constant inverse temperature.
Findings
Provides a polynomial time algorithm for Hamiltonian learning at any temperature
Uses a new polynomial approximation and sum-of-squares relaxation for accurate reconstruction
Achieves learning with polynomially many Gibbs state copies at constant inverse temperature
Abstract
We study the problem of learning a local quantum Hamiltonian given copies of its Gibbs state at a known inverse temperature . Anshu, Arunachalam, Kuwahara, and Soleimanifar (arXiv:2004.07266) gave an algorithm to learn a Hamiltonian on qubits to precision with only polynomially many copies of the Gibbs state, but which takes exponential time. Obtaining a computationally efficient algorithm has been a major open problem [Alhambra'22 (arXiv:2204.08349)], [Anshu, Arunachalam'22 (arXiv:2204.08349)], with prior work only resolving this in the limited cases of high temperature [Haah, Kothari, Tang'21 (arXiv:2108.04842)] or commuting terms [Anshu, Arunachalam, Kuwahara, Soleimanifar'21]. We fully resolve this problem, giving a polynomial time algorithm for learning to precision from polynomially many…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
