Access the full text.
Sign up today, get DeepDyve free for 14 days.
F. Magniez, A. Nayak, Peter Richter, M. Santha (2008)
On the Hitting Times of Quantum Versus Random WalksAlgorithmica, 63
(1974)
Oresme numbers
Andrew Childs, J. Goldstone (2003)
Spatial search by quantum walkPhysical Review A, 70
F. Marquezino, R. Portugal, G. Abal (2010)
Mixing Times in Quantum Walks on Two-Dimensional GridsArXiv, abs/1006.4625
A. Ambainis, M. Kokainis (2014)
Analysis of the extended hitting time and its properties
K. Prusis, J. Vihrovs, T. Wong (2016)
Stationary States in Quantum Walk SearchPhysical Review A, 94
N. Nahimovs, Alexander Rivosh (2015)
Quantum Walks on Two-Dimensional Grids with Multiple Marked LocationsInt. J. Found. Comput. Sci., 29
Avatar Tulsi (2008)
Faster quantum-walk algorithm for the two-dimensional spatial searchPhysical Review A, 78
R. Portugal, R. Santos, T. Fernandes, D. Gonçalves (2015)
The staggered quantum walk modelQuantum Information Processing, 15
(2013)
Hitting time
D. Meyer (1996)
On the absence of homogeneous scalar unitary cellular automataPhysics Letters A, 223
Lov Grover (1996)
A fast quantum mechanical algorithm for database search
N. Nahimovs, Alexander Rivosh (2015)
Exceptional Configurations of Quantum Walks with Grover's Coin
D. Aharonov, A. Ambainis, J. Kempe, U. Vazirani (2000)
Quantum walks on graphs
A. Ambainis, A. Backurs, N. Nahimovs, Raitis Ozols, Alexander Rivosh (2011)
Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification
D. Meyer (1996)
From quantum cellular automata to quantum lattice gasesJournal of Statistical Physics, 85
S. Gudder (2008)
Quantum Markov chainsJournal of Mathematical Physics, 49
A. Ambainis, Alexander Rivosh (2008)
Quantum Walks with Multiple or Moving Marked Locations
A. Ambainis, J. Kempe, Alexander Rivosh (2004)
Coins make quantum walks faster
S. Venegas-Andraca (2012)
Quantum walks: a comprehensive reviewQuantum Information Processing, 11
(2010)
Quantum hitting time on the cycle
M. Santha (2008)
Quantum Walk Based Search Algorithms
H. Krovi, F. Magniez, M. Ozols, J. Roland (2010)
Quantum Walks Can Find a Marked Element on Any GraphAlgorithmica, 74
T. Wong, Luís Tarrataca, Nikolay Nahimov (2015)
Laplacian versus adjacency matrix in quantum walk searchQuantum Information Processing, 15
Yazhen Wang (2012)
Quantum Computation and Quantum InformationStatistical Science, 27
T. Wong (2016)
Equivalence of Szegedy’s and coined quantum walksQuantum Information Processing, 16
N. Nahimovs, R. Santos (2016)
Adjacent Vertices Can be Hard to Find by Quantum WalksMoscow University Computational Mathematics and Cybernetics, 43
T. Wong, A. Ambainis (2015)
Quantum search with multiple walk steps per oracle queryPhysical Review A, 92
F. Magniez, A. Nayak, J. Roland, M. Santha (2006)
Search via quantum walk
A. Ambainis, K. Prusis, J. Vihrovs, T. Wong (2016)
Oscillatory localization of quantum walks analyzed by classical electric circuitsPhysical Review A, 94
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk’s hitting time. In some exceptional cases, however, the system only evolves by sign flips, staying in a uniform probability distribution for all time. We prove that the one-dimensional periodic lattice or cycle with any arrangement of marked vertices is such an exceptional configuration. Using this discovery, we construct a search problem where the quantum walk’s random sampling yields an arbitrary speedup in query complexity over the classical random walk’s hitting time. In this context, however, the mixing time to prepare the initial uniform state is a more suitable comparison than the hitting time, and then, the speedup is roughly quadratic.
Quantum Information Processing – Springer Journals
Published: May 4, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.