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:0809.0073

Languages recognized with unbounded error by quantum finite automata

Abuzer Yakaryılmaz, A. C. Cem Say

Published Aug 30, 2008• 4 citations
arXivHTMLPDF

Abstract

This paper has been superseded by arXiv:1007.3624
DOI
10.48550/arxiv.0809.0073

Related papers

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

Small size quantum automata recognizing some regular languages

Alberto Bertoni, Carlo Mereghetti, Beatrice Palano

Theoretical Computer Science•Apr 19, 2005•31 citations

Language recognition by generalized quantum finite automata with unbounded error (abstract & poster)

Abuzer Yakaryılmaz, A. C. Cem Say

In this note, we generalize the results of arXiv:0901.2703v1 We show that all one-way quantum finite automaton (QFA) models that are at least as general as Kondacs-Watrous QFA's are equivalent in power to classical probabilistic finite automata in this setting. Unlike their probabilistic counterparts, allowing the tape head to stay put for some steps during its traversal of the input does enlarge the class of languages recognized by such QFA's with unbounded error. (Note that, the proof of Theorem 1 in the abstract was presented in the previous version (arXiv:0901.2703v1).)

arXiv:0901.2703•Jan 18, 2009•2 citations

Languages Recognizable by Quantum Finite Automata

Rūsiņš Freivalds

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

Language Recognition by Generalized Quantum Finite Automata with Unbounded Error

Abuzer Yakaryılmaz, A. C. Cem Say

Abstract. We prove that the class of languages recognized by generalized quantum finite automata (GQFA’s) with unbounded error equals the class of stochastic languages. The capability of performing additional intermediate projective measurements does not increase the recognition power of GQFA’s over Kondacs-Watrous quantum finite automata in this setting. Unlike their probabilistic counterparts, allowing the tape head to stay put for some steps during its traversal of the input enlarges the class of languages recognized by GQFA’s with unbounded error. 1

•Jan 18, 2009•6 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
In this note, we generalize the results of arXiv:0901.2703v1 We show that all one-way quantum finite automaton (QFA) models that are at least as general as Kondacs-Watrous QFA's are equivalent in power to classical probabilistic finite automata in this setting. Unlike their probabilistic counterparts, allowing the tape head to stay put for some steps during its traversal of the input does enlarge the class of languages recognized by such QFA's with unbounded error. (Note that, the proof of Theorem 1 in the abstract was presented in the previous version (arXiv:0901.2703v1).)
Abstract. We prove that the class of languages recognized by generalized quantum finite automata (GQFA’s) with unbounded error equals the class of stochastic languages. The capability of performing additional intermediate projective measurements does not increase the recognition power of GQFA’s over Kondacs-Watrous quantum finite automata in this setting. Unlike their probabilistic counterparts, allowing the tape head to stay put for some steps during its traversal of the input enlarges the class of languages recognized by GQFA’s with unbounded error. 1