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

Complexity of Promise Problems on Classical and Quantum Automata

Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano

Published Jan 1, 2014• 22 citations
Publisher
DOI
10.1007/978-3-319-13350-8_12

Related papers

Classical and Quantum Counter Automata on Promise Problems

Masaki Nakanishi, Abuzer Yakaryılmaz

Lecture notes in computer science•Jan 1, 2015•13 citations

Promise problems solved by quantum and classical finite automata

Shenggen Zheng, Lvzhou Li, Daowen Qiu +1 more

arXiv:1411.3870•Theoretical Computer Science•Jan 4, 2017•14 citations

Unary Probabilistic and Quantum Automata on Promise Problems

Aida Gainutdinova, Abuzer Yakaryılmaz

Lecture notes in computer science•Jan 1, 2015•16 citations

Unary probabilistic and quantum automata on promise problems

Aida Gainutdinova, Abuzer Yakaryılmaz

Quantum Information Processing•Dec 26, 2017•22 citations

Superiority of exact quantum automata for promise problems

Andris Ambainis, Abuzer Yakaryılmaz

arXiv:1101.3837•Information Processing Letters•Jan 5, 2012•59 citations

State complexity of one-way quantum finite automata together with classical states

Ligang Xiao, Daowen Qiu

Journal of Computer and System Sciences•May 2, 2025•2 citations