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

Slow Mixing of Quantum Gibbs Samplers

David Gamarnik, Bobak T. Kiani, Alexander Zlokapa

Published Nov 6, 2024• 36 citations
arXivHTMLPDF

Abstract

Preparing thermal (Gibbs) states is a common task in physics and computer science. Recent algorithms mimic cooling via system-bath coupling, where the cost is determined by mixing time, akin to classical Metropolis-like algorithms. However, few methods exist to demonstrate slow mixing in quantum systems, unlike the well-established classical tools for systems like the Ising model and constraint satisfaction problems. We present a quantum generalization of these tools through a generic bottleneck lemma that implies slow mixing in quantum systems. This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles and quantified either through Bohr spectrum jumps or operator locality. Using our bottleneck lemma, we establish unconditional lower bounds on the mixing times of Gibbs samplers for several families of Hamiltonians at low temperatures. For classical Hamiltonians with mixing time lower bounds $T_\mathrm{mix} = \exp[Ω(n^α)]$, we prove that quantum Gibbs samplers also have $T_\mathrm{mix} = \exp[Ω(n^α)]$. This applies to models like random $K$-SAT instances and spin glasses. For stabilizer Hamiltonians, we provide a concise proof of exponential lower bounds $T_\mathrm{mix} = \exp[Ω(n)]$ on mixing times of good $n$-qubit stabilizer codes at low constant temperature. Finally, we consider constant-degree classical Hamiltonians and show how to lift classical slow mixing results in the presence of a transverse field using Poisson Feynman-Kac techniques. We show generic results for models with linear free energy barriers, and we demonstrate that our techniques extend to models with sublinear free energy barriers by proving $T_\mathrm{mix} = \exp[n^{1/2-o(1)}]$ for the ferromagnetic 2D transverse field Ising model.

DOI
10.48550/arxiv.2411.04300

Related papers

Exponential mixing time for the Davies dynamics of the quantum random energy model

Giacomo De Palma, Emanuele Mingione

We prove exponentially slow thermalization for the quantum random energy model (QREM) under Davies dynamics. The QREM is the $n$-qubit Hamiltonian $H=ΓT+U$, where $U$ assigns independent Gaussian energies with variance equal to the system size to computational-basis configurations and $T$ is the transverse field generated by single-qubit Pauli $X$ operators. Let $β_c=\sqrt{2\log 2}$ be the freezing inverse temperature of the classical random energy model. For every inverse temperature $β>β_c$ and every transverse-field strength $0\leqΓ<Γ_c(β)$, where $e^{ββ_c}=2\cosh(βΓ_c(β))$, we show that the mixing time of the dissipative Davies dynamics associated with single-qubit Pauli system--bath couplings grows exponentially with the system size, almost surely; the bound is unchanged if the standard zero-Bohr-frequency dephasing terms are included. The result is uniform over all Davies rates satisfying detailed balance and a polynomial upper bound and does not assume primitivity. In the spin-glass phase, the Gibbs weight is carried by a sparse family of deep classical configurations that are separated by an extensive Hamming distance. A localization theorem for the QREM [Manai, Warzel, Comm. Math. Phys. 402, 1259 (2023)] transfers this geometry to the corresponding low-energy quantum eigenstates. Consequently, the Gibbs weight of the intermediate spectral sector is exponentially small, while single-qubit bath operators have exponentially small matrix elements between the two macroscopic sides of the bottleneck. A Davies-specific flux estimate then converts these two facts into an exponential lower bound on the mixing time. This gives a rigorous open-system dynamical manifestation of the frozen, localized low-energy structure of the QREM throughout its equilibrium spin-glass phase below the quantum transition line.

arXiv:2611.08064•Nov 5, 2026•0 citations

A rapidly mixing quantum Swendsen–Wang sampler and a locality lower bound for Gibbs sampling

Soo-Jong Rey

I study the mixing time of quantum Gibbs samplers (Davies / Chen– Kastoryano–Gilyén generators) at low temperature. I prove a locality lower bound: any local, KMS–detailed-balanced sampler whose target has an order- parameter bottleneck has an Arrhenius-small spectral gap, by a quantum Cheeger argument, and hence mixing time eΩ(β∆F). The bound is a quantum Cheeger argument and holds for every KMS–detailed-balanced sampler. The coherence cannot lift an order-parameter bottleneck, thereby the obstruction survives quantization. It is not, however, intrinsic to the target. I give a 3-local, detailed-balanced Lindbladian on an enlarged spin+bond register whose spin marginal realizes the Fortuin–Kasteleyn cluster update and which, for commuting ferromagnets, has an inverse-polynomial gap at every temperature and prepares σ in poly(n)log(1/ε) gates. This gives an unconditional separation from the local-reversible class in which locality (not coherence) is the operative resource. As a conjecture, I isolate the genuinely quantum question about cluster updates for noncommuting targets, where no nonnegative bond representation exists and the cluster must be grown coherently.

