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

arXiv:2609.27181

Emergent Prethermal Symmetries for Scalable Hamiltonian Learning

Myeongjin Shin, Junseo Lee, Iman Marvian, Yu Tong

quant-phmath-phSubmitted Sep 23, 2026• Announced Sep 24, 2026• 2 citations
arXivHTMLPDF

Abstract

Learning an interacting many-body Hamiltonian at the Heisenberg limit generally requires control that preserves local information for evolution times of order $1/\varepsilon$ to attain $\varepsilon$ precision. To achieve this, existing protocols often rely on trusted many-qubit operations or increasingly rapid control pulses, creating a precision barrier when gates involve unknown multi-qubit interaction or have finite duration. We show that neither resource is necessary for geometrically local Hamiltonians. Our protocol applies only static single-qubit fields, whose strength is independent of system size and grows polylogarithmically with $1/\varepsilon$. These fields generate emergent prethermal symmetries that suppress thermalization for the entire learning experiment while retaining informative symmetry-preserving dynamics. On a $d$-dimensional lattice of $n$ qubits, this enables learning every coefficient to accuracy $\varepsilon$, with failure probability at most $δ$, using total evolution time $\mathcal{O}(\log^d(1/\varepsilon)\log^2(n/δ)/\varepsilon).$ Thus, our learning protocol attains the information-theoretically optimal \(1/\varepsilon\) dependence up to polylogarithmic factors using product-state preparation, single-qubit measurements, and non-adaptive experiments. More broadly, our results establish emergent prethermal symmetries as a resource for quantum learning, opening a route to Heisenberg-limited characterization of many-body systems where fast or trusted many-qubit control is unavailable.

AI Summary

Can many-body Hamiltonians be learned at Heisenberg-limited precision without trusted entangling gates or increasingly rapid pulses? This paper gives a protocol using static single-qubit fields, product-state preparation, single-qubit measurements, and non-adaptive experiments. It considers $H=\sum_a\lambda_aP_a$ on an $n$-qubit, $d$-dimensional lattice, with fixed interaction weight and range, known Pauli terms, and $\|\lambda\|_\infty\le1$. The protocol estimates every coefficient to additive error $\varepsilon$, jointly with probability at least $1-\delta$, using total evolution time $O(\log^d(1/\varepsilon)\log^2(n/\delta)/\varepsilon)$ and $O(\log^{d+2}(1/\varepsilon)\log^2(n/\delta))$ global experiments. Sufficient field strength is $O(\max\{\log^d(1/\varepsilon),\log(1/\varepsilon)[1+\log\log(1/\varepsilon)]^3\})$, independent of $n$. Classical post-processing is polynomial in $n$, $1/\varepsilon$, and $\log(1/\delta)$. Random signed Pauli fields, weakened at selected defect sites, induce approximate prethermal charge conservation. Defect Ramsey signals encode effective local transition energies, extracted by robust frequency estimation. Analytic continuation of the ADHH prethermal recursion and connected-cluster Taylor expansions bound spatial truncation errors and derivatives of the energy map. These establish stable coefficient recovery by a contractive, preconditioned fitting algorithm. Defects separated by $O(\log(1/\varepsilon))$ can be probed simultaneously; lattice coloring supplies the parallelization overhead. The guarantees require geometrically local qubit interactions and accurately known, spatially programmable fields. Finite available field strength still imposes a precision limit. The stated SPAM robustness covers bounded measurement-probability deviations below a constant threshold; extensions to other particle types or control settings remain proposed directions.

Little sign of AI-generated textAI use disclosed
Generative artificial intelligence tools (ChatGPT~5 and 6) assisted the authors in deriving and refining some of the proofs and in drafting and revising portions of the manuscript.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Learning Hamiltonians in the Heisenberg limit with static single-qubit fields

Shrigyan Brahmachari, Shuchen Zhu, Iman Marvian +1 more

