Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1507.01346

Time-space tradeoffs for two-way finite automata

Shenggen Zheng, Daowen Qiu, Jozef Gruska

Published Jul 6, 2015• 2 citations
arXivHTMLPDF

Abstract

We explore bounds of {\em time-space tradeoffs} in language recognition on {\em two-way finite automata} for some special languages. We prove: (1) a time-space tradeoff upper bound for recognition of the languages $L_{EQ}(n)$ on {\em two-way probabilistic finite automata} (2PFA): $TS={\bf O}(n\log n)$, whereas a time-space tradeoff lower bound on {\em two-way deterministic finite automata} is ${\bf Ω}(n^2)$, (2) a time-space tradeoff upper bound for recognition of the languages $L_{INT}(n)$ on {\em two-way finite automata with quantum and classical states} (2QCFA): $TS={\bf O}(n^{3/2}\log n)$, whereas a lower bound on 2PFA is $TS={\bf Ω}(n^2)$, (3) a time-space tradeoff upper bound for recognition of the languages $L_{NE}(n)$ on exact 2QCFA: $TS={\bf O}(n^{1.87} \log n)$, whereas a lower bound on 2PFA is $TS={\bf Ω}(n^2)$. It has been proved (Klauck, STOC'00) that the exact one-way quantum finite automata have no advantage comparing to classical finite automata in recognizing languages. However, the result (3) shows that the exact 2QCFA do have an advantage in comparison with their classical counterparts, which has been the first example showing that the exact quantum computing have advantage in time-space tradeoff comparing to classical computing. Usually, two communicating parties, Alice and Bob, are supposed to have an access to arbitrary computational power in {\em communication complexity} model that is used. Instead of that we will consider communication complexity in such a setting that two parties are using only finite automata and we prove in this setting that quantum automata are better than classical automata and also probabilistic automata are better than deterministic automata for some well known tasks.

DOI
10.48550/arxiv.1507.01346

Related papers

Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and Sublogarithmic-Space Quantum Turing Machines

Zachary Remscrim

The two-way finite automaton with quantum and classical states (2QCFA), defined by Ambainis and Watrous, is a model of quantum computation whose quantum part is extremely limited; however, as they showed, 2QCFA are surprisingly powerful: a 2QCFA with only a single-qubit can recognize the language $L_{pal}=\{w \in \{a,b\}^*:w \text{ is a palindrome}\}$ with bounded error in expected time $2^{O(n)}$, on inputs of length $n$. We prove that their result essentially cannot be improved upon: a 2QCFA (of any size) cannot recognize $L_{pal}$ with bounded error in expected time $2^{o(n)}$. To our knowledge, this is the first example of a language that can be recognized with bounded error by a 2QCFA in exponential time but not in subexponential time. Moreover, we prove that a quantum Turing machine (QTM) running in space $o(\log n)$ and expected time $2^{n^{1-Ω(1)}}$ cannot recognize $L_{pal}$ with bounded error; again, this is the first lower bound of its kind. Far more generally, we establish a lower bound on the running time of any 2QCFA or $o(\log n)$-space QTM that recognizes any language $L$ in terms of a natural "hardness measure" of $L$. This allows us to exhibit a large family of languages for which we have asymptotically matching lower and upper bounds on the running time of any such 2QCFA or QTM recognizer.

arXiv:2003.09877•Leibniz international proceedings in informatics•Mar 22, 2020•7 citations

SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES

Shenggen Zheng, Daowen Qiu, Lvzhou Li

Two-way finite automata with quantum and classical states (2QCFA) were introduced by Ambainis and Watrous, and it was shown that 2QCFA have superiority over two-way probabilistic finite automata (2PFA) for recognizing some non-regular languages such as the language Leq = {anbn ∣ n ∈ N} and the palindrome language Lpal = {w ∈ {a,b}* ∣ w=wR}, where xR is x in the reverse order. It is interesting to find more languages like these that witness the superiority of 2QCFA over 2PFA. In this paper, we consider the language Lm = {xcy ∣ ∑ = {a,b,c},x,y ∈ {a,b}*, ∣x∣ = ∣y∣} that is similar to the middle language Lmiddle = {xay ∣ x,y ∈ {a,b}*, ∣x∣ = ∣y∣}. We prove that the language Lm show that Lm can be recognized by 2PFA with bounded error, but only in exponential expected time. Thus Lm is another witness of the fact that 2QCFA are more powerful than their classical counterparts.

arXiv:1112.2844•International Journal of Foundations of Computer Science•Aug 1, 2012•14 citations

The Power of a Single Qubit: Two-Way Quantum Finite Automata and the Word Problem

Zachary Remscrim

The two-way finite automaton with quantum and classical states (2QCFA), defined by Ambainis and Watrous, is a model of quantum computation whose quantum part is extremely limited; however, as they showed, 2QCFA are surprisingly powerful: a 2QCFA, with a single qubit, can recognize, with bounded error, the language $L_{eq}=\{a^m b^m :m \in \mathbb{N}\}$ in expected polynomial time and the language $L_{pal}=\{w \in \{a,b\}^*:w \text{ is a palindrome}\}$ in expected exponential time. We further demonstrate the power of 2QCFA by showing that they can recognize the word problems of many groups. In particular 2QCFA, with a single qubit and algebraic number transition amplitudes, can recognize, with bounded error, the word problem of any finitely generated virtually abelian group in expected polynomial time, as well as the word problems of a large class of linear groups in expected exponential time. This latter class (properly) includes all groups with context-free word problem. We also exhibit results for 2QCFA with any constant number of qubits. As a corollary, we obtain a direct improvement on the original Ambainis and Watrous result by showing that $L_{eq}$ can be recognized by a 2QCFA with better parameters. As a further corollary, we show that 2QCFA can recognize certain non-context-free languages in expected polynomial time. In a companion paper, we prove matching lower bounds, thereby showing that the class of languages recognizable with bounded error by a 2QCFA in expected $\mathit{subexponential}$ time is properly contained in the class of languages recognizable with bounded error by a 2QCFA in expected $\mathit{exponential}$ time.

arXiv:2003.09879•Leibniz international proceedings in informatics•Jan 1, 2020•4 citations

STATE SUCCINCTNESS OF TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES

Shenggen Zheng, Daowen Qiu, Lvzhou Li

Two-way quantum automata with quantum and classical states (2QCFA) were introduced by Ambainis and Watrous in 2002. In this paper we study state succinctness of 2QCFA. For any fix m ∈ ℤ + , we show that (1) there is a promise problem A meq which can be solved by 2QCFA in polynomial expected running time with one-sided error with constant numbers of quantum and classical states, whereas the sizes of the corresponding deterministic finite automata (DFA), two-way nondeterministic finite automata (2NFA) and polynomial expected running time two-way probabilistic finite automata (2PFA) are at least 2m + 2, and ; (2) there exists a language L mtwin which can be recognized by 2QCFA in exponential expected running time with one-sided error with constant numbers of quantum and classical states, whereas the sizes of the corresponding DFA, 2NFA and polynomial expected running time 2PFA are at least 2 m , and ; where b is a constant number.

International Conference on Quantitative Logic and Soft Computing (QLSC)•Apr 1, 2012•5 citations

Two-way nondeterministic finite automata with quantum and classical states and their limits

Jingnan Xie, Ching-Sheng Lin, Harry B. Hunt

Two-way finite automata with quantum and classical states (2QCFA’s), introduced by Ambainis and Watrous, extend deterministic two-way finite automata with a constant-size quantum register and provide a natural hybrid model of computation. In this paper, we introduce two-way nondeterministic finite automata with quantum and classical states (2QCNFA’s), extending this framework to the nondeterministic setting. We show that 2QCNFA’s are closed under union, intersection, and marked concatenation, and that they can recognize certain comparison languages whose status for 2QCFA’s remains open. We further initiate the study of decision problems for this model by proving that 2QCNFA’s can recognize the set of invalid computations of a deterministic Turing machine, which implies that the universality problem is undecidable. In addition, we investigate descriptional complexity, showing that there is no approximation algorithm for minimization between 2QCNFA’s and classical models such as DFA’s and context-free grammars, and that the corresponding trade-offs are non-recursive.

Information and Computation•Jun 25, 2026•0 citations

On the power of two-way multihead quantum finite automata

Amandeep Singh Bhatia, Ajay Kumar

This paper introduces a variant of two-way quantum finite automata named two-way multihead quantum finite automata. A two-way quantum finite automaton is more powerful than classical two-way finite automata. However, the generalizations of two-way quantum finite automata have not been defined so far as compared to one-way quantum finite automata model. We have investigated the newly introduced automata from two aspects: the language recognition capability and its comparison with classical and quantum counterparts. It has been proved that a language which cannot be recognized by any one-way and multi-letter quantum finite automata can be recognized by two-way quantum finite automata. Further, it has been shown that a language which cannot be recognized by two-way quantum finite automata can be recognized by two-way multihead quantum finite automata with two heads. Furthermore, it has been investigated that quantum variant of two-way deterministic multihead finite automata takes less number of heads to recognize a language containing of all words whose length is a prime number.

RAIRO - Theoretical Informatics and Applications•Jan 1, 2019•10 citations
We explore bounds of {\em time-space tradeoffs} in language recognition on {\em two-way finite automata} for some special languages. We prove: (1) a time-space tradeoff upper bound for recognition of the languages LEQ(n)L_{EQ}(n)LEQ​(n) on {\em two-way probabilistic finite automata} (2PFA): TS=O(nlog⁡n)TS={\bf O}(n\log n)TS=O(nlogn), whereas a time-space tradeoff lower bound on {\em two-way deterministic finite automata} is Ω(n2){\bf Ω}(n^2)Ω(n2), (2) a time-space tradeoff upper bound for recognition of the languages LINT(n)L_{INT}(n)LINT​(n) on {\em two-way finite automata with quantum and classical states} (2QCFA): TS=O(n3/2log⁡n)TS={\bf O}(n^{3/2}\log n)TS=O(n3/2logn), whereas a lower bound on 2PFA is TS=Ω(n2)TS={\bf Ω}(n^2)TS=Ω(n2), (3) a time-space tradeoff upper bound for recognition of the languages LNE(n)L_{NE}(n)LNE​(n) on exact 2QCFA: TS=O(n1.87log⁡n)TS={\bf O}(n^{1.87} \log n)TS=O(n1.87logn), whereas a lower bound on 2PFA is TS=Ω(n2)TS={\bf Ω}(n^2)TS=Ω(n2). It has been proved (Klauck, STOC'00) that the exact one-way quantum finite automata have no advantage comparing to classical finite automata in recognizing languages. However, the result (3) shows that the exact 2QCFA do have an advantage in comparison with their classical counterparts, which has been the first example showing that the exact quantum computing have advantage in time-space tradeoff comparing to classical computing. Usually, two communicating parties, Alice and Bob, are supposed to have an access to arbitrary computational power in {\em communication complexity} model that is used. Instead of that we will consider communication complexity in such a setting that two parties are using only finite automata and we prove in this setting that quantum automata are better than classical automata and also probabilistic automata are better than deterministic automata for some well known tasks.
The two-way finite automaton with quantum and classical states (2QCFA), defined by Ambainis and Watrous, is a model of quantum computation whose quantum part is extremely limited; however, as they showed, 2QCFA are surprisingly powerful: a 2QCFA with only a single-qubit can recognize the language Lpal={w∈{a,b}∗:w is a palindrome}L_{pal}=\{w \in \{a,b\}^*:w \text{ is a palindrome}\}Lpal​={w∈{a,b}∗:w is a palindrome} with bounded error in expected time 2O(n)2^{O(n)}2O(n), on inputs of length nnn. We prove that their result essentially cannot be improved upon: a 2QCFA (of any size) cannot recognize LpalL_{pal}Lpal​ with bounded error in expected time 2o(n)2^{o(n)}2o(n). To our knowledge, this is the first example of a language that can be recognized with bounded error by a 2QCFA in exponential time but not in subexponential time. Moreover, we prove that a quantum Turing machine (QTM) running in space o(log⁡n)o(\log n)o(logn) and expected time 2n1−Ω(1)2^{n^{1-Ω(1)}}2n1−Ω(1) cannot recognize LpalL_{pal}Lpal​ with bounded error; again, this is the first lower bound of its kind. Far more generally, we establish a lower bound on the running time of any 2QCFA or o(log⁡n)o(\log n)o(logn)-space QTM that recognizes any language LLL in terms of a natural "hardness measure" of LLL. This allows us to exhibit a large family of languages for which we have asymptotically matching lower and upper bounds on the running time of any such 2QCFA or QTM recognizer.
Two-way finite automata with quantum and classical states (2QCFA) were introduced by Ambainis and Watrous, and it was shown that 2QCFA have superiority over two-way probabilistic finite automata (2PFA) for recognizing some non-regular languages such as the language Leq = {anbn ∣ n ∈ N} and the palindrome language Lpal = {w ∈ {a,b}* ∣ w=wR}, where xR is x in the reverse order. It is interesting to find more languages like these that witness the superiority of 2QCFA over 2PFA. In this paper, we consider the language Lm = {xcy ∣ ∑ = {a,b,c},x,y ∈ {a,b}*, ∣x∣ = ∣y∣} that is similar to the middle language Lmiddle = {xay ∣ x,y ∈ {a,b}*, ∣x∣ = ∣y∣}. We prove that the language Lm show that Lm can be recognized by 2PFA with bounded error, but only in exponential expected time. Thus Lm is another witness of the fact that 2QCFA are more powerful than their classical counterparts.
The two-way finite automaton with quantum and classical states (2QCFA), defined by Ambainis and Watrous, is a model of quantum computation whose quantum part is extremely limited; however, as they showed, 2QCFA are surprisingly powerful: a 2QCFA, with a single qubit, can recognize, with bounded error, the language Leq={ambm:m∈N}L_{eq}=\{a^m b^m :m \in \mathbb{N}\}Leq​={ambm:m∈N} in expected polynomial time and the language Lpal={w∈{a,b}∗:w is a palindrome}L_{pal}=\{w \in \{a,b\}^*:w \text{ is a palindrome}\}Lpal​={w∈{a,b}∗:w is a palindrome} in expected exponential time. We further demonstrate the power of 2QCFA by showing that they can recognize the word problems of many groups. In particular 2QCFA, with a single qubit and algebraic number transition amplitudes, can recognize, with bounded error, the word problem of any finitely generated virtually abelian group in expected polynomial time, as well as the word problems of a large class of linear groups in expected exponential time. This latter class (properly) includes all groups with context-free word problem. We also exhibit results for 2QCFA with any constant number of qubits. As a corollary, we obtain a direct improvement on the original Ambainis and Watrous result by showing that LeqL_{eq}Leq​ can be recognized by a 2QCFA with better parameters. As a further corollary, we show that 2QCFA can recognize certain non-context-free languages in expected polynomial time. In a companion paper, we prove matching lower bounds, thereby showing that the class of languages recognizable with bounded error by a 2QCFA in expected subexponential\mathit{subexponential}subexponential time is properly contained in the class of languages recognizable with bounded error by a 2QCFA in expected exponential\mathit{exponential}exponential time.
Two-way quantum automata with quantum and classical states (2QCFA) were introduced by Ambainis and Watrous in 2002. In this paper we study state succinctness of 2QCFA. For any fix m ∈ ℤ + , we show that (1) there is a promise problem A meq which can be solved by 2QCFA in polynomial expected running time with one-sided error with constant numbers of quantum and classical states, whereas the sizes of the corresponding deterministic finite automata (DFA), two-way nondeterministic finite automata (2NFA) and polynomial expected running time two-way probabilistic finite automata (2PFA) are at least 2m + 2, and ; (2) there exists a language L mtwin which can be recognized by 2QCFA in exponential expected running time with one-sided error with constant numbers of quantum and classical states, whereas the sizes of the corresponding DFA, 2NFA and polynomial expected running time 2PFA are at least 2 m , and ; where b is a constant number.
Two-way finite automata with quantum and classical states (2QCFA’s), introduced by Ambainis and Watrous, extend deterministic two-way finite automata with a constant-size quantum register and provide a natural hybrid model of computation. In this paper, we introduce two-way nondeterministic finite automata with quantum and classical states (2QCNFA’s), extending this framework to the nondeterministic setting. We show that 2QCNFA’s are closed under union, intersection, and marked concatenation, and that they can recognize certain comparison languages whose status for 2QCFA’s remains open. We further initiate the study of decision problems for this model by proving that 2QCNFA’s can recognize the set of invalid computations of a deterministic Turing machine, which implies that the universality problem is undecidable. In addition, we investigate descriptional complexity, showing that there is no approximation algorithm for minimization between 2QCNFA’s and classical models such as DFA’s and context-free grammars, and that the corresponding trade-offs are non-recursive.
This paper introduces a variant of two-way quantum finite automata named two-way multihead quantum finite automata. A two-way quantum finite automaton is more powerful than classical two-way finite automata. However, the generalizations of two-way quantum finite automata have not been defined so far as compared to one-way quantum finite automata model. We have investigated the newly introduced automata from two aspects: the language recognition capability and its comparison with classical and quantum counterparts. It has been proved that a language which cannot be recognized by any one-way and multi-letter quantum finite automata can be recognized by two-way quantum finite automata. Further, it has been shown that a language which cannot be recognized by two-way quantum finite automata can be recognized by two-way multihead quantum finite automata with two heads. Furthermore, it has been investigated that quantum variant of two-way deterministic multihead finite automata takes less number of heads to recognize a language containing of all words whose length is a prime number.