Decidable and undecidable problems about quantum automata

SIAM Journal on Computing

Volumn 34, Issue 6, 2005, Pages 1464-1473

  Blondel, Vincent D ^a   Jeandel, Emmanuel ^b   Koiran, Pascal ^b   Portier, Natacha ^b  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

Algebraic groups; Probabilistic automata; Quantum automata; Undecidable problems

Indexed keywords

ALGEBRAIC GROUPS; PROBABILISTIC AUTOMATA; QUANTUM AUTOMATA; UNDECIDABLE PROBLEMS;

ALGEBRA; AUTOMATA THEORY; PROBABILITY; PROBLEM SOLVING; QUANTUM THEORY; THRESHOLD ELEMENTS;

COMPUTABILITY AND DECIDABILITY;

EID: 29344474483     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703425861     Document Type: Article

References (26)

1. [AI99] M. AMANO AND K. IWAMA, Undecidability on quantum finite automata, in Proceedings of the 31st ACM Symposium on Theory of Computing, ACM, New York, 1999, pp. 368-375.
2. [BBC+95] A. BARENCO, C. H. BENNETT, R. CLEVE, D. P. DIVINCENZO, N. H. MARGOLUS, P. W. SHOR, T. SLEATOR, J. A. SMOLIN, AND H. WEINFURTER, Elementary gates for quantum computation, Phys. Rev. A, 52 (1995), pp. 3457-3467.
3. [BPR96] S. BASU, R. POLLACK, AND M.-F. ROY, On the combinatorial and algebraic complexity of quantifier elimination, J. ACM, 43 (1996), pp. 1002-1045.
4. [BC03] V. D. BLONDEL AND V. CANTERINI, Undecidable problems for probabilistic automata of fixed dimension, Theory Comput. Syst., 36 (2003), pp. 231-245.
5. [Ber75] A. BERTONI, The solution of problems relative to probabilistic automata in the frame of the formal languages theory, in Vierte Jahrestagung der Gesellschaft für Informatik, Lecture Notes in Comput. Sci. 26, Springer, Berlin, 1975, pp. 107-112.
6. [BMT77] A. BERTONI, G. MAURI, AND M. TORELLI, Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata, in Proceedings of the 4th International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 52, Springer, Berlin, 1977, pp. 87-94.
7. [BP02] A. BRODSKY AND N. PIPPENGER, Characterizations of 1-way quantum finite automata, SIAM J. Comput., 31 (2002), pp. 1456-1478.
8. [BT97] V. D. BLONDEL AND J. N. TSITSIKLIS, When is a pair of matrices mortal?, Inform. Process. Lett., 63 (1997), pp. 283-286.
9. [CLO92] D. COX, J. LITTLE, AND D. O'SHEA, Ideals, Varieties, and Algorithms, Undergrad. Texts Math., Springer, New York, 1992.
10. [DBE95] D. DEUTSCH, A. BARENCO, AND A. K. EKERT, Universality in quantum computation, Proc. Roy. Soc. London Ser. A, 449 (1995), pp. 669-677.
11. [DJK03] H. DERKSEN, E. JEANDEL, AND P. KOIRAN, Quantum automata and algebraic groups, J. Symbolic Comput., 39 (2005), pp. 357-371.
12. [Jea02] E. JEANDEL, Indécidabilité sur les automates quantiques, Master's Thesis, 2002; available online from http://perso.ens-lyon. fr/emmanuel.jeandel/publis.html.
13. [KW97] A. KONDACS AND J. WATROUS, On the power of quantum finite state automata, in Proceedings of the 38th Annual Symposium on Foundations of Computer Science, IEEE, Los Alamitos, 1997, pp. 66-75.
14. [MC00] C. MOORE AND J. CRUTCHFIELD, Quantum automata and quantum grammars, Theoret. Comput. Sci., 237 (2000), pp. 257-306.
15. [MS05] Y. MATIYASEVICH AND G. SÉNIZERGUES, Decision problems for semi-Thue systems with a few rules, Theoret. Comput. Sci., 330 (2005), pp. 145-169.
16. [OV90] A. ONISHCHIK AND E. VINBERG, Lie Groups and Algebraic Groups, Springer, Berlin, 1990.
17. [Paz71] A. PAZ, Introduction to Probabilistic Automata, Academic Press, New York, 1971.
18. [Pos46] E. L. POST, A variant of a recursively unsolvable problem, Bull. Amer. Math. Soc., 52 (1946), pp. 264-268.
19. [Rab63] M. O. RABIN, Probabilistic automata, Inform. Control, 6 (1963), pp. 230-245.
20. [Rab67] M. O. RABIN, Mathematical theory of automata, in Proc. Sympos. Appl. Math. 19, AMS, Providence, RI, 1967, pp. 153-175.
21. [Ren92a] J. RENEGAR, On the computational complexity and geometry of the first-order theory of the reals. I, J. Symbolic Comput., 13 (1992), pp. 255-299.
22. [Ren92b] J. RENEGAR, On the computational complexity and geometry of the first-order theory of the reals. II, J. Symbolic Comput., 13 (1992), pp. 301-327.
23. [Ren92c] J. RENEGAR, On the computational complexity and geometry of the first-order theory of the reals. III, J. Symbolic Comput., 13 (1992), pp. 329-352.
24. [Su90] F. E. SU, The Banach-Tarski Paradox, Minor Thesis, 1990.
25. [Sw58] S. SWIERCZKOWSKI, On a free group of rotations of the Euclidean space, Nederl. Akad. Wetensch. Proc. Ser. A, 20 (1958), pp. 376-378.
26. [Sw94] S. SWIERCZKOWSKI, A class of free rotation groups, Indag. Math. (N.S.), 5 (1994), pp. 221-226.