Quantum reversibility and a new model of quantum automaton

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2138, Issue , 2001, Pages 376-379

  Ciamarra, Massimo Pica ^a  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA; QUANTUM COMPUTERS;

CLASSICAL COUNTERPART; CLASSICAL SYSTEMS; COMPUTATIONAL POWER; COMPUTATIONAL SYSTEM; QUANTUM AUTOMATA; QUANTUM COMPUTING; QUANTUM FINITE AUTOMATA;

COMPUTATION THEORY;

EID: 84974715268     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (4)

1. C.H. Bennett. Logical reversibility of computation. IBM J. Res. Dev., 17:525-532, 1973.
2. A. Brodosky and N. Pippenger. Characterization of 1-way quantum finite automata, Preprint quant-ph\990301.
3. E. Fredkin T. Toffoli. Conservative Logic. Int. J. Theor. Phys. 21:219-253, 1982.
4. A. Kondacs and J. Watrous. On the power of quantum finite state automata. In Proc. 38th FOCS, pages 66–75, 1997.