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

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Size of Quantum Versus Deterministic Finite Automata.

Andris Ambainis, Uldis Barbans, Agnese Belousova, Aleksandrs Belovs, Ilze Dzelme-Bērziņa, Girts Folkmanis, Rūsiņš Freivalds, Pēteris Lediņš, Rihards Opmanis, Agnis Škuškovniks

Published Jan 1, 2003• 1 citation
OpenAlex

Related papers

Quantum versus deterministic counter automata

Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai

Theoretical Computer Science•Sep 8, 2004•24 citations

Quantum versus Deterministic Counter Automata

Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai

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

The Complexity of Probabilistic versus Quantum Finite Automata

Gatis Midrijānis

arXiv:quant-ph/0309080•Lecture notes in computer science•Jan 1, 2002•0 citations

On the Power of Non-deterministic Quantum Finite Automata

Tsunehiro Yoshinaga

IEICE Transactions on Information and Systems•Feb 1, 2002•7 citations

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

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