Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Learning an unknown bounded-degree quantum Hamiltonian from one thermal state

Matthew Liston

Published Oct 22, 2026• 0 citations
Publisher

Abstract

This preprint studies learning an unknown bounded-degree n-qubit Hamiltonian in a known Pauli basis from independent copies of a single-temperature Gibbs state. For fixed locality, interaction degree and fixed positive rational inverse temperature and coefficient bound, it gives a polynomial-resource algorithm using product single-qubit Pauli measurements, without geometry, a gap, correlation decay or a minimum nonzero coefficient. The output has rational coefficients, support inside the true support and total coefficient error at most the requested tolerance with the stated success probability. The temperature-dependent exponents are extremely large; the result is asymptotic. The refinement certificate is formalized in Lean conditionally on explicit analytic inputs. Initialization, iteration, solver, sampling and full resource bounds remain paper proofs. A companion source note preserves the separate hidden-Majorana discussion and its open calibration problem; it is not a proof of that broader learner. Research directed and curated by Matthew Liston. The mathematics, proofs, formalization and manuscript preparation substantially involve AI systems; paper-specific attribution and checking limits are disclosed in the paper and archive. No independent human proof verification, external endorsement or peer review is claimed. Licensing: original manuscript and documentation CC BY 4.0; original code MIT. The archive provides the exact file-level license mapping. Manuscript revision: 22 October 2026. Research director's note — Matthew Liston: This project is motivated by philosophical exploration and curiosity about AI-assisted research. My aim in sharing these results is to make them available for scrutiny, correction and further development, so that others can build on whatever proves useful to mathematics and science. Correspondence: atemporalwalk@gmail.com.

DOI
10.5281/zenodo.23579854

Related papers

Heisenberg-scaling sparse Hamiltonian learning with a fixed minimum query duration

Yuxuan Zhang

The manuscript gives a proposed learning algorithm for an unknown polynomially sparse Pauli Hamiltonian of operator norm at most one, using only forward evolution queries whose durations are all at least a fixed positive constant T. It obtains maximum coefficient error epsilon with constant success probability and total evolution time polynomial in the qubit number and sparsity, divided by epsilon, up to logarithmic factors. Circuit and classical processing costs are polynomial; constants may depend on T. The construction uses a two-time residual inverse and does not assume controlled access to, or the inverse of, the unknown evolution. This deposit preserves the website manuscript, version 1.0, dated 1 October 2026, by Yuxuan Zhang. It is a complete proof candidate with internal review and supporting checks; independent expert verification and exhaustive priority confirmation remain outstanding. Website and supporting material: https://yuxuanzhang1995.github.io/agentic-research/fixed-duration-hamiltonian-learning/QIQC original: https://qiqc-op.com/problem/op_30954594cf01ebb3/

•Oct 1, 2026•0 citations

Near-Optimal Learning of Quantum Many-Body Systems from Gibbs and Thermal Metastable States via the Stationarity Test

Tai Hsuan Yang

We study the problem of learning a finite-range quantum Hamiltonian on an $n$-qubit $D$-dimensional lattice from copies of its Gibbs states at a known inverse temperature $β$ or its thermal metastable states. Existing efficient algorithms at arbitrary temperature have sample guarantees with an $e^{\poly(β)}$ dependence, leaving open whether the exponent can be made linear in $β$. We achieve this improvement: for $β\ge1$, our algorithm learns all Hamiltonian coefficients to $\ell_\infty$-error $ε$ with probability at least $1-δ$ using $\tO\bigl(e^{O(β)}ε^{-2}\log(n/δ)\bigr)$ copies and total time $\tO\bigl(n e^{O(β)}ε^{-2}\log(n/δ)\bigr)$. The measurements act on individual copies and are supported on balls of radius $O\bigl(β^2+β\log(1/ε)\bigr)$. Our sample complexity achieves the optimal exponential order in $β$, with optimal $ε^{-2}$ dependence up to logarithmic factors. Building on the stationarity-test framework \citep{Bergamaschi2026Stationarity}, we prove a unified Fisher-information coercivity bound showing that errors in the candidate Hamiltonian produce a detectable signal with only an $e^{-O(β)}$ loss in sensitivity. The key is a smooth frequency filter whose bandwidth remains independent of temperature, together with sharper estimates relating this signal to the Hamiltonian coefficients. For thermal metastable states, the guarantee holds under local drift $ζ\le e^{-Cβ^{2D+1}}$, for a geometry-dependent constant $C>0$, and above an accuracy floor $\tO(e^{O(β)}ζ)$. The argument applies to both Gibbs and thermal metastable states and, combined with local measurements and projected stochastic gradient descent (SGD), yields both learning guarantees.

