Pith. sign in

REVIEW 11 cited by

Optimal short-time measurements for Hamiltonian learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2108.08824 v2 pith:5LFCX4EZ submitted 2021-08-19 quant-ph cond-mat.quant-gascond-mat.str-el

Optimal short-time measurements for Hamiltonian learning

classification quant-ph cond-mat.quant-gascond-mat.str-el
keywords hamiltonianlearningmeasurementsoptimalreconstructionrequiresaccuracydynamics
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Characterizing noisy quantum devices requires methods for learning the underlying quantum Hamiltonian which governs their dynamics. Often, such methods compare measurements to simulations of candidate Hamiltonians, a task which requires exponential computational complexity. Here, we propose efficient measurement schemes based on short-time dynamics which circumvent this exponential difficulty. We provide estimates for the optimal measurement schedule and reconstruction error, and verify these estimates numerically. We demonstrate that the reconstruction requires a system-size independent number of experimental shots, and identify a minimal set of state preparations and measurements which yields optimal accuracy for learning short-ranged Hamiltonians. Finally, we show how grouping of commuting observables and use of Hamiltonian symmetries improve the accuracy of the Hamiltonian reconstruction.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 11 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Characterizing Arbitrary Lindbladian Dynamics with a Few Pauli Measurements

    quant-ph 2026-07 conditional novelty 8.0

    A control-free protocol using only product-Pauli preparations and measurements reconstructs arbitrary sparse Lindbladian generators, identifying supports from data with O~(Γ²M0²/ε⁴) samples and O~(ΓM0²/ε²) total evolu...

  2. Robust Structure Learning of $k$-local Lindbladians

    quant-ph 2026-06 unverdicted novelty 8.0

    Protocol learns k-local Lindbladians to ε accuracy with Õ(n^{2k}/ε²) samples and projects to valid generators; improves to log n under sparsity assumptions.

  3. Near-Optimal Learning of Local Lindbladians

    quant-ph 2026-06 unverdicted novelty 8.0

    Near-optimal algorithm learns local Lindbladians via finite-time probes and classical shadows with Õ(Λ²/ε²) channel uses and matching lower bounds showing dissipative terms block Heisenberg-limited scaling.

  4. Efficient and SPAM-Robust Ansatz-Free Lindbladian Learning

    quant-ph 2026-06 unverdicted novelty 8.0

    An ansatz-free Lindbladian learning algorithm via Bell sampling with a SPAM-robust extension for gauge-independent parts of sparse Lindbladians under constant noise.

  5. Heisenberg-limited Hamiltonian learning without short-time control

    quant-ph 2026-04 unverdicted novelty 8.0

    Heisenberg-limited Hamiltonian learning is achievable with any constant minimum evolution time T per query, attaining optimal 1/ε total-time scaling for logarithmically sparse Hamiltonians.

  6. Lower Bounds for Learning Hamiltonians from Time Evolution

    quant-ph 2025-09 unverdicted novelty 8.0

    Establishes n^{Ω(k)} lower bounds for learning k-local Hamiltonians from time evolution, including single-coefficient and effective Hamiltonian learning, via a new connection to Boolean function analysis.

  7. Learning Arbitrary Lindbladians from Time Evolution

    quant-ph 2026-07 accept novelty 7.0

    Arbitrary Lindbladians of strength ≤Λ are learned entrywise to error ε with Õ(Λ²/ε²) ancilla-free, control-free experiments and Õ(Λ/ε²) total evolution time.

  8. Near-Optimal Learning of Local Lindbladians

    quant-ph 2026-06 accept novelty 7.0

    Local Lindbladians can be learned with Õ(Λ²/ε²) channel uses and Õ(Λ/ε²) total time; matching lower bounds prove this optimal even for adaptive, entangling strategies.

  9. Provable learning separation for predicting time-evolution of quantum many-body systems

    quant-ph 2026-07 accept novelty 6.0

    A provable exponential quantum-classical learning separation is established for predicting expectation values of time-evolved quantum states under unknown low-intersection Hamiltonians, assuming BQP ⊄ P/poly.

  10. Learning the structure of open quantum systems

    quant-ph 2026-06 unverdicted novelty 6.0

    An iterative Fourier-based algorithm learns constant-local Lindbladian coefficients from non-adaptive Pauli measurements with near-optimal sample complexity and without prior knowledge of the interaction graph.

  11. Pairwise Liouvillian learning from randomized measurements: practical aspects and guidelines for operating the protocol in large-scale experiments

    quant-ph 2026-05 unverdicted novelty 4.0

    A complete workflow for pairwise extraction of Liouvillian coefficients from randomized measurements is described for two-body long-range interactions with single-body noise, including parameter guidelines to minimize...