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
atarateeλ θproportionaltotheiroriginalseparation θ.WecanexploitthisbehaviortosolveNPproblemsifwebeginwithanordinaryquantumcomputer(i.e.,onethatcanperformtheusualquantumlogicoperationssuchascontrolledrotationgates)andusethealgorithmdescribedbelow:
Step1.Beginbyperformingaπ/2rotationoneachofthe rstnqubitstoobtainthestate
1
2nn2 1 ψ=
i=0|i,0 (1)
Step2.Usetheoracle(onlyonce)tocalculatef(i):
2 11 |i,f(i) 2n
i=0nψ=(2)
Step3.Reversetheπ/2rotationoneachofthe rstnqubits.Eachstate|i>thenmapsintoasuperpositionoverallpossible|i>,withamplitude±1.In2n
ofitsamplitudetothestate|00...0>,particular,eachstate|i>contributes+1
2n
nforatotalcontributionofamplitude122ofthese
statescorrespondtoaparticularvalueoff(i)=a,andthusthestate|00....0,a>hasamplitudeatleast1/2.Ameasurementonthe rstnqubitswillthereforeyieldthestate|00...0>withprobabilityatleast1/4.Thesystemwillthenbeinthestate
ψ=2n
|00..0 22n 2n+1s+2s2 2n s |1 (3)2n
wheresisthenumberofsolutionsiforwhichf(i)=1.Thelastqubitnowcontainsalltheinformationthatweneed;however,forsmalls,ameasurementofthelastqubitwillalmostalwaysreturn|0>,yieldingnoinformation.Wewishtodistinguishbetweenthecasess=0ands>0.
Step4.Repeatedlyapplythenonlinearoperationtodrivethestatesrep-resentingthesetwocasesapartatanexponentialrate:eventually,atatimedeterminedbyapolynomialfunctionofthenumberofqubitsn,thenumberofsolutionss,andtherateofspreading(Lyapunovexponent)λ,thetwocaseswillbecomemacroscopicallydistinguishable.
Step5.Makeameasurementonthelastqubittodeterminethesolution.Iftheangularextentofthenonlinearregionissmall,itmaybenecessarytorepeatthealgorithmseveraltimesinordertodeterminethesolutionwithhighprobability.Ingeneral,thealgorithmwillrequireO((π/η)2)trials,whereηistheangularextentofthenonlinearregion.Ifηissu cientlylarge,theoraclemayneedtobecalledonlyonce.
Tosolveproblemsintheclass#P,weneedtodeterminetheexactnumberofsolutionss.Thisisapproximatelyfoundbycountingthenumberoftimesthat
3
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 最大子...
热门文档