quant-pharXiv:2611.01520•Nov 3, 2026•0 citations

Bounded Local Readout of Source-Inclusive Quantum Records

Qingchun Zhang

A source-inclusive coherence observable is useful only when its measurement resources are admitted. This preprint constructs a bounded local reader for the conserved exchange observable of a specified finite quantum-record apparatus. A degree-three graph uses one independently prepared probe, twenty relays with arbitrary joint states, and finite-duration two-register extraction and full-SWAP interactions. The original apparatus Hamiltonian and an independently added archive-gated process remain active throughout their respective implementations. A prefix-dependent control-frame comparison, symmetry-resolved effect estimate, and explicit gain, phase and finite-slew waveform bounds yield a sufficient response separation greater than 0.005139889 for the stated fixed, fully accessible sixteen-position source and remaining response-error budgets. This is a conditional mathematical result, not measured hardware calibration, a partial-source-access theorem, or a unique diagnosis or derivation of fundamental collapse. The package contains the main manuscript, technical supplement, editable LaTeX, direct numerical reproduction sources, and accepted returned Mac evidence for 56 paper-specific supporting Lean declarations. That subset verifies selected algebra, scalar inequalities and the actual-constant numerical expression; it does not formalize the full physical/continuous-time theorem end-to-end. Separate-session AI review, numerical reproduction and returned kernel evidence are distinguished. Author-owned manuscripts, documentation and mathematical data are CC BY 4.0; newly authored numerical and Lean software is MIT. Predecessor and third-party notices remain unchanged; the reproduction package contains the licence map. No external funding; no competing interests declared. Public preprint v1.0; edition date 18 October 2026; DOI 10.5281/zenodo.23442579.

•Oct 18, 2026•0 citations

The entanglement cost of the antisymmetric state is one ebit: Sharp purity bounds for tensor products of antisymmetric pairs

Matthew Liston

This preprint proves a sharp purity bound for arbitrary complex pure states in tensor products of antisymmetric pair spaces, across the physical cut consisting of the first system from each pair versus the second system from each pair. For every finite number m of pairs and local dimensions at least two, purity is at most 2^(-m) and entanglement entropy is at least m bits, with equality characterized by products of normalized decomposable two-forms. It derives entanglement of formation m for m copies of the normalized antisymmetric state and, using the published regularization theorem, entanglement cost one ebit for every local dimension at least two. The archive provides original formal sources and a precise account of their scope; it does not claim a complete Lean translation of every ordinary LOCC execution. Research directed and curated by Matthew Liston. The mathematics, proofs, formalization and manuscript preparation substantially involve AI systems; paper-specific attribution and checking limits are disclosed in the paper and archive. No independent human proof verification, external endorsement or peer review is claimed. Licensing: original manuscript and documentation CC BY 4.0; original code MIT. The inherited QICLean SchattenNorm helper retains Apache 2.0 and its original attribution. The archive provides the exact file-level license mapping. Manuscript revision: 22 October 2026. Research director's note — Matthew Liston: This project is motivated by philosophical exploration and curiosity about AI-assisted research. My aim in sharing these results is to make them available for scrutiny, correction and further development, so that others can build on whatever proves useful to mathematics and science. Correspondence: atemporalwalk@gmail.com.

•Oct 22, 2026•0 citations

Learning Quantum Hamiltonians at Any Temperature in Polynomial Time

Ainesh Bakshi, Allen Liu, Ankur Moitra +1 more

