



@article {3185,
	title = {Lower Bounds on Quantum Annealing Times},
	journal = {Phys. Rev. Lett.},
	volume = {130},
	year = {2023},
	month = {4/5/2023},
	abstract = {<p>The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our bounds demonstrate that these schedules have optimal scaling. Our results also show that rapid annealing requires coherent superpositions of energy eigenstates, singling out quantum coherence as a computational resource.</p>},
	keywords = {FOS: Physical sciences, Quantum Physics (quant-ph)},
	doi = {https://doi.org/10.1103/PhysRevLett.130.140601},
	url = {https://arxiv.org/abs/2210.15687},
	author = {Garc{\'\i}a-Pintos, Luis Pedro and Brady, Lucas T. and Bringewatt, Jacob and Liu, Yi-Kai}
}
