Exponential complexity of an adiabatic algorithm for an NP-complete problem
Quantum Physics
2009-11-11 v3
Abstract
We prove an analytical expression for the size of the gap between the ground and the first excited state of quantum adiabatic algorithm for the 3-satisfiability, where the initial Hamiltonian is a projector on the subspace complementary to the ground state. For large problem sizes the gap decreases exponentially and as a consequence the required running time is also exponential.
Keywords
Cite
@article{arxiv.quant-ph/0509162,
title = {Exponential complexity of an adiabatic algorithm for an NP-complete problem},
author = {Marko Znidaric and Martin Horvat},
journal= {arXiv preprint arXiv:quant-ph/0509162},
year = {2009}
}
Comments
5 pages, 2 figures; v3. published version