Affiliation:
1. University of Turku, Finland
Abstract
In this paper, a model for finite automaton with an open quantum evolution is introduced, and its basic properties are studied. It is shown that the (fuzzy) languages accepted by open evolution quantum automata obey various closure properties. More importantly, it is shown that major other models of finite automata, including probabilistic, measure once quantum, measure many quantum, and Latvian quantum automata can be simulated by the open quantum evolution automata without increasing the number of the states.
Reference28 articles.
1. Ablayev, F., & Gainutdinova, A. (2000). On the Lower Bounds for One-Way Quantum Automata (LNCS 1893, pp. 132-140). New York: Springer.
2. Algebraic Results on Quantum Automata
3. Ambainis, A., Bonner, R. F., Freivalds, R., & Kikusts, A. (1999). Probabilities to Accept Languages by Quantum Finite Automata. In Proceedings of the International Computing and Combinatorics Conference (COCOON) (pp. 174-185).
4. Ambainis, A., & Freivalds, R. (1998). 1-way quantum finite automata: strengths, weaknesses and generalizations. In Proceedings of the 39th FOCS (pp. 376-383).
5. Exact results for accepting probabilities of quantum automata
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献