Universal computation by quantum walk.

Abstract

In some of the earliest work on quantum computing, Feynman showed how to implement universal quantum computation with a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is restricted to be the adjacency matrix of a low-degree graph. Thus quantum walk can be regarded as a universal computational primitive, with any quantum computation encoded in some graph. The main idea is to implement quantum gates by scattering processes.

Extracted Key Phrases

010202008200920102011201220132014201520162017
Citations per Year

89 Citations

Semantic Scholar estimates that this publication has 89 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Childs2009UniversalCB, title={Universal computation by quantum walk.}, author={Andrew M. Childs}, journal={Physical review letters}, year={2009}, volume={102 18}, pages={180501} }