How to Make the Quantum Adiabatic Algorithm Fail

Simple item page
dc.creatorFarhi, Edward
dc.creatorGoldstone, Jeffrey
dc.creatorGutmann, Sam
dc.creatorNagaj, Daniel
dc.date2005-12-19
dc.date.accessioned2026-07-07T09:47:15Z
dc.date.available2026-07-07T09:47:15Z
dc.descriptionThe quantum adiabatic algorithm is a Hamiltonian based quantum algorithm designed to find the minimum of a classical cost function whose domain has size N. We show that poor choices for the Hamiltonian can guarantee that the algorithm will not find the minimum if the run time grows more slowly than square root of N. These poor choices are nonlocal and wash out any structure in the cost function to be minimized and the best that can be hoped for is Grover speedup. These failures tell us what not to do when designing quantum adiabatic algorithms.
dc.description12 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0512159
dc.identifierhttp://arxiv.org/abs/quant-ph/0512159
dc.identifierInternational Journal of Quantum Information, Vol. 6, No. 3 (2008), 503-516
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/163810
dc.subjectQuantum Physics
dc.titleHow to Make the Quantum Adiabatic Algorithm Fail
dc.typetext

Files

Collections

arXiv