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

Fast mixing of all-to-all quantum systems at high temperatures

Thiago Bergamaschi

quant-phSubmitted Jun 24, 2026• Announced Jun 25, 2026• 19 citations• Revised Sep 30, 2026 (v2)
v1 · Jun 24, 2026v2 · Sep 30, 2026
arXivHTMLPDF

Abstract

It is shown that arbitrary quantum $k$-local Hamiltonians with bounded strength interactions admit a quantum Gibbs sampler [CKG23] with a system-size independent spectral gap, at sufficiently high temperatures. As a consequence, such systems admit fully-polynomial time quantum approximation algorithms for partition functions and global expectation values.

Related papers

Fast mixing of the SYK model at high temperatures

Yiyi Cai, Yongtao Zhan, Alexander Zlokapa

The Sachdev-Ye-Kitaev (SYK) model is a strongly interacting fermionic system. Its dynamics are difficult to analyze with Lieb-Robinson bounds and cluster expansions due to its all-to-all disordered interactions. We prove that, with high probability over the disorder, the SYK model admits a quantum Gibbs sampler with a system-size-independent spectral gap at sufficiently high constant temperatures. This yields polynomial-time preparation of SYK Gibbs states on a quantum computer. While prior non-rigorous computations that suggested SYK thermalization were limited to studying local correlators, we emphasize that our result holds up to arbitrary inverse polynomial trace distance. Our proof introduces the pseudo-Lindbladian approach to fermions then applies two key new ideas: a Bochner inequality for quantum dynamics, and an especially simple SYK analysis based on a comparison to classical dynamics.

quant-pharXiv:2610.05953•Oct 6, 2026•4 citations

Fast Mixing of Quantum Spin Chains at All Temperatures

Thiago Bergamaschi, Chi-Fang Chen

It is shown that every one-dimensional Hamiltonian with short-range interactions admits a quantum Gibbs sampler [CKG23] with a system-size independent spectral gap at all finite temperatures. Consequently, their Gibbs states can be prepared in polylogarithmic depth, and satisfy exponential clustering of correlations, generalizing [Ara69].

arXiv:2510.08533•ACM Symposium on Theory of Computing (STOC)•Jun 9, 2026•42 citations

Spectral Analysis Beyond the Spectral Gap: Rapid Mixing of Quantum Gibbs Samplers in One Dimension

Hongrui Chen, Zhiyan Ding

We prove rapid mixing of a quantum Gibbs sampler for general one-dimensional non-commuting local spin systems at every fixed positive temperature. In particular, for a system of $n$ sites, we show that the Kubo--Martin--Schwinger (KMS) detailed-balanced Gibbs sampler of~\cite{CKG2023} converges from any initial state to trace-norm error $ε$ in time $O(\log^4(n)+\log(1/ε))$. This improves the previous $O(n+\log(1/ε))$ bound and establishes rapid mixing beyond high-temperature and weak-interaction regimes. Our proof explains why the slowest decay rate, captured by the spectral gap, can substantially underestimate the speed of equilibration. The key insight is that a state far from equilibrium must have a substantial component outside the span of low-weight Pauli operators, where stronger dissipation estimates apply. This yields two stages of relaxation: a double-exponential convergence from a bad initial state, followed by exponential convergence near equilibrium. We turn this mechanism into a framework for proving rapid mixing through spectral analysis beyond the gap. Our decay estimate is equivalent to exponential convergence in sandwiched Rényi-2 divergence. Together with the spectral gap, it also implies a modified logarithmic Sobolev inequality with rate $Ω(\log^{-4}(n))$.

quant-pharXiv:2610.05848•Oct 6, 2026•6 citations

Optimal Quantum Algorithm for Gibbs State Preparation

Cambyse Rouzé, Daniel Stilck França, Alvaro Martin Alhambra

