Childs, A., Cleve, R., Deotto, E., Farhi, E., Gutmann, S. and Spielman, D.A. (2002) Exponential Algorithmic Speedup by Quantum Walk. arXiv:quant-ph/0209131v2.
has been cited by the following article:
TITLE: Alternative Coins for Quantum Random Walk Search Optimized for a Hypercube
AUTHORS: Hristo Tonchev
KEYWORDS: Quantum Information, Quantum Random, Quantum Random Walk Search
JOURNAL NAME: Journal of Quantum Information Science, Vol.5 No.1, March 25, 2015
ABSTRACT: The present paper is focused on non-uniform quantum coins for the quantum random walk search algorithm. This is an alternative to the modification of the shift operator, which divides the search space into two parts. This method changes the quantum coins, while the shift operator remains unchanged and sustains the hypercube topology. The results discussed in this paper are obtained by both theoretical calculations and numerical simulations.