Exponential complexity of an adiabatic algorithm for an NP-complete problem

被引：54
|
作者：
Znidaric, M [1 ]
Horvat, M
机构：
[1] Univ Ulm, Dept Quantum Phys, D-89069 Ulm, Germany
[2] Univ Ljubljana, Fac Math Phys, Dept Phys, Ljubljana, Slovenia
来源：
PHYSICAL REVIEW A | 2006年 / 73卷 / 02期
关键词：
D O I：
10.1103/PhysRevA.73.022329
中图分类号：
O43 [光学];
学科分类号：
070207 ; 0803 ;
摘要：
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.
引用
收藏
页数：5
相关论文
共 50 条
  • [21] THE EDGE HAMILTONIAN PATH PROBLEM IS NP-COMPLETE
    BERTOSSI, AA
    INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) : 157 - 159
  • [22] RECTILINEAR STEINER TREE PROBLEM IS NP-COMPLETE
    GAREY, MR
    JOHNSON, DS
    SIAM JOURNAL ON APPLIED MATHEMATICS, 1977, 32 (04) : 826 - 834
  • [23] The maximum edge biclique problem is NP-complete
    Peeters, R
    DISCRETE APPLIED MATHEMATICS, 2003, 131 (03) : 651 - 654
  • [24] Timed protocol insecurity problem is NP-complete
    Benerecetti, Massimo
    Peron, Adriano
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2013, 29 (03): : 843 - 862
  • [25] The rectilinear Steiner arborescence problem is NP-complete
    Shi, WP
    Su, C
    SIAM JOURNAL ON COMPUTING, 2006, 35 (03) : 729 - 740
  • [26] Broadcasting with the least energy is an NP-complete problem
    Yang, Wuu
    Tseng, Huei-Ru
    Jan, Rong-Hong
    Shen, Bor-Yeh
    MUE: 2008 INTERNATIONAL CONFERENCE ON MULTIMEDIA AND UBIQUITOUS ENGINEERING, PROCEEDINGS, 2008, : 197 - 200
  • [27] Does Adiabatic Quantum Optimization Fail for NP-Complete Problems?
    Dickson, Neil G.
    Amin, M. H. S.
    PHYSICAL REVIEW LETTERS, 2011, 106 (05)
  • [28] The Rectilinear Steiner Arborescence problem is NP-complete
    Shi, WP
    Su, C
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 780 - 787
  • [29] An NP-complete Problem for the Abelian Sandpile Model
    Schulz, Matthias
    COMPLEX SYSTEMS, 2007, 17 (01): : 17 - 28
  • [30] REDUNDANT CODING OF AN NP-COMPLETE PROBLEM ALLOWS EFFECTIVE GENETIC ALGORITHM SEARCH
    GERRITS, M
    HOGEWEG, P
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 496 : 70 - 74
12345