It is of great interest to understand the thermalization of open quantum many-body systems, and how quantum computers are able to efficiently simulate that process. A recently introduced dissipative evolution, inspired by existing models of open system thermalization, has been shown to be efficiently implementable on a quantum computer. Here, we prove that, at high enough temperatures, this evolution reaches the Gibbs state in time scaling logarithmically with system size. The result holds for Hamiltonians that satisfy the Lieb-Robinson bound, such as local Hamiltonians on a lattice, and includes long-range systems. To the best of our knowledge, these are the first results rigorously establishing the rapid mixing property of high-temperature quantum Gibbs samplers, which is known to give the fastest possible speed for thermalization in the many-body setting. We then apply our result to the problem of estimating partition functions at high temperature, showing an improved performance over previous classical and quantum algorithms.

arXiv:2411.04885•Physical Review Letters•Jan 14, 2026•94 citations

When quantum thermal states look classical

Harald Putterman, Alexander Zlokapa, Jordan Cotler

At high temperature, quantum Gibbs states retain several classical features of the maximally mixed state: the absence of entanglement, the absence of magic, analyticity of the partition function, correlation decay, and algorithmic tractability. We prove new and sharp bounds showing that these features persist down to finite temperatures independent of system size, but fail at distinct inverse-temperature scales, forming a hierarchy of classical-to-quantum transitions. Our results hold for long-range Pauli interactions with bounded strength at every site. Despite such all-to-all interactions, we show that the death of entanglement occurs at constant temperature, resolving an open question of Rouze, Franca and Alhambra (STOC'25). We give a polynomial-time classical algorithm that prepares Gibbs states up to the death of entanglement transition. Notably, this is asymptotically colder than temperatures at which quantum Gibbs samplers are known to mix quickly, as well as the original separability temperature of Bakshi et al. (FOCS'24), which we improve to be tight up to constants. At asymptotically even colder temperatures, we show that the Gibbs state remains in the thermodynamic infinite-temperature phase. We give polynomial-time classical algorithms for estimating thermal expectations up to the phase transition (despite both entanglement and magic), and as a corollary resolve a correlation decay conjecture of Harrow, Mehraban and Soleimanifar (STOC'20).

quant-pharXiv:2607.28536•Jul 31, 2026•12 citations

Rapid mixing for Gibbs samplers for quantum spin systems with all-to-all interactions

Nicola Bertoni, Giacomo De Palma

Understanding when quantum many-body systems rapidly converge to thermal equilibrium is a central problem in quantum statistical mechanics. While spatial locality provides powerful tools for systems with an underlying geometry, fully connected models require estimates that accommodate interactions between every pair of spins. We study Gibbs-state preparation for two-local quantum Hamiltonians on arbitrary interaction graphs, including fully connected systems, via Lindblad dynamics that satisfies Kubo--Martin--Schwinger (KMS) detailed balance. Our approach is based on a quantum analogue of the classical Dobrushin condition, which controls the influence of local perturbations on the rest of the system. Using the quantum Wasserstein distance of order $1$, we quantify how these perturbations propagate under the dynamics and derive contraction estimates in a high-temperature regime controlled by the maximum total interaction strength per site. These estimates require no assumptions on spatial geometry or graph growth and yield mixing times logarithmic in the system size and the inverse error tolerance, uniformly over all initial states.

quant-pharXiv:2610.40361•Oct 30, 2026•1 citation
It is shown that arbitrary quantum kkk-local Hamiltonians with bounded strength interactions admit a quantum Gibbs sampler [CKG23] with a system-size independent spectral gap, at sufficiently high temperatures. As a consequence, such systems admit fully-polynomial time quantum approximation algorithms for partition functions and global expectation values.
The Sachdev-Ye-Kitaev (SYK) model is a strongly interacting fermionic system. Its dynamics are difficult to analyze with Lieb-Robinson bounds and cluster expansions due to its all-to-all disordered interactions. We prove that, with high probability over the disorder, the SYK model admits a quantum Gibbs sampler with a system-size-independent spectral gap at sufficiently high constant temperatures. This yields polynomial-time preparation of SYK Gibbs states on a quantum computer. While prior non-rigorous computations that suggested SYK thermalization were limited to studying local correlators, we emphasize that our result holds up to arbitrary inverse polynomial trace distance. Our proof introduces the pseudo-Lindbladian approach to fermions then applies two key new ideas: a Bochner inequality for quantum dynamics, and an especially simple SYK analysis based on a comparison to classical dynamics.
We prove rapid mixing of a quantum Gibbs sampler for general one-dimensional non-commuting local spin systems at every fixed positive temperature. In particular, for a system of nnn sites, we show that the Kubo--Martin--Schwinger (KMS) detailed-balanced Gibbs sampler of~\cite{CKG2023} converges from any initial state to trace-norm error εεε in time O(log⁡4(n)+log⁡(1/ε))O(\log^4(n)+\log(1/ε))O(log4(n)+log(1/ε)). This improves the previous O(n+log⁡(1/ε))O(n+\log(1/ε))O(n+log(1/ε)) bound and establishes rapid mixing beyond high-temperature and weak-interaction regimes. Our proof explains why the slowest decay rate, captured by the spectral gap, can substantially underestimate the speed of equilibration. The key insight is that a state far from equilibrium must have a substantial component outside the span of low-weight Pauli operators, where stronger dissipation estimates apply. This yields two stages of relaxation: a double-exponential convergence from a bad initial state, followed by exponential convergence near equilibrium. We turn this mechanism into a framework for proving rapid mixing through spectral analysis beyond the gap. Our decay estimate is equivalent to exponential convergence in sandwiched Rényi-2 divergence. Together with the spectral gap, it also implies a modified logarithmic Sobolev inequality with rate Ω(log⁡−4(n))Ω(\log^{-4}(n))Ω(log−4(n)).
It is of great interest to understand the thermalization of open quantum many-body systems, and how quantum computers are able to efficiently simulate that process. A recently introduced dissipative evolution, inspired by existing models of open system thermalization, has been shown to be efficiently implementable on a quantum computer. Here, we prove that, at high enough temperatures, this evolution reaches the Gibbs state in time scaling logarithmically with system size. The result holds for Hamiltonians that satisfy the Lieb-Robinson bound, such as local Hamiltonians on a lattice, and includes long-range systems. To the best of our knowledge, these are the first results rigorously establishing the rapid mixing property of high-temperature quantum Gibbs samplers, which is known to give the fastest possible speed for thermalization in the many-body setting. We then apply our result to the problem of estimating partition functions at high temperature, showing an improved performance over previous classical and quantum algorithms.
At high temperature, quantum Gibbs states retain several classical features of the maximally mixed state: the absence of entanglement, the absence of magic, analyticity of the partition function, correlation decay, and algorithmic tractability. We prove new and sharp bounds showing that these features persist down to finite temperatures independent of system size, but fail at distinct inverse-temperature scales, forming a hierarchy of classical-to-quantum transitions. Our results hold for long-range Pauli interactions with bounded strength at every site. Despite such all-to-all interactions, we show that the death of entanglement occurs at constant temperature, resolving an open question of Rouze, Franca and Alhambra (STOC'25). We give a polynomial-time classical algorithm that prepares Gibbs states up to the death of entanglement transition. Notably, this is asymptotically colder than temperatures at which quantum Gibbs samplers are known to mix quickly, as well as the original separability temperature of Bakshi et al. (FOCS'24), which we improve to be tight up to constants. At asymptotically even colder temperatures, we show that the Gibbs state remains in the thermodynamic infinite-temperature phase. We give polynomial-time classical algorithms for estimating thermal expectations up to the phase transition (despite both entanglement and magic), and as a corollary resolve a correlation decay conjecture of Harrow, Mehraban and Soleimanifar (STOC'20).
Understanding when quantum many-body systems rapidly converge to thermal equilibrium is a central problem in quantum statistical mechanics. While spatial locality provides powerful tools for systems with an underlying geometry, fully connected models require estimates that accommodate interactions between every pair of spins. We study Gibbs-state preparation for two-local quantum Hamiltonians on arbitrary interaction graphs, including fully connected systems, via Lindblad dynamics that satisfies Kubo--Martin--Schwinger (KMS) detailed balance. Our approach is based on a quantum analogue of the classical Dobrushin condition, which controls the influence of local perturbations on the rest of the system. Using the quantum Wasserstein distance of order 111, we quantify how these perturbations propagate under the dynamics and derive contraction estimates in a high-temperature regime controlled by the maximum total interaction strength per site. These estimates require no assumptions on spatial geometry or graph growth and yield mixing times logarithmic in the system size and the inverse error tolerance, uniformly over all initial states.