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

AIP conference proceedings

Recent Trend of Development in Quantum Finite Automata

Soumya Debabrata Pani, Chandan Kumar Behera, Dipankar Home, Guruprasad Kar, Archan S. Majumda

Published Jan 1, 2011• 0 citations
Publisher
DOI
10.1063/1.3635857

Related papers

Various Aspects of Finite Quantum Automata

Mika Hirvensalo

Lecture notes in computer science•Jan 1, 2008•31 citations

Finite automata models of quantized systems: conceptual status and outlook

Karl Svozil

Since Edward Moore, finite automata theory has been inspired by physics, in particular by quantum complementarity. We review automaton complementarity, reversible automata and the connections to generalized urn models. Recent developments in quantum information theory may have appropriate formalizations in the automaton context.

arXiv:quant-ph/0209089•Sep 15, 2002•0 citations

Simulations of Quantum Finite Automata

Gustaw Lippa, Krzysztof Makieła, Marcin Kuta

Lecture notes in computer science•Jan 1, 2020•0 citations

The class of languages recognizable by 1-way quantum finite automata is not closed under union

Māris Valdats

In this paper we develop little further the theory of quantum finite automata (QFA). There are already few properties of QFA known, that deterministic and probabilistic finite automata do not have e.g. they cannot recognize all regular languages. In this paper we show, that class of languages recognizable by QFA is not closed under union, even not under any Boolean operation, where both arguments are significant.

arXiv:quant-ph/0001005•Jan 4, 2000•3 citations

QUANTUM FINITE AUTOMATA

Jozef Gruska, Roland Vollmar

International Colloquium on Words, Languages and Combinatorics•Jul 1, 2003•0 citations

Empowering measures for quantum finite automata (QFA)

Soumya Debabrata Pani, Chandan Kumar Behera

The 1-way quantum finite automata and 2-way quantum finite automata are the first ever developed quantum automatons. But they suffer from many disadvantages which make them less powerful and impracticable. To remove these drawbacks there are many ways to modify and aggrandize the quantum finite automatons. Including 1-counter with 1-way QFA significantly improve its power. Likely quantum finite automata with quantum and classical states (QCFA) and 2-way quantum finite 1-counter automata (2-QF1-CA) are the quintessence of these modifications. In our paper we first discuss about 1-QFA and 2-QFA and their drawbacks. In the section IV we introduce an algorithm by implementing 1-way quantum finite k-counter automata (1-QFk-CA). Then we discuss another algorithm by implementing quantum finite 1-counter automata (QF1-CA) with multiple scanning of the input string. These algorithms improve the power of QFAs.

International Conference on Computer Research and Development•Mar 1, 2011•1 citation
The 1-way quantum finite automata and 2-way quantum finite automata are the first ever developed quantum automatons. But they suffer from many disadvantages which make them less powerful and impracticable. To remove these drawbacks there are many ways to modify and aggrandize the quantum finite automatons. Including 1-counter with 1-way QFA significantly improve its power. Likely quantum finite automata with quantum and classical states (QCFA) and 2-way quantum finite 1-counter automata (2-QF1-CA) are the quintessence of these modifications. In our paper we first discuss about 1-QFA and 2-QFA and their drawbacks. In the section IV we introduce an algorithm by implementing 1-way quantum finite k-counter automata (1-QFk-CA). Then we discuss another algorithm by implementing quantum finite 1-counter automata (QF1-CA) with multiple scanning of the input string. These algorithms improve the power of QFAs.