Exponential algorithmic speedup by quantum walk

Simple item page
dc.creatorChilds, Andrew M.
dc.creatorCleve, Richard
dc.creatorDeotto, Enrico
dc.creatorFarhi, Edward
dc.creatorGutmann, Sam
dc.creatorSpielman, Daniel A.
dc.date2002-09-24
dc.date2002-10-25
dc.date.accessioned2026-07-07T06:04:59Z
dc.date.available2026-07-07T06:04:59Z
dc.descriptionWe construct an oracular (i.e., black box) problem that can be solved exponentially faster on a quantum computer than on a classical computer. The quantum algorithm is based on a continuous time quantum walk, and thus employs a different technique from previous quantum algorithms based on quantum Fourier transforms. We show how to implement the quantum walk efficiently in our oracular setting. We then show how this quantum walk can be used to solve our problem by rapidly traversing a graph. Finally, we prove that no classical algorithm can solve this problem with high probability in subexponential time.
dc.description24 pages, 7 figures; minor corrections and clarifications
dc.identifierhttps://arxiv.org/abs/quant-ph/0209131
dc.identifierhttp://arxiv.org/abs/quant-ph/0209131
dc.identifierProc. 35th ACM Symposium on Theory of Computing (STOC 2003), pp. 59-68
dc.identifierdoi:10.1145/780542.780552
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90511
dc.subjectQuantum Physics
dc.titleExponential algorithmic speedup by quantum walk
dc.typetext

Files

Collections

arXiv