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

Theoretical Computer Science

State succinctness of two-way finite automata with quantum and classical states

Shenggen Zheng, Daowen Qiu, Jozef Gruska, Lvzhou Li, Paulo Mateus

Published Jun 14, 2013• 29 citations
Publisher
DOI
10.1016/j.tcs.2013.06.005

Related papers

Two-way finite automata with quantum and classical states

Andris Ambainis, John Watrous

arXiv:cs/9911009•Theoretical Computer Science•Sep 1, 2002•169 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

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•33 citations

State complexity of one-way quantum finite automata together with classical states

Ligang Xiao, Daowen Qiu

Journal of Computer and System Sciences•May 2, 2025•2 citations

The State Complexity of Two-Way Quantum Finite Automata

Marcos Villagra, Tomoyuki Yamakami

電子情報通信学会技術研究報告. COMP, コンピュテーション•Oct 1, 2014•0 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•9 citations