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:2610.01538

Efficient learning of quantum interactions from thermal metastable states

Bingrun Wang, Qi Ye, Chi-Fang Chen

quant-phSubmitted Oct 1, 2026• Announced Oct 2, 2026• 2 citations
arXivHTMLPDF

Abstract

Learning quantum interactions from finite-temperature many-body systems is a central task in emerging quantum platforms. Recently, the problem of learning from lattice quantum Gibbs states has found rigorous, efficient protocols. Nevertheless, exact Gibbs states, as the input premise, are in fact computationally intractable to prepare and may not faithfully represent generic finite-temperature quantum systems. In contrast, a system coupled to a heat bath can be stuck at an approximate stationary state (metastable state) long before it truly equilibrates. Here, we formulate a physically and algorithmically consistent alternative: learning from such metastable states of detailed-balanced master equations (Lindbladians) arising from system-bath interactions. We distill the algorithmic mechanism and structural condition underlying Gibbs-state learning and extend it in full to metastable states, attaining nearly optimal sample and computational complexity (in the system size and the precision). More broadly, we sharpen notions of metastability and develop a unified framework for finite-temperature learning.

AI Summary

Can local quantum interactions be learned from thermal states that have not globally equilibrated? This paper replaces exact Gibbs-state inputs with approximate stationary states of a specified quasi-local, KMS-detailed-balanced Lindbladian, including Hamiltonian evolution. The setting is an $n$-qubit, fixed-dimensional lattice Hamiltonian with known bounded-range Pauli terms, unknown coefficients in $[-1,1]$, and known inverse temperature $\beta$. Given independent, possibly nonidentical states satisfying $\|\mathcal L(\sigma_i)\|_1\leq\epsilon$, the protocol estimates every coefficient to additive error $\eta$ with failure probability $\delta$, using $\widetilde O(e^{\operatorname{poly}(\beta^{\pm1})}\eta^{-2}\log(n/\delta))$ samples and $n$ times that computational cost. The guarantee requires $\eta\geq C_\beta\epsilon^{\alpha_1}n^{\alpha_2}$, with temperature-dependent positive exponents. Assuming instead $\max_a\|\mathcal L_a(\sigma_i)\|_1\leq\epsilon$ removes the system-size factor from this precision floor. Random-time averaging of Lindbladian evolution supplies suitable inputs in polynomial evolution time at fixed temperature. The proof converts metastability into approximate detailed balance, then derives approximate KMS identities, local faithfulness, and tested commutator bounds. These support measurable local identifiability tests and iterative min–max coefficient refinement. Additional results relate entropy production, detailed-balance defects, and local/global stationarity, including regularization arguments accommodating rank-deficient states. The guarantees use a particular Gaussian-filtered thermal generator with single-site Pauli jumps throughout the lattice; extensions to other generators remain unproved. Temperature dependence and error exponents are not optimized. Whether global metastability necessitates a system-size-dependent precision floor remains open. The physical model assumes weak-coupling, Markovian bath dynamics.

Little sign of AI-generated textAI use disclosedStrong assumptions
LLMs also assisted with polishing the writing and figure preparation.

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

Related papers

A Structural Theory of Quantum Metastability: Markov Properties and Area Laws

Thiago Bergamaschi, Chi-Fang Chen, Umesh V. Vazirani

Statistical mechanics assumes that a quantum many-body system at low temperature can be effectively described by its Gibbs state. However, many complex quantum systems exist only as metastable states of dissipative open system dynamics, which appear stable and robust yet deviate substantially from true thermal equilibrium. In this work, we model metastable states as approximate stationary states of a quasi-local, (KMS)-detailed-balanced master equation representing Markovian system-bath interaction, and unveil a universal structural theory: all metastable states satisfy an area law of mutual information and a Markov property. The more metastable the states are, the larger the regions to which these structural results apply. Therefore, the hallmark correlation structure and noise resilience of Gibbs states are not exclusive to true equilibrium but emerge dynamically. Behind our structural results lies a systematic framework encompassing sharp equivalences between local minima of free energy, a non-commutative Fisher information, and approximate detailed balance conditions. Our results build towards a comprehensive theory of thermal metastability and, in turn, formulate a well-defined, feasible, and repeatable target for quantum thermal simulation.

