pith. sign in

arxiv: 2606.05690 · v1 · pith:J5ZIZCLPnew · submitted 2026-06-04 · 🪐 quant-ph

Learning Hamiltonians at Long Times

Constantin Cedillo Vayson de Pradenne , Jordan Cotler , Hsin-Yuan Huang This is my paper

Pith reviewed 2026-06-28 01:28 UTC · model grok-4.3

classification 🪐 quant-ph
keywords Hamiltonian learninglocal observablesconserved quantitiesclassical shadowsquantum equilibrationlong-time dynamicsmany-body Hamiltonians
0
0 comments X

The pith

For broad families of local Hamiltonians, the Hamiltonian is the unique approximately conserved local observable at long times.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that for broad families of local Hamiltonians, at a typical long evolution time t, any normalized sum of local observables orthogonal to the Hamiltonian has a commutator with the time-evolution operator whose squared Frobenius norm per dimension is at least inverse polynomial in the number of qubits. This makes the Hamiltonian the only local quantity that is approximately conserved under the dynamics. The uniqueness directly enables an efficient recovery procedure that treats H as the approximate null vector of a matrix assembled from classical shadow measurements on random product states. A corollary is a weak equilibration statement: the infinite-temperature autocorrelation functions of all local observables orthogonal to H must decay by at least an inverse-polynomial factor.

Core claim

For broad families of local Hamiltonians, with high probability over H and t, any sum of local observables A that is normalized and orthogonal to H satisfies (1/2^n) ||[U(t), A]||_F^2 >= 1/poly(n). The Hamiltonian is therefore the unique approximately conserved local observable, and we can efficiently recover H, up to scale, as the approximate null vector of a data matrix built from random product-state inputs and classical shadows. As a corollary, we obtain a weak equilibration statement: the infinite-temperature autocorrelation of every sum of local observables orthogonal to H decays by at least an inverse-polynomial amount.

What carries the argument

The large commutator norm condition ||[U(t), A]||_F that forces any local A orthogonal to H to fail approximate conservation, which in turn identifies H as the unique approximate null vector of the classical-shadow data matrix.

If this is right

  • H can be recovered efficiently up to scale from a single long-time evolution via the approximate null vector of the shadow data matrix.
  • The infinite-temperature autocorrelation of every local observable orthogonal to H decays by at least an inverse-polynomial amount.
  • No other normalized sum of local observables orthogonal to H remains approximately conserved under U(t).

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Hamiltonian learning remains possible even when the evolution time is arbitrarily large and unknown in advance.
  • The result gives a quantitative local version of ergodicity for typical local Hamiltonians by bounding how many independent conserved quantities can exist.
  • The same commutator argument could be tested numerically on small systems to check whether the inverse-polynomial bound is tight.

Load-bearing premise

The Hamiltonians belong to broad families for which the high-probability statement over random H and t holds.

What would settle it

Find a Hamiltonian H from one of the families and a time t such that some normalized local observable A orthogonal to H satisfies (1/2^n) ||[U(t), A]||_F^2 much smaller than 1/poly(n).

Figures

Figures reproduced from arXiv: 2606.05690 by Constantin Cedillo Vayson de Pradenne, Hsin-Yuan Huang, Jordan Cotler.

Figure 1
Figure 1. Figure 1: Hamiltonian learning from weak equilibration. (a) Schematic of the mech￾anism. Under long-time evolution, local observables in the search space generically lose their infinite-temperature autocorrelation, while the Hamiltonian direction is exactly conserved. Classi￾cal shadow measurements on random product-state probes produce a data matrix whose approxi￾mate null vector recovers H. (b) Weak-equilibration … view at source ↗
read the original abstract

We study the problem of learning an unknown $n$-qubit Hamiltonian $H$ from $U = e^{-iHt}$ for a single time $t$, where $t$ may be arbitrarily large. For broad families of local Hamiltonians, we prove that, with high probability over $H$ and $t$, any sum of local observables $A$ that is normalized and orthogonal to $H$ satisfies $\tfrac{1}{2^n}\|[U(t),A]\|_F^2 \geq 1/\text{poly}(n)$. The Hamiltonian is therefore the unique approximately conserved local observable, and we can efficiently recover $H$, up to scale, as the approximate null vector of a data matrix built from random product-state inputs and classical shadows. As a corollary, we obtain a weak equilibration statement: the infinite-temperature autocorrelation of every sum of local observables orthogonal to $H$ decays by at least an inverse-polynomial amount.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper studies learning an unknown n-qubit local Hamiltonian H from the time-evolution operator U = e^{-i H t} at a single, possibly large time t. It proves that for broad families of local Hamiltonians, with high probability over H and t, any normalized sum of local observables A orthogonal to H satisfies (1/2^n) ||[U(t), A]||_F^2 >= 1/poly(n). This establishes H as the unique approximately conserved local observable. The authors provide an efficient recovery algorithm for H (up to scale) using a data matrix constructed from random product-state inputs and classical shadows, and derive a corollary on weak equilibration of infinite-temperature autocorrelations for observables orthogonal to H.

