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
thenonlinearoperatorwasapplied.Todeterminesexactly,oneproceedswith nerand nerestimatesbyrotatingthe nalqubitsuchthatthecurrentbestestimateiscenteredinthenonlinearregion;inthisway,applyingthenonlinearoperatorseparatesstateswithsnearthisvaluesothattheyaredistinguishable.Withonlyapolynomialnumberofiterations,onedeterminesthevaluesex-actly.Thepreviousalgorithmcanthereforebyusedtosolvearbitraryproblems(includingoracleprobems)intheclass#Paswell.
Theabovealgorithmhasonedisadvantageinthatitrequiresexponentialprecision.Wedescribebelowanotheralgorithm,which(atleastinthecaseoftheWeinbergmodel)appearstoberobustagainstsmallerrors.Inordertosimplifythedescription,weassume(fornow)thatthereisatmostasinglevaluexforwhichf(x)=1.Webeginasbeforewithaquantumcomputerthatcanperformtheusualquantumlogicoperations,andthatcaninadditionperformasimplenonlinearoperatorwhoseformwillbedescribedbelow.Weconceptuallydividethequbitsintoninputqubits(representingtheinput,anintegerbetween0and2n 1)andone agqubit.Inordertosolvethestatedoracleproblem,weusethefollowingalgorithm:
Step1.Webeginbyperformingaπ/2rotationoneachofthe rstnqubitstoobtainthestate
2 11 |i,0 2n
i=0nψ=(4)
Step2.Usethe rstNqubitsastheinputtotheoracleandstoretheoutputinthe(N+1)stqubit(the agqubit).(Notethatthisistheonlytimethatthealgorithmneedstocalltheoracle;hence,werequireonly1evaluationofthefunction.)Thesystemisnowinthestate
1
2nn2 1 ψ=
i=0|i,f(i) (5)
Step3.Considerthe rstqubitseparately,andgroupallthestatesofthesuperpositionintopairsbasedonthevalueofqubits2..n.Thatis,thequbits
2..nde ne2n 1subspacesofdimension4=(2dimensionsforqubit1)*(2dimensionsforthe agqubit).Withineachsubspace,thecomputerwillbeinoneofthefollowingstates(wherewewritethevalueofthe rstqubitfollowedbythevalueofthe agqubit,andignorethenormalizationconstants):
(a)|00 +|11
(b)|01 +|10
(c)|00 +|10 (6)
(Atthestartofthecomputation,mostofthesuperpositionwillbeinthethirdstate,becausethe agqubitis|1>inatmostonly1ofthe2ncomponents.)
4
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 最大子...
热门文档