quantum information theory

When quantum thermal states look classical

arXiv:2607.28536

summary

The paper analyzes how quantum Gibbs states retain classical properties such as lack of entanglement and magic at finite temperatures, establishing a hierarchy of classical‑to‑quantum transitions for long‑range Pauli models and providing polynomial‑time classical algorithms to prepare and sample these states.

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).

97 pages, 3 figures

Topics & keywords

#quantum thermal states#entanglement transition#classical simulation#Gibbs sampling#long-range interactionsGibbs statePauli interactionsentanglement deathmagiccorrelation decaypolynomial-time algorithm