Significance. If the central probabilistic statement holds for relevant physical Hamiltonians, this would be a significant contribution to Hamiltonian learning and quantum dynamics. It addresses the challenging regime of long times where perturbative methods fail, and provides both a uniqueness theorem and a practical recovery method. The explicit construction of the recovery procedure and the equilibration result are strengths. The result could impact experimental quantum simulation by enabling Hamiltonian identification without time-scale restrictions.

major comments (2)
  1. [Abstract] Abstract: The precise definition of 'broad families of local Hamiltonians' and the probability measure over H and t is not provided. This is load-bearing for the central claim, as it determines whether the high-probability uniqueness applies to generic local Hamiltonians or only to specially chosen ensembles that may exclude cases with additional conserved quantities by construction.
  2. [Main result] Main result (theorem establishing the commutator lower bound): The derivation of (1/2^n) ||[U(t),A]||_F^2 >= 1/poly(n) for normalized local A orthogonal to H relies on the unspecified family and measure; without an explicit ensemble (e.g., i.i.d. couplings on a fixed graph), it is unclear whether the uniqueness is derived or partly tautological for the chosen family.
minor comments (2)
  1. [Abstract] Abstract: The poly(n) bound on the commutator could be stated with an explicit degree (e.g., n^{-c} for concrete c) to allow assessment of the decay rate.
  2. [Recovery procedure] Recovery section: The sample complexity and dimension of the data matrix built from product states and shadows should be stated explicitly, including any dependence on n.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their constructive comments highlighting the need for greater clarity on the ensemble and probability measure. We address each major comment below and indicate the revisions we will make to the manuscript.

read point-by-point responses

  1. Referee: [Abstract] Abstract: The precise definition of 'broad families of local Hamiltonians' and the probability measure over H and t is not provided. This is load-bearing for the central claim, as it determines whether the high-probability uniqueness applies to generic local Hamiltonians or only to specially chosen ensembles that may exclude cases with additional conserved quantities by construction.

    Authors: We agree that the abstract is high-level and omits the explicit definition. The manuscript defines the families in Section 2 as local Hamiltonians with i.i.d. couplings drawn from a continuous distribution (e.g., standard Gaussian) on a fixed bounded-degree interaction graph, with t drawn uniformly from an interval of length poly(n). This measure ensures the result applies to generic instances without built-in extra conservations. We will revise the abstract to include a brief specification of the ensemble and measure. revision: yes

  2. Referee: [Main result] Main result (theorem establishing the commutator lower bound): The derivation of (1/2^n) ||[U(t),A]||_F^2 >= 1/poly(n) for normalized local A orthogonal to H relies on the unspecified family and measure; without an explicit ensemble (e.g., i.i.d. couplings on a fixed graph), it is unclear whether the uniqueness is derived or partly tautological for the chosen family.

    Authors: Theorem 1 in Section 3 explicitly states the ensemble (i.i.d. Gaussian couplings on a fixed graph) and the measure over both H and t. The lower bound is derived via concentration and anticoncentration arguments from random matrix theory, establishing that H is the unique approximately conserved local observable for almost all such instances. The result is not tautological, as the family is broad and the proof shows the absence of extra conservations with high probability. We will add a clarifying remark in the introduction and theorem statement to emphasize the explicit ensemble. revision: partial

Circularity Check

0 steps flagged

No significant circularity in the claimed derivation.

full rationale

The paper states a probabilistic theorem: for broad families of local Hamiltonians, with high probability over H and t, any normalized local A orthogonal to H has large commutator norm with U(t). This is presented as a derived statement allowing recovery of H as the approximate null vector of a data matrix from shadows. No equations or steps reduce by construction to self-definition, fitted parameters renamed as predictions, or load-bearing self-citations whose content is unverified. The result is a mathematical existence/probability claim under stated assumptions on the family, self-contained as a proof rather than tautological by input redefinition.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard properties of local operators, the Frobenius norm, and a probabilistic measure over Hamiltonians and times; no data-fitted parameters or new postulated entities are introduced in the abstract.

axioms (2)
  • domain assumption Local Hamiltonians are sums of few-body terms with standard operator algebra properties.
    Invoked to define the space of observables and the notion of locality used in the commutator bound.
  • domain assumption Existence of a probability measure over H and t such that the stated lower bound holds with high probability.
    The proof statement is conditioned on this measure; the abstract does not detail its construction.

