Decidable and undecidable problems about quantum automata

Details Decidable and undecidable problems about quantum automata Decidable and undecidable problems about quantum automata

2003-04-11

arxiv.org/abs/quant-ph/0304082v1

Physics

Quantum Physics

10 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Decidable and undecidable problems about quantum automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decidable and undecidable problems about quantum automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decidable and undecidable problems about quantum automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-411489