REVIEW 5 minor 17 references
Quantum Gibbs states of long-range Pauli systems keep classical features down to finite, size-independent temperatures that fail in a sharp hierarchy.
Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →
Long-range Pauli Gibbs states lose entanglement, magic, and infinite-temperature analyticity at distinct constant inverse temperatures Θ(1/sk), Θ(log(1/ε)/sk), and Θ(1/s√k), with matching classical algorithms.
T0 review reviewed 2026-07-31 challenge →
load-bearing objection Tight hierarchy of classical-to-quantum transitions for long-range Pauli Gibbs states, with real open-question resolutions and algorithms that beat known quantum mixers on temperature.
When quantum thermal states look classical
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
Core claim
For (s,k)-long-range Pauli Hamiltonians, every Gibbs state is fully separable for β ≤ 1/(72 sk), a threshold that is tight Θ(1/sk) even for commuting examples; when the Hamiltonian is ε-close to commuting it remains a mixture of stabilizer states down to β = Θ(log(1/ε)/sk); and the partition function is zero-free in a disk of radius Θ(1/(s√k)). That disk yields exponential correlation decay for geometrically local systems and polynomial-time classical algorithms for log Z and local expectations, while a separate classical algorithm prepares the state as a mixture of pure product stabilizer states up to β = O(1/sk).
What carries the argument
Convergent cluster expansions of the ordinary partition function, of pinned post-selected partition functions after measuring qubits, and of interaction-picture propagators, paired with an adaptive pinning procedure that iteratively removes terms while preserving a separable or stabilizer decomposition; the expansions become polynomial-time algorithms by randomized sampling of polymers.
Load-bearing premise
The Hamiltonian must be a sum of Pauli strings whose total absolute strength on every single qubit stays bounded, independent of how large the system is.
What would settle it
Find an (s,k)-long-range Pauli Hamiltonian whose Gibbs state is entangled, or whose partition function has a zero, at an inverse temperature asymptotically colder than the claimed thresholds, or show that the classical preparation routine fails inside the claimed separable window.
If this is right
- Death of entanglement occurs at constant temperature even for all-to-all Pauli interactions with bounded per-site strength.
- Classical polynomial-time preparation of these Gibbs states reaches colder temperatures than known quantum Gibbs samplers.
- Any pair of observables on a geometrically local Pauli system has exponentially decaying correlations throughout the infinite-temperature phase.
- Proposed superpolynomial quantum advantage for estimating thermal expectations in long-range Pauli systems is ruled out inside the zero-free regime.
- Nearly commuting Hamiltonians keep stabilizer Gibbs states at parametrically colder temperatures than the separability scale.
Where Pith is reading between the lines
- A zero-free strip of real width ~1/s (instead of a disk of radius ~1/(s√k)) would likely extend classical estimation all the way to known hardness thresholds for classical spins.
- Pinned zeros appearing already at scale ~log k/(sk) suggest that quantum mixing arguments based on computational-basis conditioning may stop short of the full infinite-temperature phase.
- The window between separability (~1/sk) and the zero-free radius (~1/s√k) is a concrete regime where entanglement and magic can exist while thermodynamic classicality and classical estimation still hold.
- Whether the same hierarchy survives for non-Pauli local terms or fermionic models with unbounded ℓ1 strength remains the natural next stress test.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper establishes a hierarchy of classical-to-quantum transitions for Gibbs states of (s,k)-long-range Pauli Hamiltonians (bounded per-site ℓ1 interaction strength, locality k). It proves separability for all β ≤ 1/(72 sk), tight to Θ(1/sk) even for commuting models, resolving an open question of Rouzé–França–Alhambra; a matching polynomial-time classical algorithm preparing the state as a mixture of pure product stabilizer states up to β ≤ 1/(4096 e sk); stabilizerness to β = Θ(log(1/ε)/sk) for ε-close-to-commuting Hamiltonians; and a zero-free disk of radius Θ(1/(s√k)) implying exponential correlation decay for geometrically local models (resolving Harrow–Mehraban–Soleimanifar) and poly-time classical estimation of log Z and local expectations. Matching upper bounds and explicit constructions are given in the appendices.
Significance. If correct, this is a substantial advance in high-temperature quantum statistical mechanics and quantum algorithms. It tightens and extends Bakshi et al. (FOCS’24) from low-intersection to genuine long-range interactions, places classical preparation below known quantum Gibbs-sampler mixing temperatures, and separates the entanglement, magic, and thermodynamic transitions with matching upper and lower bounds. The defect-repair cluster expansion yielding the √k improvement, the interaction-picture pinning for magic, and the randomized polymer samplers giving polynomial (not quasipolynomial) runtime are technically novel and of independent interest. Open questions (zero-free strips, non-Pauli/fermionic models) are cleanly scoped.
minor comments (5)
- [§2.3, Theorem 2] The constant gap between separability (1/72 sk) and classical preparability (1/(4096 e sk)) is large; a short remark in §2.3 or §6 on whether the algorithmic constant can be brought closer to the information-theoretic one would help readers.
- [§2.1, Definition 2.6] Definition 2.6 (ε-close to commuting) is used heavily; a one-line example computation for TFIM and perturbed toric code next to the definition would make the parameter immediately concrete.
- [Figures 1–2] Figure 1 and Figure 2 are conceptually clear but the axis labels and the precise placement of β_sep vs β_phase could be annotated with the explicit Θ expressions from the theorems.
- [§5.2, Lemma 24] In §5.2 the transcript sampler (repair/birth) is intricate; a short pseudocode block parallel to Algorithm 1 would aid verification.
- [Throughout] Typos/notation: occasional switches between λ_a and c_a for coefficients; “na ¨ıve” spacing; and “Tr” vs “tr” conventions could be restated once in §2.1 for the whole paper.
Circularity Check
No significant circularity: hierarchy of classical-to-quantum thresholds is derived from stated Pauli Hamiltonian assumptions via independent cluster expansions and constructive pinning, with matching upper-bound constructions.
full rationale
The paper proves separability at β = Θ(1/sk), stabilizerness at Θ(log(1/ε)/sk) for ε-close-to-commuting models, a zero-free disk of radius Θ(1/(s√k)), correlation decay, and polynomial-time classical algorithms from Definition 2.3 (and 2.6) via explicit propagator expansions, pinning procedures, polymer/cluster expansions, and Kotecky–Preiss. Thresholds are not fitted to data; lower bounds come from constructive algorithms and series control, while upper bounds are independent entangled/magic/zero constructions in Appendix A (e.g., Theorems 35–38). Citations to BLMT24, HMS20, RFA25, etc. supply background and open questions that the paper resolves with new proofs, not load-bearing uniqueness theorems or smuggled ansatze that force the claimed temperatures. The derivation chain is self-contained mathematical argument under the stated Hamiltonian class; residual risk is ordinary proof-error risk, not circularity.
Axiom & Free-Parameter Ledger
axioms (5)
- domain assumption Finite-dimensional quantum statistical mechanics: Gibbs state ρ_β = e^{-βH}/Tr(e^{-βH}) and complex partition function Z(z)=Tr(e^{-zH}).
- domain assumption Hamiltonians are Pauli strings with |supp(P_a)|≤k and max_x Σ_{a∋x}|c_a|≤s ((s,k)-long-range).
- standard math Kotecký–Preiss criterion for absolute convergence of abstract polymer/cluster expansions.
- ad hoc to paper ε-close to commuting quantified by infimum of w_pert/(w_free+w_pert) over H=H_0+V decompositions with pairwise-commuting free part.
- standard math Separability and STAB_n as convex hulls of product states and pure stabilizer states.
invented entities (3)
-
Hermitian monomials and iterative pinning configurations for separable decompositions
no independent evidence
-
Interaction-picture propagator U_S and activity Φ_S for nearly-commuting magic proofs
no independent evidence
-
Defect-repair polymer transcripts for √k-improved cluster expansions
no independent evidence
Cite this review
Pith. "Pith review of When quantum thermal states look classical." pith.science (2026). https://pith.science/paper/VVE6HFW2
@misc{pith2026260728536,
author = {Pith},
title = {Pith review of: When quantum thermal states look classical},
year = {2026},
howpublished = {\url{https://pith.science/paper/VVE6HFW2}},
note = {Machine review of arXiv:2607.28536}
}
read the original abstract
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. This leads to polynomial-time classical algorithms for estimating thermal expectations despite both entanglement and magic, and the resolution of a correlation decay conjecture of Harrow, Mehraban and Soleimanifar (STOC'20).
Figures
Reference graph
Works this paper leans on
-
[7]
[CRC+25] Hongrui Chen, Cambyse Rouz ´e, Jielun Chen, Jiaqing Jiang, Samuel O Scalet, Yongtao Zhan, Garnet Kin Chan, Lexing Ying, and Yu Tong. Convergence of the cumulant ex- pansion and polynomial-time algorithm for weakly interacting fermions.arXiv preprint arXiv:2512.12010,
-
[10]
[RW24] Joel Rajakumar and James D Watson. Gibbs sampling gives quantum advantage at constant temperatures witho(1)-local hamiltonians.arXiv preprint arXiv:2408.01516,
-
[11]
[ˇSMBB25] ˇStˇep´an ˇSm´ıd, Richard Meister, Mario Berta, and Roberto Bondesan. Rapid mixing of quantum gibbs samplers for weakly-interacting quantum systems.arXiv preprint arXiv:2510.04954,
-
[13]
[TKG24] Xin-Hai Tong, Tomotaka Kuwahara, and Zongping Gong. Locally interacting lattice bosons: Clustering theorem, low-density condition and their applications.arXiv preprint arXiv:2411.10759,
-
[14]
[YL23] Chao Yin and Andrew Lucas. Polynomial-time classical sampling of high-temperature quan- tum gibbs states.arXiv preprint arXiv:2305.18514,
-
[15]
Polynomial-time approximation of zero-free partition functions.arXiv preprint arXiv:2201.12772,
[YYZ22] Penghui Yao, Yitong Yin, and Xinyuan Zhang. Polynomial-time approximation of zero-free partition functions.arXiv preprint arXiv:2201.12772,
-
[17]
[Zlo26] Alexander Zlokapa. A rigorous quasipolynomial-time classical algorithm for syk thermal expectations.arXiv preprint arXiv:2604.21089,
-
[2006]
[RCTJ25] Akshar Ramkumar, Yiyi Cai, Yu Tong, and Jiaqing Jiang. High-temperature fermionic gibbs states are mixtures of gaussian states.arXiv preprint arXiv:2505.09730,
-
[2014]
Approximating permanents and hafnians.arXiv preprint arXiv:1601.07518,
[Bar16a] Alexander Barvinok. Approximating permanents and hafnians.arXiv preprint arXiv:1601.07518,
-
[2016]
[Bar18] Alexander Barvinok. Approximating real-rooted and stable polynomials, with combinatorial applications.arXiv preprint arXiv:1806.07404,
-
[2018]
Quantum spin chains thermalize at all tempera- tures.arXiv preprint arXiv:2510.08533,
[BC25] Thiago Bergamaschi and Chi-Fang Chen. Quantum spin chains thermalize at all tempera- tures.arXiv preprint arXiv:2510.08533,
-
[2021]
[TK25] Xin-Hai Tong and Tomotaka Kuwahara. Long-range bosonic systems at thermal equilibrium: Computational complexity and clustering of correlations.arXiv preprint arXiv:2509.25572,
-
[2022]
Syk thermal expectations are classically easy at any temperature.arXiv preprint arXiv:2602.22619,
[ZK26] Alexander Zlokapa and Bobak T Kiani. Syk thermal expectations are classically easy at any temperature.arXiv preprint arXiv:2602.22619,
-
[2023]
Computing the partition function for cliques in a graph.arXiv preprint arXiv:1405.1974,
[Bar14] Alexander Barvinok. Computing the partition function for cliques in a graph.arXiv preprint arXiv:1405.1974,
Pith/arXiv arXiv 1974
-
[2024]
[BLMT25] Ainesh Bakshi, Allen Liu, Ankur Moitra, and Ewin Tang. A dobrushin condition for quantum markov chains: Rapid mixing and conditional mutual information at high temperature.arXiv preprint arXiv:2510.08542,
-
[2025]
Quantum gibbs states are locally markovian.arXiv preprint arXiv:2504.02208,
[CR25] Chi-Fang Chen and Cambyse Rouz ´e. Quantum gibbs states are locally markovian.arXiv preprint arXiv:2504.02208,
-
[2026]
[RRSCA26] Paul Rosa-Ruiz, Matteo Scandi, ´Angela Capel, and ´Alvaro M Alhambra. Static features from mixing in short-and long-range lindbladians: Markov property and correlations.arXiv preprint arXiv:2606.28054,
This paper was first reviewed by grok-4.5 on July 31, 2026.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.