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:quant-ph/0309080 · Lecture notes in computer science

The Complexity of Probabilistic versus Quantum Finite Automata

Gatis Midrijānis

Published Jan 1, 2002• 0 citations
arXivHTMLPDF
DOI
10.1007/3-540-36137-5_21

Related papers

Quantum versus Probabilistic One-Way Finite Automata with Counter

Richard Bonner, Rūsiņš Freivalds, Maksim Kravtsev

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

On the complexity of minimizing probabilistic and quantum automata

Paulo Mateus, Daowen Qiu, Lvzhou Li

Information and Computation•Jul 20, 2012•32 citations

The State Complexity of Two-Way Quantum Finite Automata

Marcos Villagra, Tomoyuki Yamakami

電子情報通信学会技術研究報告. COMP, コンピュテーション•Oct 1, 2014•0 citations

On the State Complexity of Semi-quantum Finite Automata

Shenggen Zheng, Jozef Gruska, Daowen Qiu

Lecture notes in computer science•Jan 1, 2014•10 citations

Size of Quantum Versus Deterministic Finite Automata.

Andris Ambainis, Uldis Barbans, Agnese Belousova +7 more

IEEE Transactions on Very Large Scale Integration (VLSI) Systems•Jan 1, 2003•1 citation

Probabilistic Reversible Automata and Quantum Automata

Marats Golovkins, Maksim Kravtsev

Lecture notes in computer science•Jan 1, 2002•27 citations