Literature DB >> 21405383

Does adiabatic quantum optimization fail for NP-complete problems?

Neil G Dickson1, M H S Amin.   

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 known as maximum independent set, there always exist adiabatic paths along which no such crossings occur. Therefore, in order to prove that adiabatic quantum optimization fails for any NP-complete problem, one must prove that it is impossible to find any such path in polynomial time.

Year:  2011        PMID: 21405383     DOI: 10.1103/PhysRevLett.106.050502

Source DB:  PubMed          Journal:  Phys Rev Lett        ISSN: 0031-9007            Impact factor:   9.161


  2 in total

1.  Digital quantum simulation of the statistical mechanics of a frustrated magnet.

Authors:  Jingfu Zhang; Man-Hong Yung; Raymond Laflamme; Alán Aspuru-Guzik; Jonathan Baugh
Journal:  Nat Commun       Date:  2012-06-06       Impact factor: 14.919

2.  Thermally assisted quantum annealing of a 16-qubit problem.

Authors:  N G Dickson; M W Johnson; M H Amin; R Harris; F Altomare; A J Berkley; P Bunyk; J Cai; E M Chapple; P Chavez; F Cioata; T Cirip; P Debuen; M Drew-Brook; C Enderud; S Gildert; F Hamze; J P Hilton; E Hoskinson; K Karimi; E Ladizinsky; N Ladizinsky; T Lanting; T Mahon; R Neufeld; T Oh; I Perminov; C Petroff; A Przybysz; C Rich; P Spear; A Tcaciuc; M C Thom; E Tolkacheva; S Uchaikin; J Wang; A B Wilson; Z Merali; G Rose
Journal:  Nat Commun       Date:  2013       Impact factor: 14.919

  2 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.