Learning the Hamiltonian governing a quantum system is a central task in quantum metrology, sensing, and device characterization. Existing Heisenberg-limited Hamiltonian learning protocols either require multi-qubit operations that are prone to noise, or single-qubit operations whose frequency or strength increases with the desired precision. These two requirements limit the applicability of Hamiltonian learning on near-term quantum platforms. We present a protocol that learns a quantum Hamiltonian with the optimal Heisenberg-limited scaling using only single-qubit control in the form of static fields with strengths that are independent of the target precision. Our protocol is robust against the state preparation and measurement (SPAM) error. By overcoming these limitations, our protocol provides new tools for device characterization and quantum sensing. We demonstrate that our method achieves the Heisenberg-limited scaling through rigorous mathematical proof and numerical experiments. We also prove an information-theoretic lower bound showing that a non-vanishing static field strength is necessary for achieving the Heisenberg limit unless one employs an extensive number of discrete control operations.

quant-pharXiv:2601.10380•Jan 16, 2026•11 citations

Heisenberg-limited Hamiltonian learning without short-time control

Myeongjin Shin, Junseo Lee, Changhun Oh

Characterizing quantum systems by learning their underlying Hamiltonians is a central task in quantum information science. While recent algorithmic advances have achieved near-optimal efficiency in this task, they critically rely on accessing arbitrarily short-time dynamics. This reliance poses severe experimental challenges due to finite control bandwidth and transient pulse errors. In this work, we demonstrate that Heisenberg-limited Hamiltonian learning can be achieved without short-time control. We introduce a framework in which every query to the unknown dynamics has duration at least a prescribed minimum time $T$, and show that this restriction does not preclude Heisenberg-limited scaling. The key ingredient is a method for emulating the continuous quantum control required by iterative learning algorithms using only such lower-bounded evolution times. This reduces the learning task to sparse pure-state tomography. Notably, for logarithmically sparse Hamiltonians, our algorithm achieves the information-theoretically optimal $1/\varepsilon$ scaling in total evolution time for any arbitrary constant minimum evolution time $T$. For many-body (polynomially sparse) systems, we uncover a rigorous quantitative tradeoff, showing that the minimum required evolution time can be significantly relaxed from the standard limit at a polynomial cost in total evolution time. Our results affirmatively resolve a prominent open problem in the field and reveal that high-bandwidth, ultra-short pulses are not fundamentally necessary for optimal quantum learning.

quant-pharXiv:2604.27838•PRX Quantum•May 1, 2026•12 citations

Learning Many-Body Hamiltonians Using a Local Probe

Suying Liu, Zitai Xu, Alexey V. Gorshkov +3 more

Hamiltonian learning provides a systematic framework for reconstructing unknown quantum dynamics. However, existing protocols typically assume direct measurement access to the entire system. With fast single-qubit control and a connected reference backbone, we show that a single measurable qubit suffices to learn all $O(N)$ independent parameters of a bounded-degree two-body Hamiltonian on $N$ qubits at the Heisenberg limit. Crucially, our protocol uses robust SWAP gates synthesized by quantum signal processing, enabling coherent transfer of states evolving under distant Hamiltonian parameters to the measurable qubit. This transfer requires no prior calibration of the Hamiltonian parameters of the intermediate links. A parallel learning architecture achieves total query time $\widetilde{O}(N)$ for an $N$-qubit chain, while retaining Heisenberg-limited precision scaling. On the chain, these scalings match the fundamental precision and information-propagation lower bounds up to logarithmic factors. The framework further extends to arbitrary bounded-degree interaction graphs. Our results establish a scalable route to learning an extensive number of many-body Hamiltonian parameters through only a local measurement interface.

quant-pharXiv:2610.02157•Oct 2, 2026•1 citation

Hamiltonian Learning and Certification via Eigenphase Engineering

Myeongjin Shin, Yu Tong

