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

Lower Bounds on the Size of Quantum Automata Accepting Unary Languages

Alberto Bertoni, Carlo Mereghetti, Beatrice Palano

Published Jan 1, 2003• 8 citations
Publisher
DOI
10.1007/978-3-540-45208-9_8

Related papers

Events and Languages on Unary Quantum Automata

Maria Paola Bianchi, Beatrice Palano

Non-Classical Models for Automata and Applications•Jan 1, 2009•3 citations

Size Lower Bounds for Quantum Automata

Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano

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

Size lower bounds for quantum automata

Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano

Theoretical Computer Science•Jul 15, 2014•16 citations

Probabilities to Accept Languages by Quantum Finite Automata

Andris Ambainis, Richard Bonner, Rūsiņš Freivalds +1 more

arXiv:quant-ph/9904066•Lecture notes in computer science•Jan 1, 1999•35 citations

Regular Languages Accepted by Quantum Automata

Alberto Bertoni, Marco Carpentieri

Information and Computation•Mar 1, 2001•54 citations