Local transition functions of quantum Turing machines

Masanao Ozawa; Harumichi Nishimura

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (2000)

  • Volume: 34, Issue: 5, page 379-402
  • ISSN: 0988-3754

How to cite

top

Ozawa, Masanao, and Nishimura, Harumichi. "Local transition functions of quantum Turing machines." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 34.5 (2000): 379-402. <http://eudml.org/doc/92642>.

@article{Ozawa2000,
author = {Ozawa, Masanao, Nishimura, Harumichi},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {quantum Turing machines},
language = {eng},
number = {5},
pages = {379-402},
publisher = {EDP-Sciences},
title = {Local transition functions of quantum Turing machines},
url = {http://eudml.org/doc/92642},
volume = {34},
year = {2000},
}

TY - JOUR
AU - Ozawa, Masanao
AU - Nishimura, Harumichi
TI - Local transition functions of quantum Turing machines
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 2000
PB - EDP-Sciences
VL - 34
IS - 5
SP - 379
EP - 402
LA - eng
KW - quantum Turing machines
UR - http://eudml.org/doc/92642
ER -

References

top
  1. [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. MR574722
  2. [2] E. Bernstein and U. Vazirani, Quantum complexity theory. SIAM J. Comput. 26 (1997) 1411-1473. Zbl0895.68042MR1471988
  3. [3] D. Deutsch, Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. London Ser. A 400 (1985) 97-117. Zbl0900.81019MR801665
  4. [4] D. Deutsch, Quantum computational networks. Proc. Roy. Soc. London Ser. A 425 (1989) 73-90. Zbl0691.68054MR1019288
  5. [5] R. P. Feynman, Simulating physics with computers. Internat J. Theoret. Phys. 21 (1982) 467-488. MR658311
  6. [6] J. Gruska, Quantum Computing. McGraw-Hill, London (1999). MR1978991
  7. [7] M. Hirvensalo, On quantum computation. Ph.D. Thesis, Turku Center for Computer Science, Finland (1997). 
  8. [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 MR1896351
  9. [9] C. H. Papadimitriou, Computational Complexity. Addison-Wesley, Reading, MA (1994). Zbl0833.68049MR1251285
  10. [10] P. W. Shor, Algorithms for quantum computation: Discrete logarithms and factoring, in in Proc. 35th Annual Symposium on Foundations of Computer Science, edited by S. Goldwasser. IEEE Computer Society Press, Los Alamitos, CA (1994) 124-134. MR1489242
  11. [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. MR1328432

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.