We study Hamiltonian learning for $k$-local Hamiltonians at large step size, using only forward time evolution at integer multiples of a fixed time interval. For this task, our new technique, which we call eigenphase engineering, achieves Heisenberg-limited learning with a step size that is optimal up to logarithmic factors. For an unknown $s$-sparse Hamiltonian with fixed locality $k$ and $\|H\|_{\mathrm{op}}\leqΛ$, our algorithm recovers its Pauli coefficients to $\ell_2$ error $\varepsilon$ in total evolution time $\widetilde{O}(s/\varepsilon)$, matching the best known scaling while allowing a near-maximal step size $\widetildeΘ(1/Λ)$. As an independent contribution, we strengthen the evolution-time lower bound to $Ω_k(s^{1-1/(2k)}/\varepsilon)$, placing our algorithm within a factor $\widetilde{O}(s^{1/(2k)})$ of being optimal. Eigenphase engineering departs from approaches based on dynamical approximation or iteratively canceling the unknown Hamiltonian. It encodes energy expectation differences in the perturbative response of eigenphases of the actual controlled evolution, then extracts them through phase estimation and high-order extrapolation. This avoids the need for polynomially shorter evolution steps as the target precision improves. A version using only single-qubit operations retains the same step size with a $\sqrt n$ overhead in $\ell_2$ learning time for $n$ qubits. The method also enables tolerant Hamiltonian certification and estimation of a specified Pauli coefficient, the latter without locality or sparsity assumptions. These results establish eigenphase engineering as a versatile approach to extracting Hamiltonian information with infrequent control.

quant-pharXiv:2609.26596•Sep 23, 2026•3 citations

Learning Arbitrary Lindbladians from Time Evolution

Zhili Chen, Zhan Yu

We study the problem of learning arbitrary $n$-qubit Lindbladians, the generators of Markovian open-system dynamics, from their time evolution. We give the first known efficient algorithm that learns arbitrary Lindbladians without any structural assumptions. For an $n$-qubit Lindbladian of dynamical strength at most $Λ$, the algorithm estimates every coefficient to error $\varepsilon$ using $\widetilde O(Λ^2/\varepsilon^2)$ experiments and $\widetilde O(Λ/\varepsilon^2)$ total evolution time, with classical running time polynomial in $n$ and $Λ/\varepsilon$. Both experimental costs match known lower bounds up to polylogarithmic factors. The algorithm identifies candidate labels through product Pauli experiments and estimates their coefficients using random stabilizer preparations and Clifford measurements. It requires no ancillas or control during the unknown evolution. For constant $k$, our algorithm learns generic $k$-local Lindbladians of local dynamical strength at most $Λ_{\mathrm{loc}}$ using $\widetilde O(n^2Λ_{\mathrm{loc}}^2/\varepsilon^2)$ experiments and $\widetilde O(nΛ_{\mathrm{loc}}/\varepsilon^2)$ total evolution time, improving the upper bounds of prior works in terms of the dependence on $n$. We further improve the lower bounds of Arad, Chen, Guo, Rebentrost, and Yu (SODA 2027) using a family of $3$-local Lindbladians. They already hold when the support is known, and only one Hamiltonian coefficient is requested, even for adaptive protocols with arbitrary ancillas and quantum memory. These lower bounds establish that our algorithm is optimal up to polylogarithmic factors in both experiment count and total evolution time for every fixed $k \geq 3$.

quant-pharXiv:2607.28610•Jul 31, 2026•5 citations

Ansatz-Free Hamiltonian Learning with Heisenberg-Limited Scaling

Hong-Ye Hu, Muzhou Ma, Weiyuan Gong +4 more

Learning the unknown interactions that govern a quantum system is crucial for quantum information processing, device benchmarking, and quantum sensing. The problem, known as Hamiltonian learning, is well understood under the assumption that interactions are local, but this assumption may not hold for arbitrary Hamiltonians. Previous methods all require high-order inverse polynomial dependency with precision, unable to surpass the standard quantum limit and reach the gold-standard Heisenberg-limited scaling. Whether Heisenberg-limited Hamiltonian learning is possible without prior assumptions about the interaction structures, a challenge we term , remains an open question. In this work, we present a quantum algorithm to learn arbitrary sparse Hamiltonians without any structure constraints using only black-box queries of the system’s real-time evolution and minimal digital controls to attain Heisenberg-limited scaling in estimation error. Our method is also resilient to state-preparation-and-measurement errors, enhancing its practical feasibility. We numerically demonstrate our ansatz-free protocol for learning physical Hamiltonians and validating analog quantum simulations, benchmarking our performance against the state-of-the-art Heisenberg-limited learning approach. Moreover, we establish a fundamental trade-off between total evolution time and quantum control on learning arbitrary interactions, revealing the intrinsic interplay between controllability and total evolution-time complexity for any learning algorithm. These results pave the way for further exploration into Heisenberg-limited Hamiltonian learning in complex quantum systems under minimal assumptions, potentially enabling new benchmarking and verification protocols.

