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 networks and systems

Quantum Implementation of Finite State Automata

Varun Puram, Krishnageetha Karuppasamy, K. M. George, Johnson P. Thomas

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.1007/978-3-031-92608-2_23

Related papers

Quantum Finite State Automata

Jarosław Adam Miszczak

Synthesis lectures on quantum computing•Jan 1, 2012•0 citations

Mathematical logic and quantum finite state automata

Ilze Dzelme-Bērziņa

Theoretical Computer Science•Mar 1, 2009•6 citations

A Representative Framework for Implementing Quantum Finite Automata on Real Devices

Aliya Khadieva, Özlem Salehi, Abuzer Yakaryılmaz

arXiv:2406.11360•Lecture notes in computer science•Jan 1, 2024•9 citations

Implementing Quantum Finite Automata Algorithms on Noisy Devices

Utku Birkan, Özlem Salehi, Viktor Olejár +2 more

arXiv:2105.06184•Lecture notes in computer science•Jan 1, 2021•13 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

Quantum finite automata

Jozef Gruska

•Jan 1, 2006•0 citations
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.