Universal computation by quantum walk

Simple item page
dc.creatorChilds, Andrew M.
dc.date2008-06-12
dc.date.accessioned2026-07-07T13:10:50Z
dc.date.available2026-07-07T13:10:50Z
dc.descriptionIn some of the earliest work on quantum mechanical computers, Feynman showed how to implement universal quantum computation by the dynamics of a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is restricted to be a sparse matrix with all entries equal to 0 or 1, i.e., the adjacency matrix of a low-degree graph. Thus quantum walk can be regarded as a universal computational primitive, with any desired quantum computation encoded entirely in some underlying graph. The main idea of the construction is to implement quantum gates by scattering processes.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/0806.1972
dc.identifierhttp://arxiv.org/abs/0806.1972
dc.identifierPhys. Rev. Lett. 102, 180501 (2009)
dc.identifierdoi:10.1103/PhysRevLett.102.180501
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229112
dc.subjectQuantum Physics
dc.titleUniversal computation by quantum walk
dc.typetext

Files

Collections

arXiv