Cargando…
Quantum Adiabatic Algorithms, Small Gaps, and Different Paths
We construct a set of instances of 3SAT which are not solved efficiently using the simplest quantum adiabatic algorithm. These instances are obtained by picking random clauses all consistent with two disparate planted solutions and then penalizing one of them with a single additional clause. We argu...
| Autores principales: | , , , , , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
2009
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/1209228 |