Abstract
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.
Cite
CITATION STYLE
Freivalds, R., & Winter, A. (2001). Quantum finite state transducers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2234, pp. 233–242). Springer Verlag. https://doi.org/10.1007/3-540-45627-9_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
