1. Lov, K.: Grover: a fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. STOC ’96, 212–219, New York (1996)
2. Lov, K.: Grover: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79, 325–328 (1997)
3. Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik 46(4-5), 493–505 (1998)
4. Brassard, G., HØyer, P., Tapp, A.: Quantum Counting. In: Automata, Languages and Programming, pp 820–831. Springer, Berlin (1998)
5. Peter, W.: Shor: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. J. Comput. 26(5), 1484–1509 (1997)