文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problem
侵权投诉

Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problem

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

上一页第3页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email