title: Universal computation by multiparticle quantum walk.
abstract: A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition. We consider a generalization to interacting systems with more than one walker, such as the Bose-Hubbard model and systems of fermions or distinguishable particles with nearest-neighbor interactions, and show that multiparticle quantum walk is capable of universal quantum computation. Our construction could, in principle, be used as an architecture for building a scalable quantum computer with no need for time-dependent control.
authors: Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada.
authors: Andrew M
authors: AM
authors: Childs
authors: David
authors: D
authors: Gosset
authors: Zak
authors: Z
authors: Webb