Abstract
Since a quantum computational system is a generalization of a classical computational system, its computational power should be greater or equal than that of the classical system. In spite of that the computational power of 1-way quantum finite automata has been shown to be smaller than that of their classical counterpart. I argue that this paradox lies on the ground that the currently accepted definition of quantum automaton neglects the concept of quantum reversibility. In this article I review the role that reversibility plays into quantum computing and I propose a new model of 1-way quantum finite automata whose computational power is at least equal to that of classical automata.
This work is for the most part based on my degree thesis. I particularly tank my supervisor, Prof. Giuseppe Trautteur, and my co-supervisor, Prof. Vincenzo R. Marigliano, both at the Dipartimento di Scienze Fisiche dell’Università di Napoli “Federico II”.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C.H. Bennett. Logical reversibility of computation. IBM J. Res. Dev., 17:525–532, 1973.
A. Brodosky and N. Pippenger. Characterization of 1-way quantum finite automata, Preprint quant-ph-990301.
E. Fredkin T. Toffoli. Conservative Logic. Int. J. Theor. Phys. 21:219–253, 1982.
A. Kondacs and J. Watrous. On the power of quantum finite state automata. In Proc. 38th FOCS, pages 66–75, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ciamarra, M.P. (2001). Quantum Reversibility and a New Model of Quantum Automaton. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_36
Download citation
DOI: https://doi.org/10.1007/3-540-44669-9_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42487-1
Online ISBN: 978-3-540-44669-9
eBook Packages: Springer Book Archive