mlsanityData to 14 Oct 2026

Learning the structure of any Hamiltonian from minimal assumptions

arXiv 2410.21635 ↗First posted 29 Oct 2024quant-ph cs.DS cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

We study the problem of learning an unknown quantum many-body Hamiltonian H from black-box queries to its time evolution e-i H t. Prior proposals for solving this task either impose some assumptions on H, 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 n-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 m is polynomially bounded in the system size n. We consider two models of control over the time evolution:~the first has access to time reversal (t < 0), enabling an algorithm that outputs an ε-accurate classical description of H after querying its dynamics for a total of widetildeO(m/ε) evolution time. The second access model is more conventional, allowing only forward-time evolutions;~our algorithm requires widetildeO(|H|3/ε4) evolution time in this setting. Central to our results is the recently introduced concept of a pseudo-Choi state of H. We extend the utility of this learning resource by showing how to use it to learn the Fourier spectrum of H, how to achieve nearly Heisenberg-limited scaling with it, and how to prepare it even under our more restricted access models.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 16 of its 92 references that are in the map. First posted on arXiv 29 Oct 2024.

Builds on

16 of 92 references.

References · 16

  1. 2020Predicting Many Properties of a Quantum System from Very Few Measurementscited by 233
  2. 2021Exponential separations between learning with and without quantum memorycited by 52
  3. 2020Sample-efficient learning of quantum many-body systemscited by 37
  4. 2022Learning to predict arbitrary quantum processescited by 35
  5. 2022Learning many-body Hamiltonians with Heisenberg-limited scalingcited by 23
  6. 2022Learning Quantum Processes and Hamiltonians via the Pauli Transfer Matrixcited by 23
  7. 2023Learning quantum Hamiltonians at any temperature in polynomial timecited by 23
  8. 2022Practical Black Box Hamiltonian Learningcited by 16
  9. 2023Learning quantum states and unitaries of bounded gate complexitycited by 15
  10. 2024Structure learning of Hamiltonians from real-time evolutioncited by 9
  11. 2021Optimal learning of quantum Hamiltonians from high-temperature Gibbs statescited by 8
  12. 2023Query-optimal estimation of unitary channels in diamond distancecited by 8
4 more
  1. 2024Learning k-body Hamiltonians via compressed sensingcited by 8
  2. 2024Hamiltonian Property Testingcited by 6
  3. 2023Learning unitaries with quantum statistical queriescited by 5
  4. 2024Simple algorithms to test and learn local Hamiltonianscited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 3.

5 papers.