arXiv:2510.08538•Oct 9, 2025•19 citations

The stationarity test: a framework for learning quantum many-body systems from their thermal states

Thiago Bergamaschi

The task of learning the Hamiltonian interactions governing a quantum system, given samples of its thermal (or 'Gibbs') states, is a foundational question at the intersection of quantum learning theory and many-body physics. In this paper, we draw connections to the quantum Gibbs sampling literature to introduce a natural learning algorithm we call the stationarity test: which simply "guesses" the Hamiltonian, and measures the rate-of-change of local observables, under the associated detailed-balanced quantum Markov chain [CKG23]. We leverage the stationarity test to address the following applications: 1. To give the first learning algorithm for the underlying interaction graph, i.e. structure learning, of lattice Hamiltonians at all temperatures, given copies of their Gibbs states. 2. To give the first learning algorithm for the coefficients of a lattice Hamiltonian, given only copies of its thermal metastable states, modeled as the "local minima" of the free energy. 3. In addition, we present a refinement to the recent area law for thermal metastable states [BCV25], which holds in the thermodynamic limit. Our learning algorithms are rigorous, time-efficient, and nearly sample-optimal in system size and accuracy. At a technical level, our arguments are based on new approximate locality and convexity properties for the quantum Fisher information of these Gibbs sampling algorithms.

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

Quantum Thermal State Preparation for Near-Term Quantum Processors

Jerome Lloyd, Dmitry A. Abanin

Preparation of quantum thermal states of many-body systems is a key computational challenge for quantum processors, with applications in physics, chemistry, and classical optimization. We provide a simple and efficient algorithm for thermal state preparation, combining engineered bath resetting and modulated system-bath coupling to derive a quantum channel approximately satisfying quantum detailed balance relations. We show that the fixed point σ ^ of the channel approximates the Gibbs state as ∥ σ ^ − σ ^ β ∥ ∼ θ 2 , where θ is the system-bath coupling and σ ^ β ∝ e − β H ^ S . We provide extensive numerics, for the example of the 2D quantum Ising model, confirming that the protocol successfully prepares the thermal state throughout the finite-temperature phase diagram, including near the quantum phase transition. Simulations for free-fermion systems provide further evidence for the accuracy of the protocol for large system sizes in the weak-coupling limit. Our algorithm provides a path to efficient quantum simulation of quantum-correlated states at finite temperature with current and near-term quantum processors.

arXiv:2506.21318•Physical Review X•Jul 8, 2026•30 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

Polynomial-time thermalization and Gibbs sampling from system-bath couplings

Samuel Slezak, Matteo Scandi, Álvaro M. Alhambra +2 more

Many physical phenomena, including thermalization in open quantum systems and quantum Gibbs sampling, are modeled by Lindbladians approximating a system weakly coupled to a bath. Understanding the convergence speed of these Lindbladians to their steady states is crucial for bounding algorithmic runtimes and thermalization timescales. We study two such families of processes: one characterizing a repeated-interaction Gibbs sampling algorithm, and another modeling open many-body quantum thermalization. We prove that both converge in polynomial time for several non-commuting systems, including high-temperature local lattices, weakly interacting fermions, and 1D spin chains. These results demonstrate that simple dissipative quantum algorithms can prepare complex Gibbs states and that Lindblad dynamics accurately capture thermal relaxation. Our proofs rely on a novel technical result that extrapolates spectral gap lower bounds from quasi-local Lindbladians to the non-local generators governing these dynamics.

quant-pharXiv:2601.16154•Jan 23, 2026•10 citations

Learning quantum Gibbs states locally and efficiently

Chi-Fang Chen, Anurag Anshu, Quynh T. Nguyen

Learning the Hamiltonian underlying a quantum many-body system in thermal equilibrium is a fundamental task in quantum learning theory and experimental sciences. To learn the Gibbs state of local Hamiltonians at any constant inverse temperature, the state-of-the-art provable algorithms fall short of the optimal sample and computational complexity, in sharp contrast with the locality and simplicity in the classical cases. In this work, we present a learning algorithm that learns each local term of a n-qubit Hamiltonian on any bounded-degree graph to a constant additive error with the optimal sample complexity $\mathcal{O}(\log n)$. The protocol uses parallelizable local quantum measurements that act within bounded neighborhoods of the graph and near-linear-time classical post-processing. We also give a learning algorithm for lattice Hamiltonians with near-optimal scaling on the learning precision and the inverse temperature. At the heart of our algorithm is the interplay between locality, the Kubo-MartinSchwinger condition, and the operator Fourier transform at arbitrary temperatures.