pith-pipeline@v0.9.1-grok · 5693 in / 1443 out tokens · 39220 ms · 2026-06-28T01:28:19.366386+00:00 · methodology

discussion (0)

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

Forward citations

Cited by 1 Pith paper

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

  1. 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.

Reference graph

Works this paper leans on

50 extracted references · 5 canonical work pages · cited by 1 Pith paper · 1 internal anchor

  1. [1]

    ACM Transactions on Quantum Computing , volume=

    Learning quantum processes and Hamiltonians via the Pauli transfer matrix , author=. ACM Transactions on Quantum Computing , volume=. 2024 , publisher=

    2024

  2. [2]

    Quantum , volume=

    Hamiltonian learning via shadow tomography of pseudo-choi states , author=. Quantum , volume=. 2025 , publisher=

    2025

  3. [3]

    Physical review letters , volume=

    Hamiltonian learning and certification using quantum resources , author=. Physical review letters , volume=. 2014 , publisher=

    2014

  4. [4]

    New Journal of Physics , volume=

    Robust online Hamiltonian learning , author=. New Journal of Physics , volume=. 2012 , publisher=

    2012

  5. [5]

    Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages=

    Learning the structure of any Hamiltonian from minimal assumptions , author=. Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages=

  6. [6]

    Nature Communications , volume=

    Practical Hamiltonian learning with unitary dynamics and Gibbs states , author=. Nature Communications , volume=. 2024 , publisher=

    2024

  7. [7]

    Evans, Robin Harper, and Steven T

    Scalable bayesian hamiltonian learning , author=. arXiv preprint arXiv:1912.07636 , year=

    work page arXiv 1912

  8. [8]

    Nature Physics , volume=

    Experimental quantum Hamiltonian learning , author=. Nature Physics , volume=. 2017 , publisher=

    2017

  9. [9]

    arXiv preprint arXiv:2502.11900 , year=

    Ansatz-free Hamiltonian learning with Heisenberg-limited scaling , author=. arXiv preprint arXiv:2502.11900 , year=

    work page arXiv

  10. [10]

    Quantum , volume=

    Robust and efficient Hamiltonian learning , author=. Quantum , volume=. 2023 , publisher=

    2023

  11. [11]

    Fan R. K. Chung , title =. 1997 , isbn =

    1997

  12. [12]

    Czechoslovak Mathematical Journal , volume =

    Miroslav Fiedler , title =. Czechoslovak Mathematical Journal , volume =. 1973 , doi =

    1973

  13. [13]

    Mathematical Research Letters , volume =

    Anthony Carbery and James Wright , title =. Mathematical Research Letters , volume =. 2001 , doi =

    2001

  14. [14]

    Nature Physics , volume =

    Hsin-Yuan Huang and Richard Kueng and John Preskill , title =. Nature Physics , volume =. 2020 , doi =

    2020

  15. [15]

    Tropp , title =

    Joel A. Tropp , title =. Foundations of Computational Mathematics , volume =. 2012 , doi =

    2012

  16. [16]

    Reports on Progress in Physics , volume =

    Christian Gogolin and Jens Eisert , title =. Reports on Progress in Physics , volume =. 2016 , doi =

    2016

  17. [17]

    Lindner , title =

    Eyal Bairey and Itai Arad and Netanel H. Lindner , title =. Physical Review Letters , volume =. 2019 , doi =

    2019

  18. [18]

    Physical Review A , volume =

    Christoph Dankert and Richard Cleve and Joseph Emerson and Etera Livine , title =. Physical Review A , volume =. 2009 , doi =

    2009

  19. [19]

    Heisenberg-limited Hamiltonian learning without short-time control

    Heisenberg-limited Hamiltonian learning without short-time control , author =. arXiv preprint arXiv:2604.27838 , year =. 2604.27838 , archivePrefix =

    work page internal anchor Pith review Pith/arXiv arXiv

  20. [20]

    Mathematical Research Letters , volume =

    Carbery, Anthony and Wright, James , title =. Mathematical Research Letters , volume =. 2001 , doi =

    2001

  21. [21]

    Annals of Physics , volume =

    Pierre Pfeuty , title =. Annals of Physics , volume =. 1970 , doi =

    1970

  22. [22]

    Annals of Physics , volume =

    Alexei Kitaev , title =. Annals of Physics , volume =. 2006 , doi =

    2006

  23. [23]

    Baxter , title =

    Rodney J. Baxter , title =. 1982 , isbn =

    1982

  24. [24]

    Wellner , title =

    Adrien Saumard and Jon A. Wellner , title =. Statistics Surveys , volume =. 2014 , doi =

    2014

  25. [25]

    Horn and Charles R

    Roger A. Horn and Charles R. Johnson , title =. 2012 , doi =

    2012

  26. [26]

    Physical Review Letters , volume =

    Peter Reimann , title =. Physical Review Letters , volume =. 2008 , doi =

    2008

  27. [27]

    Short and Andreas Winter , title =

    Noah Linden and Sandu Popescu and Anthony J. Short and Andreas Winter , title =. Physical Review E , volume =. 2009 , doi =

    2009

  28. [28]

    Short , title =

    Anthony J. Short , title =. New Journal of Physics , volume =. 2011 , doi =

    2011

  29. [29]

    Cory , title =

    Nathan Wiebe and Christopher Granade and Christopher Ferrie and David G. Cory , title =. Physical Review A , volume =. 2014 , doi =

    2014

  30. [30]

    Quantum , volume =

    Xiao-Liang Qi and Daniel Ranard , title =. Quantum , volume =. 2019 , doi =

    2019

  31. [31]

    Short and Terence C

    Anthony J. Short and Terence C. Farrelly , title =. New Journal of Physics , volume =. 2012 , doi =

    2012

  32. [32]

    Short and Andreas Winter , title =

    Sandu Popescu and Anthony J. Short and Andreas Winter , title =. Nature Physics , volume =. 2006 , doi =

    2006

  33. [33]

    Nature Physics , volume =

    Jeongwan Haah and Robin Kothari and Ewin Tang , title =. Nature Physics , volume =. 2024 , doi =

    2024

  34. [34]

    Physical Review Letters , volume =

    Hsin-Yuan Huang and Yu Tong and Di Fang and Yuan Su , title =. Physical Review Letters , volume =. 2023 , doi =

    2023

  35. [35]

    2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) , pages =

    Ainesh Bakshi and Allen Liu and Ankur Moitra and Ewin Tang , title =. 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) , pages =. 2024 , doi =

    2024

  36. [36]

    Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC) , year =

    Ainesh Bakshi and Allen Liu and Ankur Moitra and Ewin Tang , title =. Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC) , year =

  37. [37]

    O'Brien and Thomas Schuster , title =

    Alicja Dutkiewicz and Thomas E. O'Brien and Thomas Schuster , title =. Quantum , volume =. 2024 , doi =

    2024

  38. [38]

    Nature Physics , volume=

    Sample-efficient learning of interacting quantum systems , author=. Nature Physics , volume=. 2021 , publisher=

    2021

  39. [39]

    Testing and Learning Structured Quantum

    Srinivasan Arunachalam and Arkopal Dutt and Francisco Escudero Guti\'. Testing and Learning Structured Quantum. Communications in Mathematical Physics , volume =. 2026 , doi =

    2026

  40. [40]

    Efficient and robust estimation of many-qubit

    Daniel Stilck Fran. Efficient and robust estimation of many-qubit. Nature Communications , volume =. 2024 , doi =

    2024

  41. [41]

    Communications in the ACM , volume =

    Sitan Chen and Jordan Cotler and Hsin-Yuan Huang and Jerry Li , title =. Communications in the ACM , volume =. 2024 , doi =

    2024

  42. [42]

    Deutsch , title =

    Joshua M. Deutsch , title =. Physical Review A , volume =. 1991 , doi =

    1991

  43. [43]

    Physical Review E , volume =

    Mark Srednicki , title =. Physical Review E , volume =. 1994 , doi =

    1994

  44. [44]

    Lieb and Derek W

    Elliott H. Lieb and Derek W. Robinson , title =. Communications in Mathematical Physics , volume =. 1972 , doi =

    1972

  45. [45]

    Nielsen and Isaac L

    Michael A. Nielsen and Isaac L. Chuang , title =. 2010 , doi =

    2010

  46. [46]

    G. W. Stewart and Ji-Guang Sun , title =. 1990 , isbn =

    1990

  47. [47]

    Learning Conservation Laws in Unknown Quantum Dynamics

    Zhan, Yongtao and Elben, Andreas and Huang, Hsin-Yuan and Tong, Yu. Learning Conservation Laws in Unknown Quantum Dynamics. PRX Quantum. 2024. doi:10.1103/PRXQuantum.5.010350. arXiv:2309.00774

    work page doi:10.1103/prxquantum.5.010350 2024

  48. [48]

    Integration with respect to the

    Beno\^. Integration with respect to the. Communications in Mathematical Physics , volume =. 2006 , doi =

    2006

  49. [49]

    Quantum probe tomography.arXiv:2510.08499, 2025

    Quantum probe tomography , author=. arXiv:2510.08499 , year=

    work page arXiv

  50. [50]

    Physical Review Letters , volume =

    Quantum Algorithms for Testing Hamiltonian Symmetry , author =. Physical Review Letters , volume =. 2022 , doi =

    2022