Probabilistic and quantum finite automata with postselection

Details Probabilistic and quantum finite automata with postselection Probabilistic and quantum finite automata with postselection

2011-02-03

arxiv.org/abs/1102.0666v1

Computer Science

Computational Complexity

24 pages. A preliminary version of this paper appeared in the Proceedings of Randomized and Quantum Computation (satellite wor

Scientific paper

We prove that endowing a real-time probabilistic or quantum computer with the ability of postselection increases its computational power. For this purpose, we provide a new model of finite automata with postselection, and compare it with the model of L\={a}ce et al. We examine the related language classes, and also establish separations between the classical and quantum versions, and between the zero-error vs. bounded-error modes of recognition in this model.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-427723