Unbounded-error quantum computation with small space bounds

Abstract

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.

A preliminary version of this paper appeared in the Proceedings of the Fourth International Computer Science Symposium in Russia, pages 356--367, 2009

References in corpus (5)

• Unbounded-error quantum computation with small space bounds
• Exponential Separation of Quantum and Classical Online Space Complexity
• Probabilistic and quantum finite automata with postselection
• Classical and quantum computation with small space bounds (PhD thesis)
• A Quantum Time-Space Lower Bound for the Counting Hierarchy

Cited by in corpus (29)

• Unbounded-error quantum computation with small space bounds
• Superiority of exact quantum automata for promise problems
• Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
• On the state complexity of semi-quantum finite automata
• Quantum computation with devices whose contents are never read
• Affine computation and affine automaton
• On hybrid models of quantum finite automata
• Potential of quantum finite automata with exact acceptance
• Quantum counter automata
• Finite state verifiers with constant randomness
• Quantum finite automata: survey, status and research directions
• Language recognition power and succintness of affine automata
• Probabilistic and quantum finite automata with postselection
• Classical and quantum computation with small space bounds (PhD thesis)
• Computation with narrow CTCs
• Turing-equivalent automata using a fixed-size quantum memory
• Exponentially more concise quantum recognition of non-RMM regular languages
• One-way finite automata with quantum and classical states
• State succinctness of two-way finite automata with quantum and classical states
• Some Languages Recognized by Two-Way Finite Automata with Quantum and Classical States
• Quantum Logarithmic Space and Post-selection
• Characterizations of one-way general quantum finite automata
• New results on classical and quantum counter automata
• Finite automata with advice tapes
• Quantum Pushdown Automata with a Garbage Tape
• Alternating, private alternating, and quantum alternating realtime automata
• On equivalence, languages equivalence and minimization of multi-letter and multi-letter measure-many quantum automata
• Undecidability of MM-QFAs Language Equivalence Problem
• The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints