aiqbench analysis
This research introduces a walk-free quantum algorithm that achieves quadratic acceleration in spectral-gap dependence for preparing purified Gibbs states, addressing a key bottleneck beyond specialized cases. By factorizing the parent Hamiltonian into noncommutative first-order operators, the method transforms state preparation into a singular-value filtering problem suitable for broader quantum Gibbs samplers. The work also identifies specific models where standard refinement requires exponential time, highlighting scenarios where this new approach delivers an end-to-end speedup over classical mixing scales.
Accelerating quantum Gibbs sampling without quantum walks
arXiv:2604.22996v2 Announce Type: replace Abstract: Szegedy's quantum walk quadratically accelerates reversible classical Markov chains, but extending this mechanism to efficiently implementable quantum Gibbs samplers has remained challenging beyond special classes. We present a walk-free quantum algorithm for preparing purified Gibbs states with a quadratic improvement in spectral-gap dependence for a broad class of quantum Gibbs samplers that satisfy exact Kubo-Martin-Schwinger detailed balance. Our main structural result is an explicit factorization of the corresponding parent Hamiltonian into noncommutative first-order operators. This turns purified Gibbs-state preparation into a singular-value filtering problem and enables a quantum singular value transformation algorithm with quadratically improved gap dependence under standard coherent-access and warm-start assumptions. The framework applies to several efficiently implementable Gibbs samplers beyond the Davies setting. Moreover, we construct noncommuting Hamiltonians with efficiently preparable warm starts whose refinement under quantum Gibbs samplers requires exponential time. For these models, our algorithm achieves an end-to-end quantum speedup over the worst-case mixing scale.
Abstract:Szegedy's quantum walk quadratically accelerates reversible classical Markov chains, but extending this mechanism to efficiently implementable quantum Gibbs samplers has remained challenging beyond special classes. We present a walk-free quantum algorithm for preparing purified Gibbs states with a quadratic improvement in spectral-gap dependence for a broad class of quantum Gibbs samplers that satisfy exact Kubo-Martin-Schwinger detailed balance. Our main structural result is an explicit factorization of the corresponding parent Hamiltonian into noncommutative first-order operators. This turns purified Gibbs-state preparation into a singular-value filtering problem and enables a quantum singular value transformation algorithm with quadratically improved gap dependence under standard coherent-access and warm-start assumptions. The framework applies to several efficiently implementable Gibbs samplers beyond the Davies setting. Moreover, we construct noncommuting Hamiltonians with efficiently preparable warm starts whose refinement under quantum Gibbs samplers requires exponential time. For these models, our algorithm achieves an end-to-end quantum speedup over the worst-case mixing scale.
Quantum Physics (quant-ph); Mathematical Physics (math-ph); Numerical Analysis (math.NA)
arXiv:2604.22996 [quant-ph]
(or arXiv:2604.22996v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2604.22996 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 248 words
Related coverage

Researchers Bound Spin Chain Mixing Time with Logarithmic Scaling
Quantum Zeitgeist · Oct 4, 2026

Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization
Quantum Journal · Oct 13, 2026
Synthesis Superintelligence: from Semiconductors to Superconductors — Periodic Labs’ Liam Fedus and Ekin Dogus Cubuk
Latent Space · Oct 8, 2026

Top Photonic Quantum Computing Companies
Quantum Zeitgeist · May 27, 2026