Quantum Adiabatic Algorithms, Small Gaps, and Different Paths

Quantum Adiabatic Algorithms, Small Gaps, and Different Paths

We construct a set of instances of 3SAT which are not solved efficiently using the simplestquantum adiabatic algorithm. These instances are obtained by picking randomclauses all consistent with two disparate planted solutions and then penalizing one ofthem with a single additional clause. We argue t...

Full description

Bibliographic Details
Main Authors: Farhi, Edward, Goldstone, Jeffrey, Gosset, David Nicholas, Gutmann, Sam, Meyer, Harvey B., Shor, Peter W.
Other Authors: Massachusetts Institute of Technology. Center for Theoretical Physics
Format: Article
Language:en_US
Published: Rinton Press 2014
Online Access:http://hdl.handle.net/1721.1/88411
https://orcid.org/0000-0002-7309-8489
https://orcid.org/0000-0003-4626-5648

Internet

http://hdl.handle.net/1721.1/88411
https://orcid.org/0000-0002-7309-8489
https://orcid.org/0000-0003-4626-5648

Similar Items