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:2105.06184 · Lecture notes in computer science

Implementing Quantum Finite Automata Algorithms on Noisy Devices

Utku Birkan, Özlem Salehi, Viktor Olejár, Cem Nurlu, Abuzer Yakaryılmaz

Published Jan 1, 2021• 13 citations
arXivHTMLPDF
DOI
10.1007/978-3-030-77980-1_1

Related papers

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

Quantum Implementation of Finite State Automata

Varun Puram, Krishnageetha Karuppasamy, K. M. George +1 more

Lecture notes in networks and systems•Jan 1, 2025•0 citations

A minimization algorithm of 1-way quantum finite automata

Olga Siedlecka-Lamch

Metody Informatyki Stosowanej•Jan 1, 2010•0 citations

Shallow implementation of quantum fingerprinting with application to quantum finite automata

Mansur Ziatdinov, Aliya Khadieva, Kamil Ravilevich Khadiev

Quantum fingerprinting is a technique that maps a classical input word to a quantum state. The obtained quantum state is much shorter than the original word, and its processing uses fewer resources, making it useful in quantum algorithms, communication, and cryptography. One of the examples of quantum fingerprinting is the quantum automata algorithm for M O D p = { a i · p ∣ i ≥ 0 } languages, where p is a prime number. However, implementing such an automaton on current quantum hardware is not efficient. Quantum fingerprinting maps a word x ∈{0, 1} n of length n to a state |ψ( x )〉 of O (log n ) qubits, and uses O ( n ) unitary operations. Computing quantum fingerprint using all available qubits of the current quantum computers is infeasible due to many quantum operations. To make quantum fingerprinting practical, we should optimize the circuit for depth instead of width, in contrast to the previous works. We propose explicit methods of quantum fingerprinting based on tools from additive combinatorics, such as generalized arithmetic progressions (GAPs), and prove that these methods provide circuit depth comparable to a probabilistic method. We also compare our method to prior work on explicit quantum fingerprinting methods. We provide a series of numerical experiments with implementation of the quantum automata for MOD 17 language on noisy simulators of IBMQ quantum devices. We show that shallow implementation based on GAPs produces results with much smaller computational error compared to standard deep circuit implementation. Despite the fact that on the ideal quantum computational device, the opposite situation arises. We show that the shallow circuit for the quantum automaton is better for near-future quantum computational devices.

arXiv:2412.18823•Frontiers in Computer Science•May 16, 2025•10 citations

Simulations of Quantum Finite Automata

Gustaw Lippa, Krzysztof Makieła, Marcin Kuta

Lecture notes in computer science•Jan 1, 2020•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
Quantum fingerprinting is a technique that maps a classical input word to a quantum state. The obtained quantum state is much shorter than the original word, and its processing uses fewer resources, making it useful in quantum algorithms, communication, and cryptography. One of the examples of quantum fingerprinting is the quantum automata algorithm for M O D p = { a i · p ∣ i ≥ 0 } languages, where p is a prime number. However, implementing such an automaton on current quantum hardware is not efficient. Quantum fingerprinting maps a word x ∈{0, 1} n of length n to a state |ψ( x )〉 of O (log n ) qubits, and uses O ( n ) unitary operations. Computing quantum fingerprint using all available qubits of the current quantum computers is infeasible due to many quantum operations. To make quantum fingerprinting practical, we should optimize the circuit for depth instead of width, in contrast to the previous works. We propose explicit methods of quantum fingerprinting based on tools from additive combinatorics, such as generalized arithmetic progressions (GAPs), and prove that these methods provide circuit depth comparable to a probabilistic method. We also compare our method to prior work on explicit quantum fingerprinting methods. We provide a series of numerical experiments with implementation of the quantum automata for MOD 17 language on noisy simulators of IBMQ quantum devices. We show that shallow implementation based on GAPs produces results with much smaller computational error compared to standard deep circuit implementation. Despite the fact that on the ideal quantum computational device, the opposite situation arises. We show that the shallow circuit for the quantum automaton is better for near-future quantum computational devices.
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.