•Jul 23, 2026•0 citations

Rapid mixing of quantum spin chains at any finite temperature

Leeseok Kim

We prove that a quasi-local quantum Gibbs sampler rapidly mixes to the Gibbs state of any 1D finite-range Hamiltonian at all finite temperatures in $\mathcal{O}\left(\log (n/\varepsilon)\right)$ time. Each update traces out a contiguous block of constant length and reconstructs it using the Petz recovery map, following early proposals for quantum heat-bath Gibbs samplers by Kastoryano and Brandão~\cite{kastoryano2016quantum}. Our proof directly bounds the distance between the updated state and the target Gibbs state using quantum Wasserstein distance of order $1$. We further provide $\mathcal{O}(\text{polylog}(n/\varepsilon))$ depth of quantum circuits to prepare these Gibbs states. We hope these techniques will facilitate the analysis and design of other Gibbs samplers.

quant-pharXiv:2610.01190•Oct 2, 2026•7 citations

Bottlenecks in Quantum Channels and Finite Temperature Phases of Matter

Tibor Rakovszky, Benedikt Placke, Nikolas P. Breuckmann +1 more

We prove an analog of the "bottleneck theorem," well-known for classical Markov chains, for Markovian quantum channels. In particular, we show that if two regions (subspaces) of Hilbert space are separated by a region that has very low weight in the channel's steady state, then states initialized on one side of this barrier will take a long time to relax, putting a lower bound on the mixing time in terms of an appropriately defined "quantum bottleneck ratio." Importantly, this bottleneck ratio involves not only the probabilities of the relevant subspaces, but also the size of off-diagonal matrix elements between them. For low temperature quantum many-body systems, we use the bottleneck theorem to bound the performance of any quasilocal Gibbs sampler. This leads to a new perspective on thermally stable quantum phases in terms of a decomposition of the Gibbs state into multiple components separated by bottlenecks. As a concrete application, we show rigorously that weakly perturbed commuting projector models with extensive energy barriers (which include certain classical and quantum expander codes) have exponentially large mixing times.

arXiv:2412.09598•Physical Review Letters•May 12, 2026•27 citations

Mixing Time of Quantum Gibbs Sampling for Random Sparse Hamiltonians

Akshar Ramkumar, Mehdi Soleimanifar

Providing evidence that quantum computers can efficiently prepare low-energy or thermal states of physically relevant interacting quantum systems is a major challenge in quantum information science. A newly developed quantum Gibbs sampling algorithm [Chen et al., 2023] provides an efficient simulation of the detailed-balanced dissipative dynamics of non-commutative quantum systems. The running time of this algorithm depends on the mixing time of the corresponding quantum Markov chain, which has not been rigorously bounded except in the high-temperature regime. In this work, we establish a polylog(n) upper bound on its mixing time for various families of random n × n sparse Hamiltonians at any constant temperature. We further analyze how the choice of the jump operators for the algorithm and the spectral properties of these sparse Hamiltonians influence the mixing time. Our result places this method for Gibbs sampling on par with other efficient algorithms for preparing low-energy states of quantumly easy Hamiltonians.

arXiv:2411.04454•Leibniz international proceedings in informatics•Nov 7, 2024•19 citations

Rapid mixing of Gibbs samplers via quantum Dobrushin--Shlosman conditions

Cambyse Rouzé, Daniel Stilck França

Classical Dobrushin--Shlosman theory uses heat-bath block updates to identify sharp temperature thresholds for establishing the rapid mixing of Gibbs samplers. In particular, these mixing guarantees often hold even when stricter single-site conditions fail. We extend this approach to noncommuting quantum lattice systems through a quantum Dobrushin--Shlosman condition for finite-block dynamics, which we call smoothed heat-bath dynamics. We establish this condition in two regimes. For finite-range quantum spin chains at every fixed finite temperature, we prove logarithmic trace-norm mixing in system size, with normalized bounds uniform in on-site fields and single exponential in inverse temperature. We also prove stability under small local perturbations of interacting, possibly noncommuting reference Hamiltonians on graphs of polynomial volume growth. For classical references with bounded local interactions, uniform strong spatial mixing implies our quantum condition. With bounded local terms and fixed physical, geometric and block parameters, the resulting samplers prepare Gibbs states to trace-norm error $\varepsilon$ using $N\operatorname{polylog}(N/\varepsilon)$ gates and classical operations. Our block updates combine a local Gibbs reset with quantum belief propagation to incorporate interactions across the block boundary, yielding exactly Gibbs-preserving, KMS-reversible channels. Two independently tunable parameters control contraction: an internal evolution time suppresses the influence of sites inside a block, while the block size allows interior contraction to dominate boundary influence. This finite-time relaxation has no counterpart in a classical heat-bath block update.

quant-pharXiv:2610.03578•Oct 5, 2026•5 citations
Preparing thermal (Gibbs) states is a common task in physics and computer science. Recent algorithms mimic cooling via system-bath coupling, where the cost is determined by mixing time, akin to classical Metropolis-like algorithms. However, few methods exist to demonstrate slow mixing in quantum systems, unlike the well-established classical tools for systems like the Ising model and constraint satisfaction problems. We present a quantum generalization of these tools through a generic bottleneck lemma that implies slow mixing in quantum systems. This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles and quantified either through Bohr spectrum jumps or operator locality. Using our bottleneck lemma, we establish unconditional lower bounds on the mixing times of Gibbs samplers for several families of Hamiltonians at low temperatures. For classical Hamiltonians with mixing time lower bounds Tmix=exp⁡[Ω(nα)]T_\mathrm{mix} = \exp[Ω(n^α)]Tmix​=exp[Ω(nα)], we prove that quantum Gibbs samplers also have Tmix=exp⁡[Ω(nα)]T_\mathrm{mix} = \exp[Ω(n^α)]Tmix​=exp[Ω(nα)]. This applies to models like random KKK-SAT instances and spin glasses. For stabilizer Hamiltonians, we provide a concise proof of exponential lower bounds Tmix=exp⁡[Ω(n)]T_\mathrm{mix} = \exp[Ω(n)]Tmix​=exp[Ω(n)] on mixing times of good nnn-qubit stabilizer codes at low constant temperature. Finally, we consider constant-degree classical Hamiltonians and show how to lift classical slow mixing results in the presence of a transverse field using Poisson Feynman-Kac techniques. We show generic results for models with linear free energy barriers, and we demonstrate that our techniques extend to models with sublinear free energy barriers by proving Tmix=exp⁡[n1/2−o(1)]T_\mathrm{mix} = \exp[n^{1/2-o(1)}]Tmix​=exp[n1/2−o(1)] for the ferromagnetic 2D transverse field Ising model.
We prove exponentially slow thermalization for the quantum random energy model (QREM) under Davies dynamics. The QREM is the nnn-qubit Hamiltonian H=ΓT+UH=ΓT+UH=ΓT+U, where UUU assigns independent Gaussian energies with variance equal to the system size to computational-basis configurations and TTT is the transverse field generated by single-qubit Pauli XXX operators. Let βc=2log⁡2β_c=\sqrt{2\log 2}βc​=2log2​ be the freezing inverse temperature of the classical random energy model. For every inverse temperature β>βcβ>β_cβ>βc​ and every transverse-field strength 0≤Γ<Γc(β)0\leqΓ<Γ_c(β)0≤Γ<Γc​(β), where eββc=2cosh⁡(βΓc(β))e^{ββ_c}=2\cosh(βΓ_c(β))eββc​=2cosh(βΓc​(β)), we show that the mixing time of the dissipative Davies dynamics associated with single-qubit Pauli system--bath couplings grows exponentially with the system size, almost surely; the bound is unchanged if the standard zero-Bohr-frequency dephasing terms are included. The result is uniform over all Davies rates satisfying detailed balance and a polynomial upper bound and does not assume primitivity. In the spin-glass phase, the Gibbs weight is carried by a sparse family of deep classical configurations that are separated by an extensive Hamming distance. A localization theorem for the QREM [Manai, Warzel, Comm. Math. Phys. 402, 1259 (2023)] transfers this geometry to the corresponding low-energy quantum eigenstates. Consequently, the Gibbs weight of the intermediate spectral sector is exponentially small, while single-qubit bath operators have exponentially small matrix elements between the two macroscopic sides of the bottleneck. A Davies-specific flux estimate then converts these two facts into an exponential lower bound on the mixing time. This gives a rigorous open-system dynamical manifestation of the frozen, localized low-energy structure of the QREM throughout its equilibrium spin-glass phase below the quantum transition line.
I study the mixing time of quantum Gibbs samplers (Davies / Chen– Kastoryano–Gilyén generators) at low temperature. I prove a locality lower bound: any local, KMS–detailed-balanced sampler whose target has an order- parameter bottleneck has an Arrhenius-small spectral gap, by a quantum Cheeger argument, and hence mixing time eΩ(β∆F). The bound is a quantum Cheeger argument and holds for every KMS–detailed-balanced sampler. The coherence cannot lift an order-parameter bottleneck, thereby the obstruction survives quantization. It is not, however, intrinsic to the target. I give a 3-local, detailed-balanced Lindbladian on an enlarged spin+bond register whose spin marginal realizes the Fortuin–Kasteleyn cluster update and which, for commuting ferromagnets, has an inverse-polynomial gap at every temperature and prepares σ in poly(n)log(1/ε) gates. This gives an unconditional separation from the local-reversible class in which locality (not coherence) is the operative resource. As a conjecture, I isolate the genuinely quantum question about cluster updates for noncommuting targets, where no nonnegative bond representation exists and the cluster must be grown coherently.
We prove that a quasi-local quantum Gibbs sampler rapidly mixes to the Gibbs state of any 1D finite-range Hamiltonian at all finite temperatures in O(log⁡(n/ε))\mathcal{O}\left(\log (n/\varepsilon)\right)O(log(n/ε)) time. Each update traces out a contiguous block of constant length and reconstructs it using the Petz recovery map, following early proposals for quantum heat-bath Gibbs samplers by Kastoryano and Brandão~\cite{kastoryano2016quantum}. Our proof directly bounds the distance between the updated state and the target Gibbs state using quantum Wasserstein distance of order 111. We further provide O(polylog(n/ε))\mathcal{O}(\text{polylog}(n/\varepsilon))O(polylog(n/ε)) depth of quantum circuits to prepare these Gibbs states. We hope these techniques will facilitate the analysis and design of other Gibbs samplers.
We prove an analog of the "bottleneck theorem," well-known for classical Markov chains, for Markovian quantum channels. In particular, we show that if two regions (subspaces) of Hilbert space are separated by a region that has very low weight in the channel's steady state, then states initialized on one side of this barrier will take a long time to relax, putting a lower bound on the mixing time in terms of an appropriately defined "quantum bottleneck ratio." Importantly, this bottleneck ratio involves not only the probabilities of the relevant subspaces, but also the size of off-diagonal matrix elements between them. For low temperature quantum many-body systems, we use the bottleneck theorem to bound the performance of any quasilocal Gibbs sampler. This leads to a new perspective on thermally stable quantum phases in terms of a decomposition of the Gibbs state into multiple components separated by bottlenecks. As a concrete application, we show rigorously that weakly perturbed commuting projector models with extensive energy barriers (which include certain classical and quantum expander codes) have exponentially large mixing times.
Providing evidence that quantum computers can efficiently prepare low-energy or thermal states of physically relevant interacting quantum systems is a major challenge in quantum information science. A newly developed quantum Gibbs sampling algorithm [Chen et al., 2023] provides an efficient simulation of the detailed-balanced dissipative dynamics of non-commutative quantum systems. The running time of this algorithm depends on the mixing time of the corresponding quantum Markov chain, which has not been rigorously bounded except in the high-temperature regime. In this work, we establish a polylog(n) upper bound on its mixing time for various families of random n × n sparse Hamiltonians at any constant temperature. We further analyze how the choice of the jump operators for the algorithm and the spectral properties of these sparse Hamiltonians influence the mixing time. Our result places this method for Gibbs sampling on par with other efficient algorithms for preparing low-energy states of quantumly easy Hamiltonians.
Classical Dobrushin--Shlosman theory uses heat-bath block updates to identify sharp temperature thresholds for establishing the rapid mixing of Gibbs samplers. In particular, these mixing guarantees often hold even when stricter single-site conditions fail. We extend this approach to noncommuting quantum lattice systems through a quantum Dobrushin--Shlosman condition for finite-block dynamics, which we call smoothed heat-bath dynamics. We establish this condition in two regimes. For finite-range quantum spin chains at every fixed finite temperature, we prove logarithmic trace-norm mixing in system size, with normalized bounds uniform in on-site fields and single exponential in inverse temperature. We also prove stability under small local perturbations of interacting, possibly noncommuting reference Hamiltonians on graphs of polynomial volume growth. For classical references with bounded local interactions, uniform strong spatial mixing implies our quantum condition. With bounded local terms and fixed physical, geometric and block parameters, the resulting samplers prepare Gibbs states to trace-norm error ε\varepsilonε using Npolylog⁡(N/ε)N\operatorname{polylog}(N/\varepsilon)Npolylog(N/ε) gates and classical operations. Our block updates combine a local Gibbs reset with quantum belief propagation to incorporate interactions across the block boundary, yielding exactly Gibbs-preserving, KMS-reversible channels. Two independently tunable parameters control contraction: an internal evolution time suppresses the influence of sites inside a block, while the block size allows interior contraction to dominate boundary influence. This finite-time relaxation has no counterpart in a classical heat-bath block update.