Scaling of the running time of the quantum adiabatic algorithm for propositional satisfiability
Journal Article
·
· Physical Review. A
- Physics Department, Faculty of Mathematics and Physics, University of Ljubljana, SI-1111 Ljubljana (Slovenia) and Department of Quantum Physics, University of Ulm, D-89069 Ulm (Germany)
We numerically study the quantum adiabatic algorithm for propositional satisfiability. A new class of previously unknown hard instances is identified among random problems. We numerically find that the running time for such instances grows exponentially with their size. The worst case complexity of the quantum adiabatic algorithm therefore seems to be exponential.
- OSTI ID:
- 20717870
- Journal Information:
- Physical Review. A, Vol. 71, Issue 6; Other Information: DOI: 10.1103/PhysRevA.71.062305; (c) 2005 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
- Country of Publication:
- United States
- Language:
- English
Similar Records
On the average-case complexity of satisfiability algorithms
Adiabatic quantum computing for random satisfiability problems
Eigenlevel statistics of the quantum adiabatic algorithm
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:20717870
Adiabatic quantum computing for random satisfiability problems
Journal Article
·
Sat Feb 01 00:00:00 EST 2003
· Physical Review. A
·
OSTI ID:20717870
Eigenlevel statistics of the quantum adiabatic algorithm
Journal Article
·
Tue Nov 15 00:00:00 EST 2005
· Physical Review. A
·
OSTI ID:20717870