1. L. K. Grover, ‘A fast quantum mechanical algorithm for database search,’ Proceedings, 28th Annual ACM Symposium on the Theory of Computing (STOC), May 1996, pp. 212–219. (quant-p/9605043)
2. L. K. Grover, ‘Quantum mechanics helps in searching for a needle in a haystack,’ Phys. Rev. Letters, 78(2), 325–328, 1997. (quant-ph/9605043)
3. C. Zalka, ‘Grover’s quantum searching is optimal,’ Phys. Rev. A, 60, 2746 (1999). (quant-ph/9711070v2)
4. C. H. Bennett, E. Bernstein, G. Brassard, and U. V. Vazirani, ‘Strength and weaknesses of quantum computing,’ SIAM Journal on Computing, vol. 26, no. 5, pp. 1510–1523, Oct. 1997. (quant-ph/9701001)
5. M. Boyer, G. Brassard, P. Hoeyer, and A. Tapp, ‘Tight bounds on quantum computing,’ Proceedings 4th Workshop on Physics and Computation, pp. 36–43, 1996. Also Fortsch. Phys. 46(1998) 493-506. (quant-ph/9605034)