We study some extensions of Grover's quantum searching algorithm. First, we generalize the Grover iteration in the light of a concept called amplitude amplification. Then, we show that the quadratic speedup obtained by the quantum searching algorithm over classical brute force can still be obtained for a large family of search problems for which good classical heuristics exist. Finally, as our main result, we combine ideas from Grover's and Shor's quantum algorithms to perform approximate counting, which can be seen as an amplitude estimation process.
KeywordsBoolean Function Success Probability Quantum Algorithm Search Problem Quantum Search Algorithm
Unable to display preview. Download preview PDF.
- 1.Barenco, Adriano, “Quantum physics and computers”, Contemporary Physics, Vol. 38, 1996, pp. 357–389.Google Scholar
- 3.Boyer, Michel, Gilles Brassard, Peter HØyer and Alain Tapp, “Tight bounds on quantum searching”, Proceedings of Fourth Workshop on Physics and Computation — PhysComp '96, November 1996, pp. 36–43. Final version to appear in Fortschritte Der Physik.Google Scholar
- 4.Brassard, Gilles, “A quantum jump in computer science”, in Computer Science Today, Jan van Leeuwen (editor), Lecture Notes in Computer Science, Vol. 1000, Springer-Verlag, 1995, pp. 1–14.Google Scholar
- 5.Brassard, Gilles, “New horizons in quantum information processing”, Proceedings of this ICALP Conference, 1998.Google Scholar
- 6.Brassard, Gilles and Peter HØyer, “An exact quantum polynomial-time algorithm for Simon's problem”, Proceedings of Fifth Israeli Symposium on Theory of Computing and Systems — ISTCS '97, June 1997, IEEE Computer Society Press, pp. 12–23.Google Scholar
- 7.Chi, Dong-Pyo and Jinsoo Kim, “Quantum database searching by a single query”, Lecture at First NASA International Conference on Quantum Computing and Quantum Communications, Palm Springs, February 1998.Google Scholar
- 10.Mosca, Michele, “Quantum computer algorithms and interferometry”, Lecture at BRICS Workshop on Algorithms in Quantum Information Processing, Aarhus, January 1998.Google Scholar