If quantum states exhibit small nonlinearities during time evolution, then quantum computers can be used to solve NP-complete problems in polynomial time. We provide algorithms that solve NP-complete and #P oracle problems by exploiting nonlinear quantum l
1[|00 +|11 ] →|00 2
1[|01 +|10 ] →|01 (b)2
11(c)[|00 +|10 ] →2(a)(9)
√
√
√
√
√
√
Nonlinear quantum mech... 暂无评价 10页 免费 NP-Complete Problems 50页 ...solution for a given input can be checked quickly(in polynomial time) to ...
Lagrangian Techniques for NP-Complete Problems ...nonlinear equations de ned by (8)-(10) with ...from a 3SAT problem by a polynomial time ...
Nonlinear quantum mech... 暂无评价 10页 免费 喜欢此文档的还喜欢 23-NPComplete 22页 免费 The IASLC Lung Cancer ... 暂无评价 10页 免费 ACM 最大子...
79 2586–2589, 1997 [2] Abrams D S and Lloyd S, Non-Linear Quantum Mechanics implies Polynomial Time solution for NP-complete and #P problems, http...
Nonlinear quantum mech... 暂无评价 10页 免费 喜欢此文档的还喜欢 23-NPComplete 22页 免费 The IASLC Lung Cancer ... 暂无评价 10页 免费 ACM 最大子...
热门文档