Structure learning of Hamiltonians from real-time evolution
Not on the map. Why?
Abstract (arXiv)
We study the problem of Hamiltonian structure learning from real-time evolution: given the ability to apply e-i Ht for an unknown local Hamiltonian H = suma = 1m λa Ea on n qubits, the goal is to recover H. This problem is already well-understood under the assumption that the interaction terms, Ea, are given, and only the interaction strengths, λa, are unknown. But how efficiently can we learn a local Hamiltonian without prior knowledge of its interaction structure? We present a new, general approach to Hamiltonian learning that not only solves the challenging structure learning variant, but also resolves other open questions in the area, all while achieving the gold standard of Heisenberg-limited scaling. In particular, our algorithm recovers the Hamiltonian to varepsilon error with total evolution time O(log (n)/varepsilon), and has the following appealing properties: (1) it does not need to know the Hamiltonian terms; (2) it works beyond the short-range setting, extending to any Hamiltonian H where the sum of terms interacting with a qubit has bounded norm; (3) it evolves according to H in constant time t increments, thus achieving constant time resolution. As an application, we can also learn Hamiltonians exhibiting power-law decay up to accuracy varepsilon with total evolution time beating the standard limit of 1/varepsilon2.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 16 of its 38 references that are in the map. First posted on arXiv 30 Apr 2024.
Builds on
16 of 38 references.
References · 16
- 2020Predicting Many Properties of a Quantum System from Very Few Measurementscited by 229
- 2016Gradient Descent Learns Linear Dynamical Systemscited by 78
- 2019Learning Linear Dynamical Systems with Semi-Parametric Least Squarescited by 58
- 2014Efficiently learning Ising models on arbitrary graphscited by 50
- 2016Interaction Screening: Efficient and Sample-Optimal Learning of Ising Modelscited by 43
- 2020Sample-efficient learning of quantum many-body systemscited by 36
- 2023A New Approach to Learning Linear Dynamical Systemscited by 23
- 2022Learning Quantum Processes and Hamiltonians via the Pauli Transfer Matrixcited by 22
- 2017Information Theoretic Properties of Markov Random Fields, and their Algorithmic Applicationscited by 21
- 2023Learning quantum Hamiltonians at any temperature in polynomial timecited by 20
- 2020Learning models of quantum systems from experimentscited by 16
- 2023A Unified Approach to Learning Ising Models: Beyond Independence and Bounded Widthcited by 13
4 more
- 2023Tensor Decompositions Meet Control Theory: Learning General Mixtures of Linear Dynamical Systemscited by 10
- 2021Optimal learning of quantum Hamiltonians from high-temperature Gibbs statescited by 8
- 2024High-Temperature Gibbs States are Unentangled and Efficiently Preparablecited by 6
- 2021Quantum Model Learning Agent: characterisation of quantum systems through machine learningcited by 3
Built on by
Citing papers per year: 2024: 5; 2025: 2; 2026: 1.
8 papers.
- 2024Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamicscited by 8
- 2024Learning k-body Hamiltonians via compressed sensingcited by 4
- 2024Learning the structure of any Hamiltonian from minimal assumptionscited by 4
- 2025Ansatz-free Hamiltonian learning with Heisenberg-limited scalingcited by 3
- 2024Efficient Hamiltonian, structure and trace distance learning of Gaussian statescited by 2
- 2024Score-matching-based Structure Learning for Temporal Data on Networkscited by 1
- 2025Optimal certification of constant-local Hamiltonianscited by 0
- 2026Characterizing Arbitrary Lindbladian Dynamics with a Few Pauli Measurementscited by 0
- 2026Characterizing Arbitrary Lindbladian Dynamics with a Few Pauli Measurements25 Jul 2026
- 2025Optimal certification of constant-local Hamiltonians10 Dec 2025
- 2025Ansatz-free Hamiltonian learning with Heisenberg-limited scaling17 Feb 2025
- 2024Score-matching-based Structure Learning for Temporal Data on Networks10 Dec 2024
- 2024Efficient Hamiltonian, structure and trace distance learning of Gaussian states5 Nov 2024
- 2024Learning the structure of any Hamiltonian from minimal assumptions29 Oct 2024
- 2024Learning k-body Hamiltonians via compressed sensing24 Oct 2024
- 2024Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics9 Sep 2024