Learning the structure of any Hamiltonian from minimal assumptions
Andrew Zhao

TL;DR
This paper introduces efficient algorithms for learning any unknown quantum Hamiltonian from black-box time evolution queries without prior assumptions, applicable to both local and nonlocal interactions, and extends the use of pseudo-Choi states.
Contribution
The authors develop universal Hamiltonian learning algorithms that do not require prior knowledge of the Hamiltonian structure and work under limited control models.
Findings
Algorithms achieve near-Heisenberg-limited scaling.
Effective learning with polynomially bounded number of terms.
Extension of pseudo-Choi states for spectrum learning and state preparation.
Abstract
We study the problem of learning an unknown quantum many-body Hamiltonian from black-box queries to its time evolution . Prior proposals for solving this task either impose some assumptions on , such as its interaction structure or locality, or otherwise use an exponential amount of computational postprocessing. In this paper, we present algorithms to learn any -qubit Hamiltonian, which do not need to know the Hamiltonian terms in advance, nor are they restricted to local interactions. Our algorithms are efficient as long as the number of terms is polynomially bounded in the system size . We consider two models of control over the time evolution:~the first has access to time reversal (), enabling an algorithm that outputs an -accurate classical description of after querying its dynamics for a total of…
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.
