1. R. Beals, Computing Fourier Transform over S n in QP, unpublished manuscript.
2. C. Bennett, Logical reversibility of computation, IBM J. Res. Develop. vol. 17, 1973, pp. 525–532.
3. C. Bennett, E. Bernstein, G. Brassard, U. Vazirani, Strengths and Weaknesses of Quantum Computing, to appear.
4. E. Bernstein and U. Vazirani, Quantum Complexity Theory, Proc. 25th ACM Symp. on Theory of Computation, 1993.
5. D. Coppersmith, An Approximate Fourier Transform Useful in Quantum Factoring, IBM Research Report 19642, 1994.