mlsanityData to 14 Oct 2026

Optimal Ansatz-free Hamiltonian Learning In Situ

arXiv 2606.19486 ↗First posted 17 Jun 2026quant-ph cs.IT cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Characterizing the features of a Hamiltonian that governs a quantum system serves as a fundamental subroutine of quantum device calibration, signal sensing, and error correction. Recent works have proposed protocols achieving the optimal Heisenberg-limited scaling learning ansatz-free Hamiltonians from their real-time evolutions without fully specifying interaction structures. However, these protocols rely on both deep circuits with interleaving probes and control, and extremely short time resolution, making them difficult to implement on near- and intermediate-term in situ quantum experiments. In this work, we propose a computationally efficient, control-free, and ancilla-free algorithm that uses only Pauli product state preparation and measurement, and learns an ansatz-free Hamiltonian H with ||H||≤Lambda in total evolution time of Theta(fracLambdaε2log(fracLambdaε)). The evolution time cost of our algorithm is optimal for any control-free protocols as we further prove a lower bound of Omega(fracLambdaε2log(fracLambdaε)). Technically, our method introduces a randomized-sampling framework that combines band-limited kernel-based time sampling with a displacement sieve for Hamiltonian structure learning. The characteristic probe time resolution depends only on Lambda instead of varepsilon, which makes our protocol especially appealing in the high-precision regime for sensing and calibration applications. We also show that the algorithm maintains the same asymptotic total evolution time in the presence of state-preparation-and-measurement (SPAM) noise when the Hamiltonian is local after calibration. Our results demonstrate the fundamental cost of experimentally friendly Hamiltonian learning and provide a practical route to rigorous in situ characterization of near-term quantum platforms.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 6 of its 55 references that are in the map. First posted on arXiv 17 Jun 2026.

Builds on

6 of 55 references.

References · 6

  1. 2022Scalably learning quantum many-body Hamiltonians from dynamical datacited by 8
  2. 2024Learning k-body Hamiltonians via compressed sensingcited by 8
  3. 2025Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distancescited by 5
  4. 2025Quantum Probe Tomographycited by 5
  5. 2025Hamiltonian Locality Testing via Trotterized Postselectioncited by 3
  6. 2026Certifying and learning local quantum Hamiltonianscited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.