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 条
  • [1] Ultrafast adiabatic quantum algorithm for the NP-complete exact cover problem
    Hefeng Wang
    Lian-Ao Wu
    Scientific Reports, 6
  • [2] Ultrafast adiabatic quantum algorithm for the NP-complete exact cover problem
    Wang, Hefeng
    Wu, Lian-Ao
    SCIENTIFIC REPORTS, 2016, 6
  • [3] A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
    Farhi, E
    Goldstone, J
    Gutmann, S
    Lapan, J
    Lundgren, A
    Preda, D
    SCIENCE, 2001, 292 (5516) : 472 - 476
  • [4] Solving NP-Complete Problem Using ACO Algorithm
    Asif, Muhammad
    Baig, Rauf
    ICET: 2009 INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES, PROCEEDINGS, 2009, : 13 - 16
  • [5] ON ONE NP-COMPLETE PROBLEM
    DEMEL, J
    DEMLOVA, M
    KYBERNETIKA, 1995, 31 (02) : 207 - 211
  • [6] AN NP-COMPLETE MATCHING PROBLEM
    PLAISTED, DA
    ZAKS, S
    DISCRETE APPLIED MATHEMATICS, 1980, 2 (01) : 65 - 72
  • [7] The STO problem is NP-complete
    Krysta, P
    Pacholski, L
    JOURNAL OF SYMBOLIC COMPUTATION, 1999, 27 (02) : 207 - 219
  • [8] Generic complexity of NP-complete problems
    GROUP-BASED CRYPTOGRAPHY, 2008, : 129 - 134
  • [9] Different adiabatic quantum optimization algorithms for the NP-complete exact cover problem
    Choi, Vicky
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2011, 108 (07) : E19 - E20
  • [10] A simplified NP-complete MAXSAT problem
    Raman, V
    Ravikumar, B
    Rao, SS
    INFORMATION PROCESSING LETTERS, 1998, 65 (01) : 1 - 6
12345