Quantum automata and algebraic groups

• Autores: Harm Derksen, Pascal Koiran, Emmanuel Jeandel
• Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 39, Nº 3, 2005, págs. 357-371
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • We show that several problems which are known to be undecidable for probabilistic automata become decidable for quantum finite automata. Our main tool is an algebraic result of independent interest: we give an algorithm which, given a finite number of invertible matrices, computes the Zariski closure of the group generated by these matrices.