Bottlenecks in Quantum Channels and Finite Temperature Phases of Matter
Physical Review Letters American Physical Society (APS) 137:5 (2026) 050402
Abstract:
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.Efficient quantum thermal state preparation via local driving: Lindbladian simulation with provable guarantees
Physical Review B American Physical Society (APS) 114:1 (2026) 14302
Abstract:
<jats:p> Preparing the thermal density matrix <a:math xmlns:a="http://www.w3.org/1998/Math/MathML"> <a:mrow> <a:msub> <a:mi>ρ</a:mi> <a:mi>β</a:mi> </a:msub> <a:mo>∝</a:mo> <a:msup> <a:mi>e</a:mi> <a:mrow> <a:mo>−</a:mo> <a:mi>β</a:mi> <a:mi>H</a:mi> </a:mrow> </a:msup> </a:mrow> </a:math> corresponding to a given Hamiltonian <b:math xmlns:b="http://www.w3.org/1998/Math/MathML"> <b:mi>H</b:mi> </b:math> is a task of central interest across quantum many-body physics, and is particularly salient when attempting to study it with quantum computers. Although solved in principle by recent constructions of efficiently simulable Lindblad master equations—that provably have <c:math xmlns:c="http://www.w3.org/1998/Math/MathML"> <c:msub> <c:mi>ρ</c:mi> <c:mi>β</c:mi> </c:msub> </c:math> as a steady state [C.-F. Chen , ]—the implementation of these “exact Gibbs samplers” requires large-scale quantum computing resources and is hence challenging in practice on current or even near-term quantum devices. Here, we propose a scheme for approximately simulating an exact Gibbs sampler up to a rigorously bounded error that only requires the (repeated) implementation of three readily available ingredients: (a) analog simulation of <d:math xmlns:d="http://www.w3.org/1998/Math/MathML"> <d:mi>H</d:mi> </d:math> ; (b) strictly local but time-dependent couplings to ancilla qubits; and (c) reset of the ancillas. We give rigorous guarantees on the difference between the fixed point reached by our protocol and the exact thermal state, which only depend on parameters of the protocol and its . The procedure is efficiently implementable on near-term devices if <e:math xmlns:e="http://www.w3.org/1998/Math/MathML"> <e:mi>H</e:mi> </e:math> is local and the mixing time scales mildly with both system size and protocol parameters. While guaranteeing the latter for Hamiltonians of interest remains an important problem for future work, here we lay the groundwork for developing fully efficient thermal state preparation protocols on quantum simulators. </jats:p>Solvable quantum circuits in tree+1 dimensions
PRX Quantum American Physical Society 6:4 (2025) 040316
Abstract:
We devise tractable models of unitary quantum many-body dynamics on tree graphs, as a first step toward a deeper understanding of dynamics in non-Euclidean spaces. To this end, we first demonstrate how to construct strictly local quantum circuits that preserve the symmetries of trees, such that their dynamical light cones grow isotropically. For trees with coordination number 𝑧, such circuits can be built from 𝑧-site gates. We then introduce a family of gates for which the dynamics are exactly solvable; these satisfy a set of constraints that we term “tree-unitarity.” Notably, tree-unitarity reduces to the previously established notion of dual-unitarity for 𝑧 =2, when the tree reduces to a line. Among the unexpected features of tree-unitarity is a trade-off between “maximum butterfly velocity” dynamics of out-of-time-order correlators and the existence of nonvanishing correlation functions in multiple directions, a tension absent in one-dimensional dual-unitary models and their Euclidean generalizations. We connect the existence of (a wide class of) solvable dynamics with nonmaximal butterfly velocity directly to a property of the underlying circuit geometry called 𝛿-hyperbolicity, and argue that such dynamics can only arise in non-Euclidean geometries. We give various examples of tree-unitary gates, discuss dynamical correlations, out-of-time-order correlators, and entanglement growth, and show that the kicked Ising model on a tree is a physically motivated example of maximum-velocity tree-unitary dynamics.Two-Peak Heat Capacity Accounts for Rln(2) Entropy and Ground State Access in the Dipole-Octupole Pyrochlore Ce2Hf2O7
Physical Review Letters American Physical Society (APS) 135:8 (2025) 086702