1. M. Garey and D. Johnson, Computers and Intractability — a guide to the theory of NP-completeness (Freeman, 1979).
2. P.W. Shor, “Algorithm for quantum computation: Discrete logarithm and factoring algorithm,” in Proc. 35th Annual IEEE Symposium on Foundation of Computer Science, 124–134 (1994).
3. D. Deutsch, “Quantum theory, the Church-Turing principle and the universal quantum computer,” Proc. Royal Soc. London A 400, 97–117 (1985).
4. A. Ekert and R. Jozsa, “Quantum computation and Shor’s factoring algorithm,” Rev. Mod. Phys. 68(3), 733–753 (1996).
5. E. Bernstein and U. Vazirani, “Quantum complexity theory,” Proc. 25th ACM Symp. Theory Comput., 11–20 (1993).