1. Barenco, A., Berthiaume, A., Deutsch, D., Ekert, A., Jozsa, R., Macchiavello, C.: Stabilization of quantum computations by symmetrization. SIAM J. Comput. 26(5),1541–1557 (1997) doi: 10.1137/S0097539796302452 . http://link.aip.org/link/?SMJ/26/1541/1
2. Bennett C.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525–532 (1973)
3. Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing (1997) http://www.citebase.org/abstract?id=oai:arXiv.org:quant-ph/9701001
4. Cook, S.A.: The complexity of theorem-proving procedures. In: STOC ’71: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151–158. ACM, New York, NY, USA (1971) http://doi.acm.org/10.1145/800157.805047
5. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to Algorithms, 2/e. MIT Press, Cambridge (2001)