2011
DOI: 10.1103/physrevlett.106.050502
|View full text |Cite
|
Sign up to set email alerts
|

Does Adiabatic Quantum Optimization Fail for NP-Complete Problems?

Abstract: It has been recently argued that adiabatic quantum optimization would fail in solving NP-complete problems because of the occurrence of exponentially small gaps due to crossing of local minima of the final Hamiltonian with its global minimum near the end of the adiabatic evolution. Using perturbation expansion, we analytically show that for the NP-hard problem of maximum independent set there always exist adiabatic paths along which no such crossings occur. Therefore, in order to prove that adiabatic quantum o… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
58
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 61 publications
(58 citation statements)
references
References 16 publications
0
58
0
Order By: Relevance
“…2a and further described in the Methods section and Supplementary Note 1. The same type of anticrossing has been argued 28,29 to render QA ineffective because of the extremely small g min , though methods have been proposed to eliminate such anticrossings [30][31][32] .…”
Section: Resultsmentioning
confidence: 99%
“…2a and further described in the Methods section and Supplementary Note 1. The same type of anticrossing has been argued 28,29 to render QA ineffective because of the extremely small g min , though methods have been proposed to eliminate such anticrossings [30][31][32] .…”
Section: Resultsmentioning
confidence: 99%
“…More generally, it has proven difficult to predict the run times of particular problem instances due to the complexity of the underlying quantum dynamics. An essential step in understanding these behaviors is to capture the influence that different programming choices have on observed run times [7,30,29,31,32,33,34,35,36]. A significant source of the complexity in analyzing implementations of the AQO algorithm arises from the multiple steps undertaken to synthesize the adiabatic quantum program.…”
Section: Introductionmentioning
confidence: 99%
“…The relation between adiabatic quantum evolution and quantum phase transitions is an ongoing topic of research [11,12]. Also, recently the statistics and scaling of energy gaps between the ground state and excited states-which form the limiting factor for the efficiency of adiabatic quantum computation-as well as the role played by the choice of H final have been investigated [13][14][15].…”
Section: Introductionmentioning
confidence: 99%