Fetching the paper…
Reading the bibliography…
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph.
Finite Markov Chains
John G. Kemeny and J. Laurie Snell · 1960
Earlier work this paper cites.
Matrix Analysis
Roger A. Horn and Charles R. Johnson · 1990
Earlier work this paper cites.
Computing with noisy information
Uriel Feige, Prabhakar Raghavan, David Peleg, and Eli Upfal · 1994
Earlier work this paper cites.
Quantum measurements and the Abelian Stabilizer Problem
Alexei Kitaev · 1995
Earlier work this paper cites.
Introduction to Probability
Charles M. Grinstead and J. Laurie Snell · 1997
Earlier work this paper cites.
Quantum algorithms revisited
Richard Cleve, Artur Ekert, Chiara Macchiavello, and Michele Mosca · 1998
Earlier work this paper cites.
Quantum computation by adiabatic evolution
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser · 2000
Earlier work this paper cites.
Matrix Analysis and Applied Linear Algebra
Carl D. Meyer · 2000
Earlier work this paper cites.
Quantum search on bounded-error inputs
Peter Høyer, Michele Mosca, and Ronald de Wolf · 2003
Earlier work this paper cites.
Quantum random-walk search algorithm
Neil Shenvi, Julia Kempe, and Birgitta K. Whaley · 2003
Earlier work this paper cites.
Spatial search and the Dirac equation
Andrew M. Childs and Jeffrey Goldstone · 2004
Cited alongside, same era.
Spatial search by quantum walk
Andrew M. Childs and Jeffrey Goldstone · 2004
Cited alongside, same era.
Quantum speed-up of Markov chain based algorithms
Mario Szegedy · 2004
Cited alongside, same era.
Spectra of quantized walks and a δ ε \sqrt{\delta\varepsilon} -rule
Mario Szegedy · 2004
Cited alongside, same era.
Quantum search of spatial regions
Scott Aaronson and Andris Ambainis · 2005
Cited alongside, same era.
Coins make quantum walks faster
Andris Ambainis, Julia Kempe, and Alexander Rivosh · 2005
Cited alongside, same era.
Discrete quantum walks hit exponentially faster
Theory of Probability and Random Processes
Leonid B. Koralov and Yakov G. Sinai · 2007
Later among the works it cites.
Quantum complexity of testing group commutativity
Frédéric Magniez and Ashwin Nayak · 2007
Later among the works it cites.
Search via quantum walk
Frédéric Magniez, Ashwin Nayak, Jérémie Roland, and Miklos Santha · 2007
Later among the works it cites.
Quantum algorithms for the triangle problem
Frédéric Magniez, Miklos Santha, and Mario Szegedy · 2007
Later among the works it cites.
Faster quantum-walk algorithm for the two-dimensional spatial search
Avatar Tulsi · 2008
Later among the works it cites.
Hitting time for the continuous quantum walk
Martin Varbanov, Hari Krovi, and Todd A. Brun · 2008
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Julia Kempe · 2005
Cited alongside, same era.
Quantum verification of matrix products
Harry Buhrman and Robert Špalek · 2006
Cited alongside, same era.
Hitting time for quantum walks on the hypercube
Hari Krovi and Todd A. Brun · 2006
Cited alongside, same era.
Quantum walk algorithm for element distinctness
Andris Ambainis · 2007
Cited alongside, same era.
Later among the works it cites.
Finding is as easy as detecting for quantum walks
Hari Krovi, Frédéric Magniez, Maris Ozols, and Jérémie Roland · 2010
Closest in time.
Adiabatic condition and the quantum hitting time of Markov chains
Hari Krovi, Maris Ozols, and Jérémie Roland · 2010
Closest in time.
Search by quantum walks on two-dimensional grid without amplitude amplification
Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs, Raitis Ozols, and Alexander Rivosh · 2011
Closest in time.
On the hitting times of quantum versus random walks
Frédéric Magniez, Ashwin Nayak, Peter Richter, and Miklos Santha · 2012
Closest in time.