1. Baker, G.:
http://www.ics.mq.edu.au/~gregb/q-gol
2. Barenco, A., et al.: Elementary gates of quantum computation. Physical Review A 52(5), 3457–3467 (1995)
3. Barenco, A.: A universal two-bit gate for quantum computation. Proc. R. Soc. Lond. A 449, 679–683 (1995)
4. Boyer, M., Brassard, G., Hoyer, P., Tapp, A.: Tight bounds on quantum searching. In: Toffoli, T., Biaford, M., Lean, J. (eds.) Fourth Workshop on Physics and Computation, New England Complex System Institute, pp. 36–43 (1996)
5. Butler, M., Hartel, P.: Reasoning about Grover’s quantum search algorithm using probabilistic wp. University of Southampton technical report DSSETR- 98-10 (1998)