Simulated quantum annealing can be exponentially faster than classical simulated annealing

DOI10.1109/FOCS.2016.81MaRDI QIDQ6946425zbMATH OpenFDO

Authors Elizabeth Crosson, Aram W. Harrow

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2016.81

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

This page was built for publication: Simulated quantum annealing can be exponentially faster than classical simulated annealing

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