Decidable and Undecidable Problems about Quantum Automata

Authors:
Vincent D. Blondel;Emmanuel Jeandel;Pascal Koiran;Natacha Portier
Affiliations:
-;-;-;-
Venue:
SIAM Journal on Computing
Year:
2005

Citing 0
Cited 13

Determining the equivalence for one-way quantum finite automata

Theoretical Computer Science
Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Various Aspects of Finite Quantum Automata

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Reachability problems in quaternion matrix and rotation semigroups

Information and Computation
Note: A note on quantum sequential machines

Theoretical Computer Science
Quantum automata and algebraic groups

Journal of Symbolic Computation
On the joint spectral radius for bounded matrix languages

RP'10 Proceedings of the 4th international conference on Reachability problems
Behaviours of Unary Quantum Automata

Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Unbounded-error quantum computation with small space bounds

Information and Computation
Quantum computation with write-only memory

Natural Computing: an international journal
Reachability problems in quaternion matrix and rotation semigroups

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Decision Problems for Probabilistic Finite Automata on Bounded Languages

Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
Proving the Power of Postselection

Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the following decision problem: is the language recognized by a quantum finite automaton empty or nonempty? We prove that this problem is decidable or undecidable depending on whether recognition is defined by strict or nonstrict thresholds. This result is in contrast with the corresponding situation for probabilistic finite automata, for which it is known that strict and nonstrict thresholds both lead to undecidable problems.