On the power of quantum finite state automata
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Logical reversibility of computation
IBM Journal of Research and Development
Automata: From Uncertainty to Quantum
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Lower Bounds for Generalized Quantum Finite Automata
Language and Automata Theory and Applications
Improved Constructions of Quantum Automata
Theory of Quantum Computation, Communication, and Cryptography
Quantum computation with devices whose contents are never read
UC'10 Proceedings of the 9th international conference on Unconventional computation
Languages recognized by nondeterministic quantum finite automata
Quantum Information & Computation
Characterizations of one-way general quantum finite automata
Theoretical Computer Science
Superiority of exact quantum automata for promise problems
Information Processing Letters
Quantum computation with write-only memory
Natural Computing: an international journal
Quantum automata theory – a review
Algebraic Foundations in Computer Science
| Hi-index | 0.00 |
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.