A panoply of quantum algorithms

This paper's aim is to explore improvements to, and applications of, a fundamental quantum algorithm invented by Grover[1]. Grover's algorithm is a basic tool that can be applied to a large number of problems in computer science, creating quantum algorithms that are polynomially faster than fastest known and fastest possible classical algorithms that solve the same problems. Our goal in this paper is to make these techniques readily accessible to those without a strong background in quantum physics: we achieve this by providing a set of tools, each of which makes use of Grover's algorithm or similar techniques, which can be used as subroutines in many quantum algorithms. The tools we provide are carefully constructed: they are easy to use, and in many cases they are asymptotically faster than the best tools previously available. The tools we build on include algorithms by Boyer, Brassard, Hoyer and Tapp[2], Buhrman, Cleve, de Witt and Zalka[3] and Durr and Hoyer[4]. After creating our tools, we create several new quantum algorithms, each of which is faster than the fastest known deterministic classical algorithm that accomplishes the same aim, and some of which are faster than the fastest possible deterministic classical algorithm. These algorithms solve problems from the fields of graph theory and computational geometry, and some employ dynamic programming techniques. We discuss a breadth-first search that is faster than Θ(edges) (the classical limit) in a dense graph, maximum-points-on-a-line in O(N3/2 lgN) (faster than the fastest classical algorithm known), as well as several other algorithms that are similarly illustrative of solutions in some class of problem. Through these new algorithms we illustrate the use of our tools, working to encourage their use and the study of quantum algorithms in general.

[1]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[2]  Christoph Dürr,et al.  A Quantum Algorithm for Finding the Minimum , 1996, ArXiv.

[3]  Gilles Brassard,et al.  Tight bounds on quantum searching , 1996, quant-ph/9605034.

[4]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[5]  Andris Ambainis,et al.  Quantum Algorithms for Matching and Network Flows , 2006, STACS.

[6]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[7]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[8]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[9]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[10]  Gilles Brassard,et al.  An exact quantum polynomial-time algorithm for Simon's problem , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[11]  Tadao Takaoka,et al.  Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication , 2002, CATS.

[12]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[13]  R. Feynman.  Simulating physics with computers , 1999 .

[14]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[15]  S. Kleene.  $\lambda$-definability and recursiveness , 1936 .

[16]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[17]  Christoph Dürr,et al.  Quantum query complexity in computational geometry revisited , 2006, SPIE Defense + Commercial Sensing.

[18]  Ronald de Wolf,et al.  Bounds for small-error and zero-error quantum algorithms , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[19]  P. Benioff.  Quantum Mechanical Models of Turing Machines That Dissipate No Energy , 1982 .

[20]  Graham R. Wood,et al.  Grover's Quantum Algorithm Applied to Global Optimization , 2005, SIAM J. Optim..

[21]  Hisao Tamaki,et al.  Algorithms for the maximum subarray problem based on matrix multiplication , 1998, SODA '98.

[22]  A. Church.  An Unsolvable Problem of Elementary Number Theory , 1936 .

[23]  Mehdi Mhalla,et al.  Quantum Query Complexity of Some Graph Problems , 2004, SIAM J. Comput..

[24]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[25]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[26]  I PaulBenioff.  Quantum Mechanical Hamiltonian Models of Turing Machines , 1982 .

[27]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[28]  Uri Zwick,et al.  All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[29]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .