量子算法与格问题.docx

1

1

2

2

QuantumAlgorithmsforLatticeProblems

YileiChen?April10,2024

Abstract

Weshowapolynomialtimequantumalgorithmforsolvingthelearningwitherrorsproblem(LWE)withcertainpolynomialmodulus-noiseratios.CombiningwiththereductionsfromlatticeproblemstoLWEshownbyRegev[J.ACM2009],weobtainpolynomialtimequantumalgorithmsforsolvingthedecisionalshortestvectorproblem(GapSVP)andtheshortestindependentvectorproblem(SIVP)foralln-dimensionallatticeswithinapproximationfactorsof??(n4.5).Previously,nopolynomialorevensubexponentialtimequantumalgorithmswereknownforsolvingGapSVPorSIVPforalllatticeswithinanypolynomialapproximationfactors.

TodevelopaquantumalgorithmforsolvingLWE,wemainlyintroducetwonewtechniques.First,weintroduceGaussianfunctionswithcomplexvariancesinthedesignofquantumalgorithms.Inparticular,weexploitthefeatureoftheKarstwaveinthediscreteFouriertransformofcomplexGaussianfunctions.Second,weusewindowedquantumFouriertransformwithcomplexGaussianwindows,whichallowsustocombinetheinformationfrombothtimeandfrequencydomains.Usingthosetechniques,wefirstconverttheLWEinstanceintoquantumstateswithpurelyimaginaryGaussianamplitudes,thenconvertpurelyimaginaryGaussianstatesintoclassicallinearequationsovertheLWEsecretanderrorterms,andfinallysolvethelinearsystemofequationsusingGaussianelimination.ThisgivesapolynomialtimequantumalgorithmforsolvingLWE.

?IIIS,TsinghuaUniversity,ShanghaiArtificialIntelligenceLaboratory,andShanghaiQiZhiInstitute. Emails:

chenyilei@.chenyilei.ra@.SupportedbyTsinghuaUniversitystartupfunding.

Contents

Introduction 1

Mainresults 2

Maintechniques:Gaussianfunctionswithcomplexvariances 3

OverviewofouralgorithmforsolvingLWE 6

Preliminary 8

Lattices 10

Quantumcomputation 12

MainTheorem:QuantumAlgorithmfor