1. L K Grover, Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett. 78(2), 325–328 (1997) available on my homepage http://www.bell-labs.com/user/lkgrover/
2. A fast quantum mechanical algorithm for database search, Proceedings of 28th Annual ACM Symposium on Theory of Computing (STOC), 212–219 (1996) available on my homepage http://www.bell-labs.com/user/lkgrover/
3. Richard Jozsa, Searching in Grover’s Algorithm, http://xxx.lanl.gov/abs/quant-ph/9901021
4. For an N-state system, in order for the terms in each row to sum to unity, the diagonal terms of D should be (1 − i(N − 1)ε). However, for simplicity, we write this as (1 − iNε). For N large, the error due to this is negligible
5. M Boyer, G Brassard, P Hoyer and A Tapp. Tight bounds on quantum searching, Proc. Phys. Comp. (1996) http://xxx.lanl.gov/abs/quant-ph/9605034