View Document Preview and Link Document Date: 2008-02-01 00:39:23 Open Document File Size: 320,37 KB Share Result on Facebook
City Cambridge / Calgary / / Company Hp / Bernstein / / Country United States / Canada / / / Facility University of Calgary / Northeastern University / Massachusetts Institute of Technology / / IndustryTerm conventional quantum computing paradigm / polynomial-time algorithms / classical algorithm / physical quantum systems / quantum algorithm / classical algorithms / polynomial-time classical traversal algorithm / probabilistic classical algorithm / quantum algorithms / / Organization Center for Theoretical Physics / Department of Computer Science / Northeastern University / Boston / MIT / University of Calgary / Department of Mathematics / Massachusetts Institute of Technology / / Person Richard Cleve / Edward Farhi / Sam Gutmann / Enrico Deotto / Andrew M. Childs / / Product 2n / / ProgrammingLanguage C / / ProvinceOrState Alberta / Massachusetts / / Technology probabilistic classical algorithm / quantum algorithm / polynomial-time classical traversal algorithm / classical algorithm / polynomial-time algorithms / simulation / previous quantum algorithms / / SocialTag 
MIT-CTP #3309 Exponential algorithmic speedup by quantum walk Andrew M. Childs,1, ∗ Richard Cleve,2, † Enrico Deotto,1 , ‡ Edward Farhi,1, § Sam Gutmann,3, ¶ and Daniel A. Spielman4, ∗∗