Abstract

We study discrete-time quantum walks on the complete and bipartite graphs, and show how they can be used to perform searches. The symmetry of the graphs significantly reduces the dimension of the problem.

© 2008 Optical Society of America

PDF Article