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/9904066 · Lecture notes in computer science

Probabilities to Accept Languages by Quantum Finite Automata

Andris Ambainis, Richard Bonner, Rūsiņš Freivalds, Arnolds Ķikusts

Published Jan 1, 1999• 35 citations
arXivHTMLPDF
DOI
10.1007/3-540-48686-0_17

Related papers

Regular Languages Accepted by Quantum Automata

Alberto Bertoni, Marco Carpentieri

Information and Computation•Mar 1, 2001•54 citations

Exact results for accepting probabilities of quantum automata

Andris Ambainis, Arnolds Ķikusts

Theoretical Computer Science•Feb 1, 2003•20 citations

Exact Results for Accepting Probabilities of Quantum Automata

Andris Ambainis, Arnolds Ķikusts

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

Lower Bounds on the Size of Quantum Automata Accepting Unary Languages

Alberto Bertoni, Carlo Mereghetti, Beatrice Palano

Lecture notes in computer science•Jan 1, 2003•8 citations

Languages Recognizable by Quantum Finite Automata

Rūsiņš Freivalds

Lecture notes in computer science•Jan 1, 2006•5 citations

Languages Recognized with Unbounded Error by Quantum Finite Automata

Abuzer Yakaryılmaz, A. C. Cem Say

Lecture notes in computer science•Jan 1, 2009•30 citations