Fetching the paper…
Reading the bibliography…
We numerically study the quantum walk search algorithm of Shenvi, Kempe and Whaley [PRA \textbf{67} 052307] and the factors which affect its efficiency in finding an individual state from an unsorted set.
Site percolation threshold for honeycomb and square lattices
Z. V. Djordjevic, H. E. Stanley, and A. Margolina · 1982
Earlier work this paper cites.
Site percolation threshold for square lattice
T. Gebele · 1984
Earlier work this paper cites.
Introduction to percolation theory
D. Stauffer and A. Aharony · 1992
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
L. K. Grover · 1996
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
E. Bernstein, C. Bennett, G. Brassard, and U. Vazirani · 1997
Earlier work this paper cites.
Quantum computation and decision trees
E. Farhi and S. Gutmann · 1998
Earlier work this paper cites.
Grover ′
C. Zalka · 1999
Earlier work this paper cites.
Quantum walk on the line
A. Nayak and A. Vishwanath · 2000
Earlier work this paper cites.
Quantum walks on graphs
D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani · 2001
Earlier work this paper cites.
One-dimensional quantum walks
A. Ambainis, E. Bach, A. Nayak, A. Vishwanath, and J. Watrous · 2001
Earlier work this paper cites.
Space searches with a quantum robot
P. Benioff · 2002
Earlier work this paper cites.
Quantum amplitude amplification and estimation
G. Brassard, P. Høyer, M. Mosca, and A. Tapp · 2002
Earlier work this paper cites.
Quantum walks in higher dimensions
T. D. Mackay, S. D. Bartlett, L. T. Stephenson, and B. C. Sanders · 2002
Earlier work this paper cites.
Quantum walks on the hypercube
C. Moore and A. Russell · 2002
Earlier work this paper cites.
Quantum search of spatial regions
S. Aaronson and A. Ambainis · 2003
Earlier work this paper cites.
Quantum walks and their algorithmic applications
A. Ambainis · 2003
Earlier work this paper cites.
Quantum random walks: an introductory overview
J. Kempe · 2003
Earlier work this paper cites.
Quantum random walks hit exponentially faster
J. Kempe · 2003
Earlier work this paper cites.
Quantum walks on general graphs
V. Kendon · 2003
Earlier work this paper cites.
Decoherence can be useful in quantum walks
V. Kendon and B. Tregenna · 2003
Earlier work this paper cites.
A quantum random-walk search algorithm
N. Shenvi, J. Kempe, and K. B. Whaley · 2003
Cited alongside, same era.
Controlling discrete quantum walks: coins and initial states
B. Tregenna, W. Flanagan, R. Maile, and V. Kendon · 2003
Cited alongside, same era.
Quantum walk algorithm for element distinctness
A. Ambainis · 2004
Cited alongside, same era.
Quantum verification of matrix products
H. Buhrman and R. Spalek · 2004
Cited alongside, same era.
Spatial search and the Dirac equation
A. M. Childs and J. Goldstone · 2004
Cited alongside, same era.
Spatial search by quantum walk
A. M. Childs and J. Goldstone · 2004
Cited alongside, same era.
Weak limits for quantum random walks
Quantum walk based search algorithms
M. Santha · 2008
Later among the works it cites.
Faster quantum-walk algorithm for the two-dimensional spatial search
A. Tulsi · 2008
Later among the works it cites.
Decoherence in Search Algorithms
G. Abal, R. Donangelo, F. L. Marquezino, A. C. Oliveira, and R. Portugal · 2009
Later among the works it cites.
Universal computation by quantum walk
A. M. Childs · 2009
Later among the works it cites.
Quantum search algorithms on the hypercube
B. Hein and G. Tanner · 2009
Later among the works it cites.
On the hitting times of quantum versus random walks
F. Magniez, A. Nayak, P. C. Richter, and M. Santha · 2009
Later among the works it cites.
Optimized quantum random-walk search algorithms on the hypercube
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
G. Grimmett, S. Janson, and P. F. Scudo · 2004
Cited alongside, same era.
Localization of two-dimensional quantum walks
N. Inui, Y. Konishi, and N. Konno · 2004
Cited alongside, same era.
Quantum Speed-Up of Markov Chain Based Algorithms
M. Szegedy · 2004
Cited alongside, same era.
Coins make quantum walks faster
A. Ambainis, J. Kempe, and A. Rivosh · 2005
Cited alongside, same era.
Convergence of continuous-time quantum walks on the line
A. D. Gottlieb · 2005
Cited alongside, same era.
Quantum complexity of testing group commutativity
F. Magniez and A. Nayak · 2005
Cited alongside, same era.
V. Potoček, A. Gábris, T. Kiss, and I. Jex · 2009
Later among the works it cites.
Quantum searches on highly symmetric graphs
D. Reitzner, M. Hillery, E. Feldman, and V. Bužek · 2009
Later among the works it cites.
Quantum Hitting Time on the Complete Graph
R. A. M. Santos and R. Portugal · 2009
Later among the works it cites.
Spatial search in a honeycomb network
G. Abal, R. Donangelo, F. L. Marquezino, and R. Portugal · 2010
Later among the works it cites.
Quantum search algorithms on a regular lattice
B. Hein and G. Tanner · 2010
Later among the works it cites.
Finding is as easy as detecting for quantum walks
H. Krovi, F. Magniez, M. Ozols, and J. Roland · 2010
Later among the works it cites.
Coined quantum walks on percolation graphs
G. Leung, P. Knott, J. Bailey, and V. Kendon · 2010
Later among the works it cites.
Universal quantum computation using the discrete-time quantum walk
N. B. Lovett, S. Cooper, M. Everitt, M. Trevers, and V. Kendon · 2010
Later among the works it cites.
Mixing Times in Quantum Walks on Two-Dimensional Grids
F. L. Marquezino, R. Portugal, and G. Abal · 2010
Later among the works it cites.
Search on a Hypercubic Lattice through a Quantum Random Walk: II. d=2
A. Patel, K. S. Raghunathan, and Md. A. Rahaman · 2010
Later among the works it cites.
Search on a Hypercubic Lattice through a Quantum Random Walk: I. d¿2
A. Patel and Md. A. Rahaman · 2010
Later among the works it cites.
Universal quantum computation by discontinuous quantum walk
M. S. Underwood and D. L. Feder · 2010
Later among the works it cites.
Spatial search using the discrete time quantum walk
Neil Lovett, Matthew Everitt, Matthew Trevers, Daniel Mosby, Dan Stockton, and Viv Kendon · 2011
Closest in time.