Different adiabatic quantum optimization algorithms for the NP-complete exact cover problem

被引：19

作者：

Choi, Vicky ^{[1
]}

机构：

[1] Virginia Polytech Inst & State Univ, Dept Comp Sci, Falls Church, VA 22043 USA

来源：

关键词：

D O I：

10.1073/pnas.1018310108

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

引用

页码：E19 / E20

页数：2

共 50 条

[31] THE EDGE HAMILTONIAN PATH PROBLEM IS NP-COMPLETE
BERTOSSI, AA
INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) : 157 - 159
[32] RECTILINEAR STEINER TREE PROBLEM IS NP-COMPLETE
GAREY, MR
JOHNSON, DS
SIAM JOURNAL ON APPLIED MATHEMATICS, 1977, 32 (04) : 826 - 834
[33] The maximum edge biclique problem is NP-complete
Peeters, R
DISCRETE APPLIED MATHEMATICS, 2003, 131 (03) : 651 - 654
[34] 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
[35] The rectilinear Steiner arborescence problem is NP-complete
Shi, WP
Su, C
SIAM JOURNAL ON COMPUTING, 2006, 35 (03) : 729 - 740
[36] 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
[37] Solving NP-Complete problems with quantum search
Furer, Martin
LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 784 - 792
[38] Quantum advantage in deciding NP-complete problems
Nagy, Marius
Nagy, Naya
QUANTUM INFORMATION PROCESSING, 2023, 22 (03)
[39] Quantum advantage in deciding NP-complete problems
Marius Nagy
Naya Nagy
Quantum Information Processing, 22
[40] 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