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

Lecture notes in computer science

Upper Bounds on the Size of One-Way Quantum Finite Automata

Carlo Mereghetti, Beatrice Palano

Published Jan 1, 2001• 4 citations
Publisher
DOI
10.1007/3-540-45446-2_8

Related papers

Lower bounds on the size of semi-quantum finite automata

Lvzhou Li, Daowen Qiu

arXiv:1502.02839•Theoretical Computer Science•Oct 24, 2015•5 citations

On the Lower Bounds for One-Way Quantum Automata

Farid Mansurovich Ablayev, Aida Gainutdinova

Lecture notes in computer science•Jan 1, 2000•26 citations

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

Characterizations of one-way general quantum finite automata

Lvzhou Li, Daowen Qiu, Xiangfu Zou +3 more

arXiv:0911.3266•Theoretical Computer Science•Nov 1, 2011•38 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

Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata

Takeshi Koshiba

Lecture notes in computer science•Jan 1, 2001•11 citations