Exact results for accepting probabilities of quantum automata

Details Exact results for accepting probabilities of quantum automata Exact results for accepting probabilities of quantum automata

2001-09-26

arxiv.org/abs/quant-ph/0109136v2

Theoretical Computer Science, 295(2003):3-25

Physics

Quantum Physics

26 pages, 4 figures, submitted to Theoretical Computer Science (earlier version at STACS'01)

Scientific paper

One of the properties of Kondacs-Watrous model of quantum finite automata (QFA) is that the probability of the correct answer for a QFA cannot be amplified arbitrarily. In this paper, we determine the maximum probabilities achieved by QFAs for several languages. In particular, we show that any language that is not recognized by an RFA (reversible finite automaton) can be recognized by a QFA with probability at most 0.7726...

Affiliated with

Also associated with

No associations

Rating

Exact results for accepting probabilities of 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 Exact results for accepting probabilities of quantum automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact results for accepting probabilities of quantum automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-635587