arXiv:2502.11900•PRX Quantum•Aug 1, 2025•44 citations
Learning an interacting many-body Hamiltonian at the Heisenberg limit generally requires control that preserves local information for evolution times of order 1/ε1/\varepsilon1/ε to attain ε\varepsilonε precision. To achieve this, existing protocols often rely on trusted many-qubit operations or increasingly rapid control pulses, creating a precision barrier when gates involve unknown multi-qubit interaction or have finite duration. We show that neither resource is necessary for geometrically local Hamiltonians. Our protocol applies only static single-qubit fields, whose strength is independent of system size and grows polylogarithmically with 1/ε1/\varepsilon1/ε. These fields generate emergent prethermal symmetries that suppress thermalization for the entire learning experiment while retaining informative symmetry-preserving dynamics. On a ddd-dimensional lattice of nnn qubits, this enables learning every coefficient to accuracy ε\varepsilonε, with failure probability at most δδδ, using total evolution time O(log⁡d(1/ε)log⁡2(n/δ)/ε).\mathcal{O}(\log^d(1/\varepsilon)\log^2(n/δ)/\varepsilon).O(logd(1/ε)log2(n/δ)/ε). Thus, our learning protocol attains the information-theoretically optimal (1/\varepsilon) dependence up to polylogarithmic factors using product-state preparation, single-qubit measurements, and non-adaptive experiments. More broadly, our results establish emergent prethermal symmetries as a resource for quantum learning, opening a route to Heisenberg-limited characterization of many-body systems where fast or trusted many-qubit control is unavailable.
Can many-body Hamiltonians be learned at Heisenberg-limited precision without trusted entangling gates or increasingly rapid pulses? This paper gives a protocol using static single-qubit fields, product-state preparation, single-qubit measurements, and non-adaptive experiments. It considers H=∑aλaPaH=\sum_a\lambda_aP_aH=∑a​λa​Pa​ on an nnn-qubit, ddd-dimensional lattice, with fixed interaction weight and range, known Pauli terms, and ∥λ∥∞≤1\|\lambda\|_\infty\le1∥λ∥∞​≤1.
The protocol estimates every coefficient to additive error ε\varepsilonε, jointly with probability at least 1−δ1-\delta1−δ, using total evolution time O(log⁡d(1/ε)log⁡2(n/δ)/ε)O(\log^d(1/\varepsilon)\log^2(n/\delta)/\varepsilon)O(logd(1/ε)log2(n/δ)/ε) and O(log⁡d+2(1/ε)log⁡2(n/δ))O(\log^{d+2}(1/\varepsilon)\log^2(n/\delta))O(logd+2(1/ε)log2(n/δ)) global experiments. Sufficient field strength is O(max⁡{log⁡d(1/ε),log⁡(1/ε)[1+log⁡log⁡(1/ε)]3})O(\max\{\log^d(1/\varepsilon),\log(1/\varepsilon)[1+\log\log(1/\varepsilon)]^3\})O(max{logd(1/ε),log(1/ε)[1+loglog(1/ε)]3}), independent of nnn. Classical post-processing is polynomial in nnn, 1/ε1/\varepsilon1/ε, and log⁡(1/δ)\log(1/\delta)log(1/δ).
Random signed Pauli fields, weakened at selected defect sites, induce approximate prethermal charge conservation. Defect Ramsey signals encode effective local transition energies, extracted by robust frequency estimation. Analytic continuation of the ADHH prethermal recursion and connected-cluster Taylor expansions bound spatial truncation errors and derivatives of the energy map. These establish stable coefficient recovery by a contractive, preconditioned fitting algorithm. Defects separated by O(log⁡(1/ε))O(\log(1/\varepsilon))O(log(1/ε)) can be probed simultaneously; lattice coloring supplies the parallelization overhead.
The guarantees require geometrically local qubit interactions and accurately known, spatially programmable fields. Finite available field strength still imposes a precision limit. The stated SPAM robustness covers bounded measurement-probability deviations below a constant threshold; extensions to other particle types or control settings remain proposed directions.
Learning the Hamiltonian governing a quantum system is a central task in quantum metrology, sensing, and device characterization. Existing Heisenberg-limited Hamiltonian learning protocols either require multi-qubit operations that are prone to noise, or single-qubit operations whose frequency or strength increases with the desired precision. These two requirements limit the applicability of Hamiltonian learning on near-term quantum platforms. We present a protocol that learns a quantum Hamiltonian with the optimal Heisenberg-limited scaling using only single-qubit control in the form of static fields with strengths that are independent of the target precision. Our protocol is robust against the state preparation and measurement (SPAM) error. By overcoming these limitations, our protocol provides new tools for device characterization and quantum sensing. We demonstrate that our method achieves the Heisenberg-limited scaling through rigorous mathematical proof and numerical experiments. We also prove an information-theoretic lower bound showing that a non-vanishing static field strength is necessary for achieving the Heisenberg limit unless one employs an extensive number of discrete control operations.
Characterizing quantum systems by learning their underlying Hamiltonians is a central task in quantum information science. While recent algorithmic advances have achieved near-optimal efficiency in this task, they critically rely on accessing arbitrarily short-time dynamics. This reliance poses severe experimental challenges due to finite control bandwidth and transient pulse errors. In this work, we demonstrate that Heisenberg-limited Hamiltonian learning can be achieved without short-time control. We introduce a framework in which every query to the unknown dynamics has duration at least a prescribed minimum time TTT, and show that this restriction does not preclude Heisenberg-limited scaling. The key ingredient is a method for emulating the continuous quantum control required by iterative learning algorithms using only such lower-bounded evolution times. This reduces the learning task to sparse pure-state tomography. Notably, for logarithmically sparse Hamiltonians, our algorithm achieves the information-theoretically optimal 1/ε1/\varepsilon1/ε scaling in total evolution time for any arbitrary constant minimum evolution time TTT. For many-body (polynomially sparse) systems, we uncover a rigorous quantitative tradeoff, showing that the minimum required evolution time can be significantly relaxed from the standard limit at a polynomial cost in total evolution time. Our results affirmatively resolve a prominent open problem in the field and reveal that high-bandwidth, ultra-short pulses are not fundamentally necessary for optimal quantum learning.
Hamiltonian learning provides a systematic framework for reconstructing unknown quantum dynamics. However, existing protocols typically assume direct measurement access to the entire system. With fast single-qubit control and a connected reference backbone, we show that a single measurable qubit suffices to learn all O(N)O(N)O(N) independent parameters of a bounded-degree two-body Hamiltonian on NNN qubits at the Heisenberg limit. Crucially, our protocol uses robust SWAP gates synthesized by quantum signal processing, enabling coherent transfer of states evolving under distant Hamiltonian parameters to the measurable qubit. This transfer requires no prior calibration of the Hamiltonian parameters of the intermediate links. A parallel learning architecture achieves total query time O~(N)\widetilde{O}(N)O(N) for an NNN-qubit chain, while retaining Heisenberg-limited precision scaling. On the chain, these scalings match the fundamental precision and information-propagation lower bounds up to logarithmic factors. The framework further extends to arbitrary bounded-degree interaction graphs. Our results establish a scalable route to learning an extensive number of many-body Hamiltonian parameters through only a local measurement interface.
We study Hamiltonian learning for kkk-local Hamiltonians at large step size, using only forward time evolution at integer multiples of a fixed time interval. For this task, our new technique, which we call eigenphase engineering, achieves Heisenberg-limited learning with a step size that is optimal up to logarithmic factors. For an unknown sss-sparse Hamiltonian with fixed locality kkk and ∥H∥op≤Λ\|H\|_{\mathrm{op}}\leqΛ∥H∥op​≤Λ, our algorithm recovers its Pauli coefficients to ℓ2\ell_2ℓ2​ error ε\varepsilonε in total evolution time O~(s/ε)\widetilde{O}(s/\varepsilon)O(s/ε), matching the best known scaling while allowing a near-maximal step size Θ~(1/Λ)\widetildeΘ(1/Λ)Θ(1/Λ). As an independent contribution, we strengthen the evolution-time lower bound to Ωk(s1−1/(2k)/ε)Ω_k(s^{1-1/(2k)}/\varepsilon)Ωk​(s1−1/(2k)/ε), placing our algorithm within a factor O~(s1/(2k))\widetilde{O}(s^{1/(2k)})O(s1/(2k)) of being optimal. Eigenphase engineering departs from approaches based on dynamical approximation or iteratively canceling the unknown Hamiltonian. It encodes energy expectation differences in the perturbative response of eigenphases of the actual controlled evolution, then extracts them through phase estimation and high-order extrapolation. This avoids the need for polynomially shorter evolution steps as the target precision improves. A version using only single-qubit operations retains the same step size with a n\sqrt nn​ overhead in ℓ2\ell_2ℓ2​ learning time for nnn qubits. The method also enables tolerant Hamiltonian certification and estimation of a specified Pauli coefficient, the latter without locality or sparsity assumptions. These results establish eigenphase engineering as a versatile approach to extracting Hamiltonian information with infrequent control.
We study the problem of learning arbitrary nnn-qubit Lindbladians, the generators of Markovian open-system dynamics, from their time evolution. We give the first known efficient algorithm that learns arbitrary Lindbladians without any structural assumptions. For an nnn-qubit Lindbladian of dynamical strength at most ΛΛΛ, the algorithm estimates every coefficient to error ε\varepsilonε using O~(Λ2/ε2)\widetilde O(Λ^2/\varepsilon^2)O(Λ2/ε2) experiments and O~(Λ/ε2)\widetilde O(Λ/\varepsilon^2)O(Λ/ε2) total evolution time, with classical running time polynomial in nnn and Λ/εΛ/\varepsilonΛ/ε. Both experimental costs match known lower bounds up to polylogarithmic factors. The algorithm identifies candidate labels through product Pauli experiments and estimates their coefficients using random stabilizer preparations and Clifford measurements. It requires no ancillas or control during the unknown evolution. For constant kkk, our algorithm learns generic kkk-local Lindbladians of local dynamical strength at most ΛlocΛ_{\mathrm{loc}}Λloc​ using O~(n2Λloc2/ε2)\widetilde O(n^2Λ_{\mathrm{loc}}^2/\varepsilon^2)O(n2Λloc2​/ε2) experiments and O~(nΛloc/ε2)\widetilde O(nΛ_{\mathrm{loc}}/\varepsilon^2)O(nΛloc​/ε2) total evolution time, improving the upper bounds of prior works in terms of the dependence on nnn. We further improve the lower bounds of Arad, Chen, Guo, Rebentrost, and Yu (SODA 2027) using a family of 333-local Lindbladians. They already hold when the support is known, and only one Hamiltonian coefficient is requested, even for adaptive protocols with arbitrary ancillas and quantum memory. These lower bounds establish that our algorithm is optimal up to polylogarithmic factors in both experiment count and total evolution time for every fixed k≥3k \geq 3k≥3.
Learning the unknown interactions that govern a quantum system is crucial for quantum information processing, device benchmarking, and quantum sensing. The problem, known as Hamiltonian learning, is well understood under the assumption that interactions are local, but this assumption may not hold for arbitrary Hamiltonians. Previous methods all require high-order inverse polynomial dependency with precision, unable to surpass the standard quantum limit and reach the gold-standard Heisenberg-limited scaling. Whether Heisenberg-limited Hamiltonian learning is possible without prior assumptions about the interaction structures, a challenge we term , remains an open question. In this work, we present a quantum algorithm to learn arbitrary sparse Hamiltonians without any structure constraints using only black-box queries of the system’s real-time evolution and minimal digital controls to attain Heisenberg-limited scaling in estimation error. Our method is also resilient to state-preparation-and-measurement errors, enhancing its practical feasibility. We numerically demonstrate our ansatz-free protocol for learning physical Hamiltonians and validating analog quantum simulations, benchmarking our performance against the state-of-the-art Heisenberg-limited learning approach. Moreover, we establish a fundamental trade-off between total evolution time and quantum control on learning arbitrary interactions, revealing the intrinsic interplay between controllability and total evolution-time complexity for any learning algorithm. These results pave the way for further exploration into Heisenberg-limited Hamiltonian learning in complex quantum systems under minimal assumptions, potentially enabling new benchmarking and verification protocols.