Abstract. We study the problem of learning a local quantum Hamiltonian [Formula: see text] given copies of its Gibbs state [Formula: see text] at a known inverse temperature [Formula: see text]. Anshu et al. [2020 IEEE 61st Annual Symposium on Foundations of Computer Science, pp. 685–691] gave an algorithm to learn a Hamiltonian on [Formula: see text] qubits to precision [Formula: see text] with only polynomially many copies of the Gibbs state, but which takes exponential time. Obtaining a computationally efficient algorithm has been a major open problem [ Alhambra, PRX Quantum, 4 (2023), 040201 ; Anshu and Arunachalam, Nature Rev. Phys., 6 (2023), pp. 59–69 ], with prior work only resolving this in the limited cases of high temperature [ Haah, Kothari, and Tang, Markov field on finite graphs and lattices, 1971 ] or commuting terms [ Anshu et al., Efficient learning of commuting Hamiltonians on lattices, 2021 ]. We fully resolve this problem, giving a polynomial time algorithm for learning [Formula: see text] to precision [Formula: see text] from polynomially many copies of the Gibbs state at any constant [Formula: see text]. Our main technical contribution is a new flat polynomial approximation to the exponential function, and a translation between multivariate scalar polynomials and nested commutators. This enables us to formulate Hamiltonian learning as a polynomial system. We then show that solving a low-degree sum-of-squares relaxation of this polynomial system suffices to accurately learn the Hamiltonian.

arXiv:2310.02243•SIAM Journal on Computing•Oct 6, 2026•33 citations

Quantum verification of full-continuum Coulomb energy with unit nuclei

Myeongjin Kang

We prove uniform QMA membership for the spectral-infimum decision problem for the full spinful antisymmetric Coulomb Hamiltonian with unit nuclei, distinct rational nuclear positions, unary electron number and inverse-polynomial promise gap. Nuclear repulsion is omitted. Positions and thresholds use binary rational encoding; the result assumes neither binding nor a spectral gap, geometric separation, bounded physical diameter, a selected finite basis, a fixed spin sector or an efficiently prepared low-energy state. The proof combines quantitative localization including escaped electrons, Hardy-controlled Coulomb caps, a finite kinetic cutoff, exact shifted sampling with L2 error control, and a polynomial-size verifier on arbitrary witness states. Together with the hardness theorem of the pinned source manuscript, this gives QMA completeness for the same problem. Classical sector localization, finite-basis electronic complexity, smooth-box discretization and earlier real-space simulation estimates are credited. The accompanying Lean support proves selected finite sampling, representation-average and scalar error interfaces; it does not formalize the full continuum or quantum-complexity theorem. No extension to exponentially large binary nuclear charges or worldwide priority claim is made. AI-assisted preprint by Myeongjin Kang, with no affiliation. Internal AI review is not external journal peer review or worldwide-priority certification. Identified OpenAI source inputs at revision fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb are stipulated true. Lean verifies scoped supporting results only, not the full theorem. Original prose: CC BY 4.0; original code and Lean: MIT; third-party rights preserved. See the supporting archive for precise assumptions, coverage, provenance and corrections.

