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

Bulletin of the American Physical Society

Comparing Classical And Quantum Finite Automata

Kaitlin Gili, Rudy Raymond, Rodney Van Meter, Kohei M. Itoh

Published Mar 5, 2019• 0 citations
OpenAlex

Related papers

Two-way finite automata with quantum and classical states

Andris Ambainis, John Watrous

arXiv:cs/9911009•Theoretical Computer Science•Sep 1, 2002•177 citations

One-Way Finite Automata with Quantum and Classical States

Shenggen Zheng, Daowen Qiu, Lvzhou Li +1 more

arXiv:1112.2022•Lecture notes in computer science•Jan 1, 2012•37 citations

Two-Tape Finite Automata with Quantum and Classical States

Shenggen Zheng, Lvzhou Li, Daowen Qiu

arXiv:1104.3634•International Journal of Theoretical Physics•Nov 30, 2010•10 citations

Promise problems solved by quantum and classical finite automata

Shenggen Zheng, Lvzhou Li, Daowen Qiu +1 more

arXiv:1411.3870•Theoretical Computer Science•Jan 4, 2017•15 citations

Some Observations on Two-Way Finite Automata with Quantum and Classical States

Daowen Qiu

arXiv:quant-ph/0701187•Lecture notes in computer science•Jan 1, 2008•13 citations

Time-space tradeoffs for two-way finite automata

Shenggen Zheng, Daowen Qiu, Jozef Gruska

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.

arXiv:1507.01346•Jul 6, 2015•2 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.