Frederic Magniez
ABSTRACT
We propose a new method for designing quantum search algorithms forfinding a "marked" element in the state space of a classical Markovchain. The algorithm is based on a quantum walk à la Szegedy [25] that is defined in terms of the Markov chain. The main new idea is to apply quantum phase estimation to the quantumwalk in order to implement an approximate reflection operator. Thisoperatoris then used in an amplitude amplification scheme. As a result weconsiderably expand the scope of the previous approaches ofAmbainis [6] and Szegedy [25]. Our algorithm combines the benefits of these approaches in terms of beingable to find marked elements, incurring the smaller cost of the two,and being applicable to a larger class of Markov chain. In addition,it is conceptually simple, avoids several technical difficulties in the previous analyses, and leads to improvements in various aspects of several algorithms based on quantum walk.
- S. Aaronson and Y. Shi. Quantum lower bounds for the collision and the element distinctness problems. Journal of the ACM, pages 595--605, 2004. Google Scholar
Digital Library
- S. Aaronson and A. Ambainis. Quantum search of spatial regions. Theory of Computing, 1:47--79, 2005.Google ScholarCross Ref
- D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani. Quantum walks on graphs. In Proceedings of the 33rd ACM Symposium on Theory of computing, pages 50--59, 2001. Google ScholarDigital Library
- D. Aldous and J. Fill. Reversible Markov Chains and Random Walks on Graphs. http://www.stat.berkeley.edu/~aldous/RWG/book.html. Monograph in preparation, August 2006 version.Google Scholar
- A. Ambainis, J. Kempe, and A. Rivosh. Coins make quantum walks faster. In Proceedings of the 16th ACM-SIAM symposium on Discrete algorithms, pages 1099--1108, 2005. Google ScholarDigital Library
- A. Ambainis. Quantum Walk Algorithm for Element Distinctness. In Proceedings of the 45th Symposium on Foundations of Computer Science, pages 22--31, 2004. Google ScholarDigital Library
- A. Ambanis, E. Bach, A. Nayak, A. Vishwanath, and J. Watrous. One-dimensional quantum walks. In Proceedings of the 33rd ACM Symposium on Theory of computing, pages 37--49, 2001. Google ScholarDigital Library
- C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computing. SIAM Journal on Computing, 26(5):1510--1523, 1997. Google ScholarDigital Library
- M. Boyer, G. Brassard, P. Hoyer, and A. Tapp. Tight bounds on quantum searching. Fortschritte Der Physik, 46(4-5):493--505, 1998.Google ScholarCross Ref
- G. Brassard, P. Hoyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation. In Jr. Samuel J. Lomonaco and Howard E. Brandt, editors, Quantum Computation and Quantum Information: A Millennium Volume, volume 305 of Contemporary Mathematics Series. American Mathematical Society, 2002.Google Scholar
- A. Broder and A. Karlin. Bounds on the cover time. Journal of Theoretical Probability, 2(1):101--120, 1989.Google ScholarCross Ref
- H. Buhrman, C. Dörr, M. Heiligman, P. Hoyer, M. Santha F. Magniez, and R. de Wolf. Quantum algorithms for element distinctness. SIAM Journal of Computing, 34(6):1324--1330, 2005. Google ScholarDigital Library
- H. Buhrman and R. Spalek. Quantum verification of matrix products. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, pages 880--889, 2006. Google ScholarDigital Library
- A. Childs and J. Goldstone. Spatial search and the Dirac equation. Physical Review A, 70, 2004. Article No. 42312.Google Scholar
- R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca. Quantum algorithms revisited. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 454(1969):339--354, 1998.Google ScholarCross Ref
- L. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th ACM Symposium on the Theory of Computing, pages 212--219, 1996. Google ScholarDigital Library
- P. Hoyer, M. Mosca, and R. de Wolf. Quantum search on bounded-error inputs. In Verlag, editor, Proceedings of the 30th International Colloquium on Automata, Languages and Programming, volume 2719 of Lecture Notes in Computer Science, pages 291--299. Verlag, 2003. Google ScholarDigital Library
- A. Kitaev. Quantum measurements and the abelian stabilizer problem. Technical Report quant-ph/9511026, arXiv, 1995.Google Scholar
- F. Magniez and A. Nayak. Quantum complexity of testing group commutativity. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, volume 1770 of Lecture Notes in Computer Science, pages 1312--1324, 2005. Google ScholarDigital Library
- F. Magniez, M. Santha, and M. Szegedy. Quantum Algorithms for the Triangle Problem. In Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, 2005. Google ScholarDigital Library
- D. Meyer. From quantum cellular automata to quantum lattice gases. Journal of Statistical Physics, 85(5-6):551--574, 1996.Google ScholarCross Ref
- A. Nayak and A. Vishwanath. Quantum walk on the line. Technical Report quant-ph/0010117, arXiv, 2000. Google ScholarDigital Library
- P. Richter. Almost uniform sampling via quantum walks. New Journal of Physics, 2007. To appear.Google ScholarCross Ref
- N. Shenvi, J. Kempe, and K.B. Whaley. Quantum random-walk search algorithm. Physical Review A, 67(052307), 2003.Google Scholar
- M. Szegedy. Quantum Speed-Up of Markov Chain Based Algorithms. In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pages 32--41, 2004. Google ScholarDigital Library
- U. Vazirani. On the power of quantum computation. Philosophical Transactions of the Royal Society of London, Series A, 356:1759--1768, 1998.Google ScholarCross Ref
- J. Watrous. Quantum simulations of classical random walks and undirected graph connectivity. Journal of Computer and System Sciences, 62(2):376--391, 2001. Google ScholarDigital Library
Index Terms
- Search via quantum walk
Recommendations
Search via Quantum Walk
We propose a new method for designing quantum search algorithms for finding a “marked” element in the state space of a classical Markov chain. The algorithm is based on a quantum walk à la Szegedy [Quantum speed-up of Markov chain based algorithms, in ...
On the Hitting Times of Quantum Versus Random Walks
The hitting time of a classical random walk (Markov chain) is the time required to detect the presence of--or equivalently, to find--a marked state. The hitting time of a quantum walk is subtler to define; in particular, it is unknown whether the ...
Exceptional quantum walk search on the cycle
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 ...
Comments