arXiv:2504.02706•Annual Symposium on Foundations of Computer Science•Dec 14, 2025•26 citations
Learning quantum interactions from finite-temperature many-body systems is a central task in emerging quantum platforms. Recently, the problem of learning from lattice quantum Gibbs states has found rigorous, efficient protocols. Nevertheless, exact Gibbs states, as the input premise, are in fact computationally intractable to prepare and may not faithfully represent generic finite-temperature quantum systems. In contrast, a system coupled to a heat bath can be stuck at an approximate stationary state (metastable state) long before it truly equilibrates. Here, we formulate a physically and algorithmically consistent alternative: learning from such metastable states of detailed-balanced master equations (Lindbladians) arising from system-bath interactions. We distill the algorithmic mechanism and structural condition underlying Gibbs-state learning and extend it in full to metastable states, attaining nearly optimal sample and computational complexity (in the system size and the precision). More broadly, we sharpen notions of metastability and develop a unified framework for finite-temperature learning.
Can local quantum interactions be learned from thermal states that have not globally equilibrated? This paper replaces exact Gibbs-state inputs with approximate stationary states of a specified quasi-local, KMS-detailed-balanced Lindbladian, including Hamiltonian evolution. The setting is an nnn-qubit, fixed-dimensional lattice Hamiltonian with known bounded-range Pauli terms, unknown coefficients in [−1,1][-1,1][−1,1], and known inverse temperature β\betaβ.
Given independent, possibly nonidentical states satisfying ∥L(σi)∥1≤ϵ\|\mathcal L(\sigma_i)\|_1\leq\epsilon∥L(σi​)∥1​≤ϵ, the protocol estimates every coefficient to additive error η\etaη with failure probability δ\deltaδ, using O~(epoly⁡(β±1)η−2log⁡(n/δ))\widetilde O(e^{\operatorname{poly}(\beta^{\pm1})}\eta^{-2}\log(n/\delta))O(epoly(β±1)η−2log(n/δ)) samples and nnn times that computational cost. The guarantee requires η≥Cβϵα1nα2\eta\geq C_\beta\epsilon^{\alpha_1}n^{\alpha_2}η≥Cβ​ϵα1​nα2​, with temperature-dependent positive exponents. Assuming instead max⁡a∥La(σi)∥1≤ϵ\max_a\|\mathcal L_a(\sigma_i)\|_1\leq\epsilonmaxa​∥La​(σi​)∥1​≤ϵ removes the system-size factor from this precision floor. Random-time averaging of Lindbladian evolution supplies suitable inputs in polynomial evolution time at fixed temperature.
The proof converts metastability into approximate detailed balance, then derives approximate KMS identities, local faithfulness, and tested commutator bounds. These support measurable local identifiability tests and iterative min–max coefficient refinement. Additional results relate entropy production, detailed-balance defects, and local/global stationarity, including regularization arguments accommodating rank-deficient states.
The guarantees use a particular Gaussian-filtered thermal generator with single-site Pauli jumps throughout the lattice; extensions to other generators remain unproved. Temperature dependence and error exponents are not optimized. Whether global metastability necessitates a system-size-dependent precision floor remains open. The physical model assumes weak-coupling, Markovian bath dynamics.
Statistical mechanics assumes that a quantum many-body system at low temperature can be effectively described by its Gibbs state. However, many complex quantum systems exist only as metastable states of dissipative open system dynamics, which appear stable and robust yet deviate substantially from true thermal equilibrium. In this work, we model metastable states as approximate stationary states of a quasi-local, (KMS)-detailed-balanced master equation representing Markovian system-bath interaction, and unveil a universal structural theory: all metastable states satisfy an area law of mutual information and a Markov property. The more metastable the states are, the larger the regions to which these structural results apply. Therefore, the hallmark correlation structure and noise resilience of Gibbs states are not exclusive to true equilibrium but emerge dynamically. Behind our structural results lies a systematic framework encompassing sharp equivalences between local minima of free energy, a non-commutative Fisher information, and approximate detailed balance conditions. Our results build towards a comprehensive theory of thermal metastability and, in turn, formulate a well-defined, feasible, and repeatable target for quantum thermal simulation.
The task of learning the Hamiltonian interactions governing a quantum system, given samples of its thermal (or 'Gibbs') states, is a foundational question at the intersection of quantum learning theory and many-body physics. In this paper, we draw connections to the quantum Gibbs sampling literature to introduce a natural learning algorithm we call the stationarity test: which simply "guesses" the Hamiltonian, and measures the rate-of-change of local observables, under the associated detailed-balanced quantum Markov chain [CKG23]. We leverage the stationarity test to address the following applications: 1. To give the first learning algorithm for the underlying interaction graph, i.e. structure learning, of lattice Hamiltonians at all temperatures, given copies of their Gibbs states. 2. To give the first learning algorithm for the coefficients of a lattice Hamiltonian, given only copies of its thermal metastable states, modeled as the "local minima" of the free energy. 3. In addition, we present a refinement to the recent area law for thermal metastable states [BCV25], which holds in the thermodynamic limit. Our learning algorithms are rigorous, time-efficient, and nearly sample-optimal in system size and accuracy. At a technical level, our arguments are based on new approximate locality and convexity properties for the quantum Fisher information of these Gibbs sampling algorithms.
Preparation of quantum thermal states of many-body systems is a key computational challenge for quantum processors, with applications in physics, chemistry, and classical optimization. We provide a simple and efficient algorithm for thermal state preparation, combining engineered bath resetting and modulated system-bath coupling to derive a quantum channel approximately satisfying quantum detailed balance relations. We show that the fixed point σ ^ of the channel approximates the Gibbs state as ∥ σ ^ − σ ^ β ∥ ∼ θ 2 , where θ is the system-bath coupling and σ ^ β ∝ e − β H ^ S . We provide extensive numerics, for the example of the 2D quantum Ising model, confirming that the protocol successfully prepares the thermal state throughout the finite-temperature phase diagram, including near the quantum phase transition. Simulations for free-fermion systems provide further evidence for the accuracy of the protocol for large system sizes in the weak-coupling limit. Our algorithm provides a path to efficient quantum simulation of quantum-correlated states at finite temperature with current and near-term quantum processors.
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.
Many physical phenomena, including thermalization in open quantum systems and quantum Gibbs sampling, are modeled by Lindbladians approximating a system weakly coupled to a bath. Understanding the convergence speed of these Lindbladians to their steady states is crucial for bounding algorithmic runtimes and thermalization timescales. We study two such families of processes: one characterizing a repeated-interaction Gibbs sampling algorithm, and another modeling open many-body quantum thermalization. We prove that both converge in polynomial time for several non-commuting systems, including high-temperature local lattices, weakly interacting fermions, and 1D spin chains. These results demonstrate that simple dissipative quantum algorithms can prepare complex Gibbs states and that Lindblad dynamics accurately capture thermal relaxation. Our proofs rely on a novel technical result that extrapolates spectral gap lower bounds from quasi-local Lindbladians to the non-local generators governing these dynamics.
Learning the Hamiltonian underlying a quantum many-body system in thermal equilibrium is a fundamental task in quantum learning theory and experimental sciences. To learn the Gibbs state of local Hamiltonians at any constant inverse temperature, the state-of-the-art provable algorithms fall short of the optimal sample and computational complexity, in sharp contrast with the locality and simplicity in the classical cases. In this work, we present a learning algorithm that learns each local term of a n-qubit Hamiltonian on any bounded-degree graph to a constant additive error with the optimal sample complexity O(log⁡n)\mathcal{O}(\log n)O(logn). The protocol uses parallelizable local quantum measurements that act within bounded neighborhoods of the graph and near-linear-time classical post-processing. We also give a learning algorithm for lattice Hamiltonians with near-optimal scaling on the learning precision and the inverse temperature. At the heart of our algorithm is the interplay between locality, the Kubo-MartinSchwinger condition, and the operator Fourier transform at arbitrary temperatures.