文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > 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

ω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

上一页第8页

你可能喜欢

热门文档

相关文档

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