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: | , , , , , |
---|---|
Other Authors: | , , |
Format: | Article |
Language: | English |
Published: |
Rinton Press,
2014-07-15T13:36:37Z.
|
Subjects: | |
Online Access: | Get fulltext |