《量子通信》_第07讲 量子算法II 2025-0402-1803.pptxVIP

本讲主要内容

1量子傅里叶变换

2相位估计

3求阶

4Shor算法

5Shor算法实现;

1量子傅里叶变换

[1]MichaelA.NielsenIsaacL.,QuantumComputationandQuantumInformation,CambridgeUniversityPress,2010;

离散傅里叶变换

OnesuchtransformationisthediscreteFouriertransform.Intheusualmathematicalnotation,thediscreteFouriertransformtakesasinputavectorofcomplexnumbers,xo,…,xN-1wherethelengthNofthevectorisafixedparameter.Itoutputsthetransformeddata,avectorofcomplexnumbersyo,…,YN-1,definedby;

量子傅里叶变换;

Inthefollowing,wetakeN=2”,wherenissomeinteger,andthebasis|0),...,|2n-1〉isthecomputationalbasisforannqubitquantumcomputer.Itishelpfultowritethe

statelj)usingthebinaryrepresentationj=jij2…jn.Moreformally,j=j12n-11+

j2n-2+…+jn2?.Itisalsoconvenienttoadoptthenotation0.jijt+1…jmtorepresentthebinaryfractionji/2+jl+1/4+…+jm/2m-I+1.

WithalittlealgebrathequantumFouriertranstormcanbegiventhefollowingusefulproductrepresentation:;

QFT(续);

——10)+e2π20i…n1〉

—|0)+e2π20,/2m/n|1〉

R?|0)+e2πO.jn-17n|1)

10)+2H?in|1);

ToseethatthepicturedcircuitcomputesthequantumFouriertransform,considerwhathappenswhenthestate|j?…jn〉isinput.ApplyingtheHadamardgatetothefirstbitproducesthestate;

Box5.1:ThreequbitquantumFouriertransform

ForconcretenessitmayhelptolookattheexplicitcircuitforthethreequbitquantumFouriertransform:

HST

HS

H

RecallthatSandTarethephaseandπ/8gates(seepagexxiii).AsamatrixthequantumFouriertransforminthisinstancemaybewrittenoutexplicitly,usingw=e2πi/8=√i,as;

2相位估计

[1]MichaelA.NielsenIsaacL.,QuantumComputationandQuantumInformation,CambridgeUniversityPress,2010;

问题的提出

TheFouriertransformisthekeytoageneralprocedureknownasphaseestimation,whichinturnisthekeyformanyquantumalgorithms.SupposeaunitaryoperatorUhasan