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

Theoretical Computer Science

Efficient probability amplification in two-way quantum finite automata

Abuzer Yakaryılmaz, A. C. Cem Say

Published Feb 24, 2009• 16 citations
Publisher
DOI
10.1016/j.tcs.2009.01.029

Related papers

On the space efficiency of one way quantum finite automata

Andris Ambainis, Ashwin Nayak, Umesh V. Vazirani

•Apr 21, 1998•2 citations

The State Complexity of Two-Way Quantum Finite Automata

Marcos Villagra, Tomoyuki Yamakami

電子情報通信学会技術研究報告. COMP, コンピュテーション•Oct 1, 2014•0 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

Determining the equivalence for one-way quantum finite automata

Lvzhou Li, Daowen Qiu

Theoretical Computer Science•Apr 2, 2008•50 citations

A minimization algorithm of 1-way quantum finite automata

Olga Siedlecka-Lamch

Metody Informatyki Stosowanej•Jan 1, 2010•0 citations

Revisiting the Power and Equivalence of One-Way Quantum Finite Automata

Lvzhou Li, Daowen Qiu

Lecture notes in computer science•Jan 1, 2010•3 citations