Quantum Finite State Transducers

We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features with probabilistic finite state transducers, especially regarding undecidability of emptiness (at least for low probability of success). However, like their 'little brothers', the quantum finite automata, the power of qfst is incomparable to that of their probabilistic counterpart. This we show by discussing a number of characteristic examples.

[1]  John Watrous,et al.  On the power of quantum finite state automata , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[2]  Dana S. Scott.  Some Definitional Suggestions for Automata Theory , 1967, J. Comput. Syst. Sci..

[3]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[4]  John G. Kemeny,et al.  Finite Markov Chains. , 1960 .

[5]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[6]  Kazuo Iwama,et al.  Undecidability on quantum finite automata , 1999, STOC '99.

[7]  Eitan M. Gurari,et al.  Introduction to the theory of computation , 1989 .

[8]  Andris Ambainis,et al.  1-way quantum finite automata: strengths, weaknesses and generalizations , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).