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...
Main Authors: | Farhi, Edward (Contributor), Goldstone, Jeffrey (Contributor), Gosset, David Nicholas (Contributor), Gutmann, Sam (Author), Meyer, Harvey B. (Contributor), Shor, Peter W. (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Center for Theoretical Physics (Contributor), Massachusetts Institute of Technology. Department of Mathematics (Contributor), Massachusetts Institute of Technology. Department of Physics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Rinton Press,
2014-07-15T13:36:37Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Unstructured randomness, small gaps and localization
by: Farhi, Edward, et al.
Published: (2011) -
Performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs
by: Farhi, Edward, et al.
Published: (2013) -
A Quantum Monte Carlo method at fixed energy
by: Farhi, Edward, et al.
Published: (2016) -
Case studies in quantum adiabatic optimization
by: Gosset, David (David Nicholas)
Published: (2012) -
Quantum transverse-field Ising model on an infinite tree from matrix product states
by: Nagaj, Daniel, et al.
Published: (2010)