Resumen de Quantum automata and algebraic groups

Harm Derksen, Pascal Koiran, Emmanuel Jeandel

• 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.