Affiliate disclosure
Book titles on this page link to Amazon. As an Amazon Associate, DataField.Dev earns from qualifying purchases — at no additional cost to you.
Further Reading: Chapter 13 — Grover's Algorithm — Searching an Unsorted Database in √N Instead of N — Quadratic Speedup for Unstructured Problems
- Grover, L. K. (1996). "A fast quantum mechanical algorithm for database search." Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 212-219.
- Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997). "Strengths and Weaknesses of Quantum Computing." SIAM Journal on Computing, 26(5), 1510-1523.
- Boyer, M., Brassard, G., Høyer, P., & Tapp, A. (1998). "Tight bounds on quantum searching." Fortschritte der Physik, 46(4-5), 493-505.
- Brassard, G., Høyer, P., Mosca, M., & Tapp, A. (2002). "Quantum amplitude amplification and estimation." Contemporary Mathematics, 305, 53-74.
- Nielsen, M. A. & Chuang, I. L. (2010). Quantum Computation and Quantum Information, Chapter 6. Cambridge University Press.
- Dürr, C. & Høyer, P. (1996). "A quantum algorithm for finding the minimum." arXiv:quant-ph/9607014.
- Jørgensen, F., Schubert, S., & Mølmer, K. (2021). "Quantum computing with neutral atoms." Advances in Physics: X, 6(1).