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(a)=
ω2(a)=
Fornonlinearh(a)h(a)′′(19)(20)
h(a).Thus
|0 →cos(φ)|0 sin(φ)|1 →αcos(φ)|0 βsin(φ)|1 (23)|1 →sin(φ)|0 +cos(φ)|1 →γcos(φ)|0 +δsin(φ)|1 (24)whereα,β,γandδarephasefactors.Becausetheinitialamplitudesofthebasisstatesaredi erentinthetwocases,thenonlinearHamiltonianwillcausethecomponentstoevolveatdi erentfrequencies.Aslongasthesefrequenciesareincommensurate,thereisatimetatwhichα=γ=δ=1andβ=-1(towithinanaccuracyε).(Further,thistimetisapolynomialfunctionofthedesiredaccuracyε.)Thenetresultofthesetwostepsisthen
|0 →cos(φ)|0 +sin(φ)|1 (25)|1 →sin(φ)|0 +cos(φ)|1
Step3.Reversethe rststep.Thus(26)
|0 →cos(2φ)|0 +sin(2φ)|1 |1 →|1 (27)(28)
Essentially,wehavereducedtheanglebetweenthetwostatesbyanamount2φ.Bysuitablerepetitionofthisprocedure(thatis,bychoosingφappropriatelyforeachiteration),orsimplybychoosingφpreciselyinthe rststep,thestates|0>and|1>canbemappedtowithinεofthestate|0>,inanamountoftimewhichisapolynomialfunctionofthedesiredaccuracy.Thisisthedesiredbehaviorforthenonlineargaten .Theprocedurecanbemodi edslightly
8
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 最大子...
热门文档