We carry out a numerical study of the quantum walk search algorithm of Shenvi, Kempe and Whaley Shenvi et al. (2003) and the factors that affect its efficiency in finding an individual state from an unsorted set. Previous work has focused purely on the effects of the di... View more
S. Aaronson and A. Ambainis. Quantum search of spatial regions. In Proceedings of the 44th annual IEEE symposium on foundations of computer science (FOCS), 2003, pages 200-209. IEEE, 2003.
G. Abal, R. Donangelo, F. L. Marquezino, A. C. Oliveira, and R. Portugal. Decoherence in Search Algorithms. Proceedings of the 29th Brazilian computer society congress (SEMISH), pages 293-306, 2009.
G. Abal, R. Donangelo, F. L. Marquezino, and R. Portugal. Spatial search in a honeycomb network. To appear in Mathematical Structures in Computer Science. Arxiv preprint arXiv:1001.1139, 2010.
D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani. Quantum walks on graphs. In Proceedings of the 33rd annual ACM symposium on theory of computing (STOC), pages 50-59. ACM, 2001.
A. Ambainis. Quantum walks and their algorithmic applications. International Journal of Quantum Information, 1:507-518, 2003.
A. Ambainis. Quantum walk algorithm for element distinctness. In Proceedings of the 45th annual IEEE symposium on foundations of computer science (FOCS), 2004, pages 22-31. IEEE, 2004.
A. Ambainis, E. Bach, A. Nayak, A. Vishwanath, and J. Watrous. One-dimensional quantum walks. In Proceedings of the 33rd annual ACM symposium on theory of computing (STOC), pages 37-49. ACM, 2001.
A. Ambainis, J. Kempe, and A. Rivosh. Coins make quantum walks faster. In Proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms (SODA), pages 1099- 1108. Society for Industrial and Applied Mathematics, 2005.
P. Benioff. Space searches with a quantum robot. Quantum Computation and Information, 305:1, 2002.
E. Bernstein, C. Bennett, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computing. SIAM Journal of Computing, 26:1510-1523, 1997.