Local Transition Functions of Quantum Turing Machines

 Access to full text

 Full (PDF)

1. P. Benioff, The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. J. Statist. Phys.22 (1980) 563-591.  
2. E. Bernstein and U. Vazirani, Quantum complexity theory. SIAM J. Comput.26 (1997) 1411-1473.  
3. D. Deutsch, Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. London Ser. A400 (1985) 97-117.  
4. D. Deutsch, Quantum computational networks. Proc. Roy. Soc. London Ser. A425 (1989) 73-90.  
5. R.P. Feynman, Simulating physics with computers. Internat. J. Theoret. Phys.21 (1982) 467-488.  
6. J. Gruska, Quantum Computing. McGraw-Hill, London (1999).  
7. M. Hirvensalo, On quantum computation. Ph.D. Thesis, Turku Center for Computer Science, Finland (1997).  
8. H. Nishimura and M. Ozawa, Computational complexity of uniform quantum circuit families and quantum Turing machines. Theoret. Comput. Sci. (to appear). Available at the LANL quantum physics e-print archive at http://xxx.lanl.gov/archive/quant-ph/9906095  
9. C.H. Papadimitriou, Computational Complexity. Addison-Wesley, Reading, MA (1994).  
10. P.W. Shor, Algorithms for quantum computation: Discrete logarithms and factoring, in Proc. 35th Annual Symposium on Foundations of Computer Science, edited by S. Goldwasser. IEEE Computer Society Press, Los Alamitos, CA (1994) 124-134.  
11. A. Yao, Quantum circuit complexity, in Proc. 34th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA (1993) 352-361.