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 条
  • [1] Different adiabatic quantum optimization algorithms for the NP-complete exact cover and 3SAT problems
    Choi, Vicky
    Quantum Information and Computation, 2011, 11 (7-8): : 638 - 648
  • [2] DIFFERENT ADIABATIC QUANTUM OPTIMIZATION ALGORITHMS FOR THE NP-COMPLETE EXACT COVER AND 3SAT PROBLEMS
    Choi, Vicky
    QUANTUM INFORMATION & COMPUTATION, 2011, 11 (7-8) : 638 - 648
  • [3] Ultrafast adiabatic quantum algorithm for the NP-complete exact cover problem
    Hefeng Wang
    Lian-Ao Wu
    Scientific Reports, 6
  • [4] Ultrafast adiabatic quantum algorithm for the NP-complete exact cover problem
    Wang, Hefeng
    Wu, Lian-Ao
    SCIENTIFIC REPORTS, 2016, 6
  • [5] Does Adiabatic Quantum Optimization Fail for NP-Complete Problems?
    Dickson, Neil G.
    Amin, M. H. S.
    PHYSICAL REVIEW LETTERS, 2011, 106 (05)
  • [6] An adiabatic quantum optimization for exact cover 3 problem
    Zhang Ying-Yu
    Xu Li-Li
    Li Jun-Qing
    CHINESE PHYSICS B, 2014, 23 (03)
  • [7] An adiabatic quantum optimization for exact cover 3 problem
    张映玉
    许丽莉
    李俊青
    Chinese Physics B, 2014, 23 (03) : 143 - 145
  • [8] 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
  • [9] Exponential complexity of an adiabatic algorithm for an NP-complete problem
    Znidaric, M
    Horvat, M
    PHYSICAL REVIEW A, 2006, 73 (02):
  • [10] QUANTUM COMPUTING ALGORITHMS FOR INVERSE PROBLEMS ON GRAPHS AND AN NP-COMPLETE INVERSE PROBLEM
    Ilmavirta, Joonas
    Lassas, Matti
    Lu, Jinpeng
    Oksanen, Lauri
    Ylinen, Lauri
    arXiv, 2023,