Computer Science – Computational Complexity
Scientific paper
2010-07-21
Computer Science
Computational Complexity
A preliminary version of this paper appeared in the Proceedings of the Fourth International Computer Science Symposium in Russ
Scientific paper
We prove the following facts about the language recognition power of quantum Turing machines (QTMs) in the unbounded error setting: QTMs are strictly more powerful than probabilistic Turing machines for any common space bound $ s $ satisfying $ s(n)=o(\log \log n) $. For "one-way" Turing machines, where the input tape head is not allowed to move left, the above result holds for $s(n)=o(\log n) $. We also give a characterization for the class of languages recognized with unbounded error by real-time quantum finite automata (QFAs) with restricted measurements. It turns out that these automata are equal in power to their probabilistic counterparts, and this fact does not change when the QFA model is augmented to allow general measurements and mixed states. Unlike the case with classical finite automata, when the QFA tape head is allowed to remain stationary in some steps, more languages become recognizable. We define and use a QTM model that generalizes the other variants introduced earlier in the study of quantum space complexity.
Cem Say A. C.
Yakaryilmaz Abuzer
No associations
LandOfFree
Unbounded-error quantum computation with small space bounds 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 Unbounded-error quantum computation with small space bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unbounded-error quantum computation with small space bounds will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-183723