Decidable and undecidable problems about quantum automata
Quantum Physics
2007-05-23 v1
Abstract
We study the following decision problem: is the language recognized by a quantum finite automaton empty or non-empty? We prove that this problem is decidable or undecidable depending on whether recognition is defined by strict or non-strict thresholds. This result is in contrast with the corresponding situation for probabilistic finite automata for which it is known that strict and non-strict thresholds both lead to undecidable problems.
Keywords
Cite
@article{arxiv.quant-ph/0304082,
title = {Decidable and undecidable problems about quantum automata},
author = {Vincent D. Blondel and Emmanuel Jeandel and Pascal Koiran and Natacha Portier},
journal= {arXiv preprint arXiv:quant-ph/0304082},
year = {2007}
}
Comments
10 pages