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:0911.3266 · Theoretical Computer Science

Characterizations of one-way general quantum finite automata

Lvzhou Li, Daowen Qiu, Xiangfu Zou, Lvjun Li, Lihua Wu, Paulo Mateus

Published Nov 1, 2011• 38 citations
arXivHTMLPDF
DOI
10.1016/j.tcs.2011.10.021

Related papers

Determining the equivalence for one-way quantum finite automata

Lvzhou Li, Daowen Qiu

arXiv:quant-ph/0703087•Theoretical Computer Science•Apr 2, 2008•50 citations

Revisiting the Power and Equivalence of One-Way Quantum Finite Automata

Lvzhou Li, Daowen Qiu

Lecture notes in computer science•Jan 1, 2010•3 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

Quantum one-way automata and finitely generated groups

Eric M. Freden

Contemporary mathematics - American Mathematical Society•Jan 1, 2002•0 citations

One-Way Quantum Finite Automata and Advice (Preliminary Version)

Tomoyuki Yamakami

情報処理学会研究報告アルゴリズム(AL)•Nov 20, 2009•0 citations

Two-way finite automata with quantum and classical states

Andris Ambainis, John Watrous

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