Mixing time of quantum Gibbs sampling for random sparse Hamiltonians

DOI10.4230/LIPICS.TQC.2025.3MaRDI QIDQ7313316zbMATH OpenFDO

Authors Akshar Ramkumar, Mehdi Soleimanifar

Publication date 12 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.TQC.2025.3

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Cites work

• An introduction to matrix concentration inequalities
• Exponential algorithmic speedup by a quantum walk
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Improvements in quantum SDP-solving with applications
• Lower bounds to the spectral gap of Davies generators
• Quantum algorithm for simulating real time evolution of lattice Hamiltonians
• Quantum SDP solvers: large speed-ups, optimality, and applications to quantum learning
• Quantum speed-ups for solving semidefinite programs
• Sparse regular random graphs: spectral density and eigenvectors
• Spectral form factor of a quantum spin glass
• Szegedy walk unitaries for quantum maps

This page was built for publication: Mixing time of quantum Gibbs sampling for random sparse Hamiltonians

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7313316)