Learning k-body Hamiltonians via compressed sensing
Not on the map. Why?
Abstract (arXiv)
We study the problem of learning a k-body Hamiltonian with M unknown Pauli terms that are not necessarily geometrically local. We propose a protocol that learns the Hamiltonian to precision ε with total evolution time O(M1/2+1/p/ε) up to logarithmic factors, where the error is quantified by the ℓp-distance between Pauli coefficients. Our learning protocol uses only single-qubit control operations and a GHZ state initial state, is non-adaptive, is robust against SPAM errors, and performs well even if M and k are not precisely known in advance or if the Hamiltonian is not exactly M-sparse. Methods from the classical theory of compressed sensing are used for efficiently identifying the M terms in the Hamiltonian from among all possible k-body Pauli operators. We also provide a lower bound on the total evolution time needed in this learning task, and we discuss the operational interpretations of the ℓ1 and ℓ2 error metrics. In contrast to most previous works, our learning protocol requires neither geometric locality nor any other relaxed locality conditions.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 16 of its 101 references that are in the map. First posted on arXiv 24 Oct 2024.
Builds on
16 of 101 references.
References · 16
- 2020Predicting Many Properties of a Quantum System from Very Few Measurementscited by 233
- 2021Quantum advantage in learning from experimentscited by 188
- 2021Exponential separations between learning with and without quantum memorycited by 52
- 2020Sample-efficient learning of quantum many-body systemscited by 37
- 2022Learning many-body Hamiltonians with Heisenberg-limited scalingcited by 23
- 2022Learning Quantum Processes and Hamiltonians via the Pauli Transfer Matrixcited by 23
- 2023Learning quantum Hamiltonians at any temperature in polynomial timecited by 23
- 2022Practical Black Box Hamiltonian Learningcited by 16
- 2022Foundations for learning from noisy quantum experimentscited by 12
- 2013A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domaincited by 9
- 2024Structure learning of Hamiltonians from real-time evolutioncited by 9
- 2019Time-dependent Hamiltonian simulation with L1-norm scalingcited by 7
4 more
- 2015SPRIGHT: A Fast and Robust Framework for Sparse Walsh-Hadamard Transformcited by 6
- 2024Hamiltonian Property Testingcited by 6
- 2020Nearly tight Trotterization of interacting electronscited by 2
- 2021Provably accurate simulation of gauge theories and bosonic systemscited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 5.
8 papers.
- 2024Learning the structure of any Hamiltonian from minimal assumptionscited by 5
- 2025Ansatz-free Hamiltonian learning with Heisenberg-limited scalingcited by 4
- 2026Optimal Ansatz-free Hamiltonian Learning In Situcited by 3
- 2025Optimal certification of constant-local Hamiltonianscited by 1
- 2026Provable learning separation for predicting time-evolution of quantum many-body systemscited by 1
- 2026Characterizing Arbitrary Lindbladian Dynamics with a Few Pauli Measurementscited by 1
- 2026Hamiltonian locality testing and certification do not achieve the Heisenberg limitcited by 0
- 2026Out-of-control Hamiltonian Learningcited by 0
- 2026Out-of-control Hamiltonian Learning5 Oct 2026
- 2026Hamiltonian locality testing and certification do not achieve the Heisenberg limit2 Oct 2026
- 2026Characterizing Arbitrary Lindbladian Dynamics with a Few Pauli Measurements25 Jul 2026
- 2026Provable learning separation for predicting time-evolution of quantum many-body systems7 Jul 2026
- 2026Optimal Ansatz-free Hamiltonian Learning In Situ17 Jun 2026
- 2025Optimal certification of constant-local Hamiltonians10 Dec 2025
- 2025Ansatz-free Hamiltonian learning with Heisenberg-limited scaling17 Feb 2025
- 2024Learning the structure of any Hamiltonian from minimal assumptions29 Oct 2024