•Oct 25, 2026•0 citations
This preprint studies learning an unknown bounded-degree n-qubit Hamiltonian in a known Pauli basis from independent copies of a single-temperature Gibbs state. For fixed locality, interaction degree and fixed positive rational inverse temperature and coefficient bound, it gives a polynomial-resource algorithm using product single-qubit Pauli measurements, without geometry, a gap, correlation decay or a minimum nonzero coefficient. The output has rational coefficients, support inside the true support and total coefficient error at most the requested tolerance with the stated success probability. The temperature-dependent exponents are extremely large; the result is asymptotic. The refinement certificate is formalized in Lean conditionally on explicit analytic inputs. Initialization, iteration, solver, sampling and full resource bounds remain paper proofs. A companion source note preserves the separate hidden-Majorana discussion and its open calibration problem; it is not a proof of that broader learner. Research directed and curated by Matthew Liston. The mathematics, proofs, formalization and manuscript preparation substantially involve AI systems; paper-specific attribution and checking limits are disclosed in the paper and archive. No independent human proof verification, external endorsement or peer review is claimed. Licensing: original manuscript and documentation CC BY 4.0; original code MIT. The archive provides the exact file-level license mapping. Manuscript revision: 22 October 2026. Research director's note — Matthew Liston: This project is motivated by philosophical exploration and curiosity about AI-assisted research. My aim in sharing these results is to make them available for scrutiny, correction and further development, so that others can build on whatever proves useful to mathematics and science. Correspondence: atemporalwalk@gmail.com.
The manuscript gives a proposed learning algorithm for an unknown polynomially sparse Pauli Hamiltonian of operator norm at most one, using only forward evolution queries whose durations are all at least a fixed positive constant T. It obtains maximum coefficient error epsilon with constant success probability and total evolution time polynomial in the qubit number and sparsity, divided by epsilon, up to logarithmic factors. Circuit and classical processing costs are polynomial; constants may depend on T. The construction uses a two-time residual inverse and does not assume controlled access to, or the inverse of, the unknown evolution. This deposit preserves the website manuscript, version 1.0, dated 1 October 2026, by Yuxuan Zhang. It is a complete proof candidate with internal review and supporting checks; independent expert verification and exhaustive priority confirmation remain outstanding. Website and supporting material: https://yuxuanzhang1995.github.io/agentic-research/fixed-duration-hamiltonian-learning/QIQC original: https://qiqc-op.com/problem/op_30954594cf01ebb3/
We study the problem of learning a finite-range quantum Hamiltonian on an nnn-qubit DDD-dimensional lattice from copies of its Gibbs states at a known inverse temperature βββ or its thermal metastable states. Existing efficient algorithms at arbitrary temperature have sample guarantees with an $e^{\poly(β)}$ dependence, leaving open whether the exponent can be made linear in βββ. We achieve this improvement: for β≥1β\ge1β≥1, our algorithm learns all Hamiltonian coefficients to ℓ∞\ell_\inftyℓ∞​-error εεε with probability at least 1−δ1-δ1−δ using $\tO\bigl(e^{O(β)}ε^{-2}\log(n/δ)\bigr)$ copies and total time $\tO\bigl(n e^{O(β)}ε^{-2}\log(n/δ)\bigr)$. The measurements act on individual copies and are supported on balls of radius O(β2+βlog⁡(1/ε))O\bigl(β^2+β\log(1/ε)\bigr)O(β2+βlog(1/ε)). Our sample complexity achieves the optimal exponential order in βββ, with optimal ε−2ε^{-2}ε−2 dependence up to logarithmic factors. Building on the stationarity-test framework \citep{Bergamaschi2026Stationarity}, we prove a unified Fisher-information coercivity bound showing that errors in the candidate Hamiltonian produce a detectable signal with only an e−O(β)e^{-O(β)}e−O(β) loss in sensitivity. The key is a smooth frequency filter whose bandwidth remains independent of temperature, together with sharper estimates relating this signal to the Hamiltonian coefficients. For thermal metastable states, the guarantee holds under local drift ζ≤e−Cβ2D+1ζ\le e^{-Cβ^{2D+1}}ζ≤e−Cβ2D+1, for a geometry-dependent constant C>0C>0C>0, and above an accuracy floor $\tO(e^{O(β)}ζ)$. The argument applies to both Gibbs and thermal metastable states and, combined with local measurements and projected stochastic gradient descent (SGD), yields both learning guarantees.
A source-inclusive coherence observable is useful only when its measurement resources are admitted. This preprint constructs a bounded local reader for the conserved exchange observable of a specified finite quantum-record apparatus. A degree-three graph uses one independently prepared probe, twenty relays with arbitrary joint states, and finite-duration two-register extraction and full-SWAP interactions. The original apparatus Hamiltonian and an independently added archive-gated process remain active throughout their respective implementations. A prefix-dependent control-frame comparison, symmetry-resolved effect estimate, and explicit gain, phase and finite-slew waveform bounds yield a sufficient response separation greater than 0.005139889 for the stated fixed, fully accessible sixteen-position source and remaining response-error budgets. This is a conditional mathematical result, not measured hardware calibration, a partial-source-access theorem, or a unique diagnosis or derivation of fundamental collapse. The package contains the main manuscript, technical supplement, editable LaTeX, direct numerical reproduction sources, and accepted returned Mac evidence for 56 paper-specific supporting Lean declarations. That subset verifies selected algebra, scalar inequalities and the actual-constant numerical expression; it does not formalize the full physical/continuous-time theorem end-to-end. Separate-session AI review, numerical reproduction and returned kernel evidence are distinguished. Author-owned manuscripts, documentation and mathematical data are CC BY 4.0; newly authored numerical and Lean software is MIT. Predecessor and third-party notices remain unchanged; the reproduction package contains the licence map. No external funding; no competing interests declared. Public preprint v1.0; edition date 18 October 2026; DOI 10.5281/zenodo.23442579.
This preprint proves a sharp purity bound for arbitrary complex pure states in tensor products of antisymmetric pair spaces, across the physical cut consisting of the first system from each pair versus the second system from each pair. For every finite number m of pairs and local dimensions at least two, purity is at most 2^(-m) and entanglement entropy is at least m bits, with equality characterized by products of normalized decomposable two-forms. It derives entanglement of formation m for m copies of the normalized antisymmetric state and, using the published regularization theorem, entanglement cost one ebit for every local dimension at least two. The archive provides original formal sources and a precise account of their scope; it does not claim a complete Lean translation of every ordinary LOCC execution. Research directed and curated by Matthew Liston. The mathematics, proofs, formalization and manuscript preparation substantially involve AI systems; paper-specific attribution and checking limits are disclosed in the paper and archive. No independent human proof verification, external endorsement or peer review is claimed. Licensing: original manuscript and documentation CC BY 4.0; original code MIT. The inherited QICLean SchattenNorm helper retains Apache 2.0 and its original attribution. The archive provides the exact file-level license mapping. Manuscript revision: 22 October 2026. Research director's note — Matthew Liston: This project is motivated by philosophical exploration and curiosity about AI-assisted research. My aim in sharing these results is to make them available for scrutiny, correction and further development, so that others can build on whatever proves useful to mathematics and science. Correspondence: atemporalwalk@gmail.com.
Abstract. We study the problem of learning a local quantum Hamiltonian [Formula: see text] given copies of its Gibbs state [Formula: see text] at a known inverse temperature [Formula: see text]. Anshu et al. [2020 IEEE 61st Annual Symposium on Foundations of Computer Science, pp. 685–691] gave an algorithm to learn a Hamiltonian on [Formula: see text] qubits to precision [Formula: see text] with only polynomially many copies of the Gibbs state, but which takes exponential time. Obtaining a computationally efficient algorithm has been a major open problem [ Alhambra, PRX Quantum, 4 (2023), 040201 ; Anshu and Arunachalam, Nature Rev. Phys., 6 (2023), pp. 59–69 ], with prior work only resolving this in the limited cases of high temperature [ Haah, Kothari, and Tang, Markov field on finite graphs and lattices, 1971 ] or commuting terms [ Anshu et al., Efficient learning of commuting Hamiltonians on lattices, 2021 ]. We fully resolve this problem, giving a polynomial time algorithm for learning [Formula: see text] to precision [Formula: see text] from polynomially many copies of the Gibbs state at any constant [Formula: see text]. Our main technical contribution is a new flat polynomial approximation to the exponential function, and a translation between multivariate scalar polynomials and nested commutators. This enables us to formulate Hamiltonian learning as a polynomial system. We then show that solving a low-degree sum-of-squares relaxation of this polynomial system suffices to accurately learn the Hamiltonian.
We prove uniform QMA membership for the spectral-infimum decision problem for the full spinful antisymmetric Coulomb Hamiltonian with unit nuclei, distinct rational nuclear positions, unary electron number and inverse-polynomial promise gap. Nuclear repulsion is omitted. Positions and thresholds use binary rational encoding; the result assumes neither binding nor a spectral gap, geometric separation, bounded physical diameter, a selected finite basis, a fixed spin sector or an efficiently prepared low-energy state. The proof combines quantitative localization including escaped electrons, Hardy-controlled Coulomb caps, a finite kinetic cutoff, exact shifted sampling with L2 error control, and a polynomial-size verifier on arbitrary witness states. Together with the hardness theorem of the pinned source manuscript, this gives QMA completeness for the same problem. Classical sector localization, finite-basis electronic complexity, smooth-box discretization and earlier real-space simulation estimates are credited. The accompanying Lean support proves selected finite sampling, representation-average and scalar error interfaces; it does not formalize the full continuum or quantum-complexity theorem. No extension to exponentially large binary nuclear charges or worldwide priority claim is made. AI-assisted preprint by Myeongjin Kang, with no affiliation. Internal AI review is not external journal peer review or worldwide-priority certification. Identified OpenAI source inputs at revision fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb are stipulated true. Lean verifies scoped supporting results only, not the full theorem. Original prose: CC BY 4.0; original code and Lean: MIT; third-party rights preserved. See the supporting archive for precise assumptions, coverage, provenance and corrections.