REVIEW 4 cited by
Mixing time of quantum Gibbs sampling for random sparse Hamiltonians
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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 by Chen, Kastoryano, and Gily\'en 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 by 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.
Forward citations
Cited by 4 Pith papers
-
Localised Davies generators for (pseudo)differential operators
The authors extend the Chen-Kastoryano-Gilyen localized Davies generator construction to unbounded pseudodifferential operators in the semiclassical limit.
-
Fast mixing of weakly interacting fermionic systems at any temperature
Weakly interacting fermionic lattice systems have a constant spectral gap in a Gibbs sampler Lindbladian, giving O(n) mixing time and efficient quantum Gibbs state preparation at any fixed temperature.
-
Fullqubit alchemist: Quantum algorithm for alchemical free energy calculations
A quantum algorithm for alchemical free energy calculations that block-encodes the Liouvillian to simulate molecular dynamics with polylogarithmic precision scaling, avoiding entropy estimation.
-
Lindblad engineering for quantum Gibbs state preparation under the eigenstate thermalization hypothesis
A simplified Lindblad-based Gibbs state preparation protocol with local Pauli jumps is shown to mix polynomially under the eigenstate thermalization hypothesis, with numerical and noise-resilience analysis.
Discussion (0). Continue with ORCID to comment.