Grover’s Algorithm and Its Generalization
Grover’s algorithm is a search algorithm originally designed to look for an element in an unsorted database with no repeated elements. If the database elements are stored in a random order, the only available method to find a specific element is an exhaustive search. Usually, this is not the best way to use databases, especially if it is queried several times. It is better to sort the elements, which is an expensive task, but performed only once. In the context of quantum computing, storing data in superposition or in an entangled state for a long period of time is not an easy task. Because of that, Grover’s algorithm is introduced following an alternative route, which shows its wide applicability.
- 4.Aharonov, D.: Quantum computation – a review. In: Stauffer, D. (ed.) Annual Review of Computational Physics, vol. VI, pp. 1–77. World Scientific, , Singapore (1998)Google Scholar
- 10.Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 1099–1108 (2005)Google Scholar
- 17.Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Forstschritte Der Physik 4, 820–831 (1998)Google Scholar
- 18.Brassard, G., Høyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. Quant. Comput. Quant. Inform. Sci., AMS Contemp. Math. Ser. 305, 53–74, (2002), quant-ph/0005055Google Scholar
- 83.Zalka, C.: Grover’s Quantum Searching Algorithm is Optimal. (1997), quant-ph/9711070Google Scholar