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

De Gruyter eBooks

Chapter 8 Quantum computing in automata theory

G. Ignisha Rajathi, R. Vedhapriyavadhana, R. Niranjana, N. Pooranam, R. Johny Elton

Published Aug 7, 2023• 3 citations
Publisher

Abstract

In the contemporary era we dwell in, every now and then, new technologies are developed by master brains such as researchers and scientists. This also paves the way to discover replacements to classical computers. One such progression among the great inventions is the essence of quantum computing. They are brought to light for the purpose of solving problems and scenarios solved by classical computers but in a more effective way and in the least span of time. The study of quantum computing focuses on finding new ways to compute by using quantum physics phenomena. A qubit, in contrast to a typical computer bit, can be either 0 or 1, or it can be a superposition of both 0 and 1. Quantum theory commemorates with automata theory, thereby formulating quantum finite automata. Quantum finite automaton, or basically a deterministic finite automaton, is one of the simplest models of computation, which is an input-driven model, which takes an input, and according to the input, we just read the machine, and it changes its state. This proves that any quantum finite automata are completely capable of recognizing languages like Tally with given cut point too. Such languages recognized by a cut point, by quantum finite automata, are called stochastic languages. It further collaborates with the chemical industry with its qubit power over molecular collide, interactive models, and collaborative string processing using nonregular languages.

DOI
10.1515/9783110791402-008

Related papers

Quantum automata and quantum computing

Marats Golovkins

Quantum finite automata were introduced by C.Moore and J.P.Crutchfield in [MC 97] and by A.Kondacs and J.Watrous in [KW 97]. This notion is not a generalization of the deterministic finite automata, but rather a generalization of deterministic reversible (permutation) automata. In [AF 98] A.Ambainis and R.Freivalds raised the question what kind of probabilistic automata can be viewed as a special case of quantum finite automata. To answer that question and study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We give the necessary condition for a language to be recognized by PRA. We find that there is a strong relationship between different possible models of PRA and corresponding models of quantum finite automata. In these thesis we regard quantum automata, probabilistic reversible and deterministic reversible automata as reversible automata. At least two non-equivalent definitions of language recognition are used for one-way reversible finite automata in various papers. Both of these definitions have their own advantages and disadvantages, summarized in our classification of one-way reversible automata. Further, we introduce a notion of quantum finite multitape automata and prove that there is a language recognized by a quantum finite multitape automaton but not by deterministic finite multitape automata. Additionally we discover unexpected probabilistic automata recognizing complicated languages. Finally, we revise the concept of quantum pushdown automata (QPA), first introduced by C.Moore and J.P.Cruthchfield in [MC 97]. We give the definition of QPA in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [KW 97]. It is established that the unitary criteria of QPA are not equivalent to the corresponding unitary criteria of quantum Turing machines [BV 97]. We show that QPA can recognize every regular language. We also present some simple non-context-free languages recognized by QPA (hence not recognizable by deterministic and nondeterministic pushdown automata).

•Jan 1, 2002•0 citations

Guest Column: Quantum Finite Automata: From Theory to Practice

Carlo Mereghetti, Beatrice Palano

Quantum computing is a prolific research area, halfway between physics and computer science [27, 29, 52]. Most likely, its origins may be dated back to 70's, when some works on quantum information began to appear (see, e.g., [34, 37]). In early 80's, R.P. Feynman suggested that the computational power of quantum mechanical processes might be beyond that of traditional computation models [25]. Almost at the same time, P. Benioff already proved that such processes are at least as powerful as Turing machines [9]. In 1985, D. Deutsch [22] proposed the notion of a quantum Turing machine as a physically realizable model for a quantum computer. From the point of view of structural complexity, E. Bernstein and U. Vazirani introduced in [20] the class BQP of problems solvable in polynomial time on quantum Turing machines, focusing attention on relations with the corresponding deterministic and probabilistic classes P and BPP, respectively. Several works in the literature explored classical issues in complexity theory from the quantum paradigm perspective (see, e.g., [7, 60, 61]).

ACM SIGACT News•Oct 17, 2021•4 citations

Quantum finite automata: survey, status and research directions

Amandeep Singh Bhatia, Ajay Kumar

Quantum computing is concerned with computer technology based on the principles of quantum mechanics, with operations performed at the quantum level. Quantum computational models make it possible to analyze the resources required for computations. Quantum automata can be classified thusly: quantum finite automata, quantum sequential machine, quantum pushdown automata, quantum Turing machine and orthomodular lattice-valued automata. These models are useful for determining the expressive power and boundaries of various computational features. In light of the current state of quantum computation theory research, a systematic review of the literature seems timely. This article seeks to provide a comprehensive and systematic analysis of quantum finite automata models, quantum finite automata models with density operators and quantum finite automata models with classical states, interactive proof systems, quantum communication complexity and query complexity as described in the literature. The statistics of quantum finite automata related papers are shown and open problems are identified for more advanced research. The current status of quantum automata theory is distributed into various categories. This research work also highlights the previous research, current status and future directions of quantum automata models.

arXiv:1901.07992•Jan 23, 2019•18 citations

Quantum Computing

Suraj Ghadge

Abstract: Quantum computing is a new type of computing that uses the principles of quantum physics to perform calculations in ways that are not possible with traditional computers. Unlike classical computers, which process information using bits that are either 0 or 1, quantum computers use quantum bits (qubits) that can exist in multiple states at the same time. This ability allows quantum systems to solve certain complex problems much faster than classical machines. This paper presents a simple and human-centered explanation of quantum computing, focusing on how it works, why it matters, and how it can be applied in real-world situations. The study discusses key concepts such as superposition, entanglement, and quantum gates using easy-to-understand language. It also explores practical applications including cryptography, optimization, drug discovery, and material simulation. In addition, this paper examines the current challenges in quantum computing, such as hardware instability, error correction, limited qubit scalability, and high implementation cost. A conceptual hybrid classical–quantum system model is proposed to show how quantum and classical computers can work together to solve complex problems more efficiently. The goal of this research is to make quantum computing more understandable to students, educators, and decision-makers, and to encourage early awareness and responsible development of this powerful technology. Keywords — quantum computing, qubit, superposition, entanglement, quantum gate, error correction, hybrid computing

International Scientific Journal of Engineering and Management•Dec 17, 2025•0 citations

Chapter 12 Quantum computing: application-specific need of the hour

R. Vedhapriyavadhana, G. Ignisha Rajathi, R. Niranjana +1 more

In this tech-savvy era, as new technologies are developed every day by researchers and scientists, this also paves way to discover replacements to classical computers. One such advancement is the uncovering of quantum computing. They are brought up to light for the purpose of solving problems and scenarios solved by classical computers but in a more effective way and at least a span of time. The study of quantum computing focuses on finding new ways to compute by utilizing quantum physics phenomena. A qubit, in contrast to a typical computer bit, can be either 0 or 1, or it can be a superposition of both 0 and 1. Quantum theory serving as the base to operate supercomputers is based on two aspects of quantum physics: superposition and entanglement. This quantum computing plays extraordinary roles in different zones of applications such as weather forecasting, logistics, finance, healthcare, and cybersecurity. They are discussed with clarity in this chapter by throwing bright light on these important inevitable topics.

De Gruyter eBooks•Aug 7, 2023•2 citations

Automata and quantum computing

Andris Ambainis, Abuzer Yakaryılmaz

Quantum computing is a new model of computation, based on quantum physics.Quantum computers can be exponentially faster than conventional computers for problems such as factoring.Besides full-scale quantum computers, more restricted models such as quantum versions of finite automata have been studied.In this paper, we survey various models of quantum finite automata and their properties.We also provide some open questions and new directions for researchers.

•Aug 6, 2021•2 citations
In the contemporary era we dwell in, every now and then, new technologies are developed by master brains such as researchers and scientists. This also paves the way to discover replacements to classical computers. One such progression among the great inventions is the essence of quantum computing. They are brought to light for the purpose of solving problems and scenarios solved by classical computers but in a more effective way and in the least span of time. The study of quantum computing focuses on finding new ways to compute by using quantum physics phenomena. A qubit, in contrast to a typical computer bit, can be either 0 or 1, or it can be a superposition of both 0 and 1. Quantum theory commemorates with automata theory, thereby formulating quantum finite automata. Quantum finite automaton, or basically a deterministic finite automaton, is one of the simplest models of computation, which is an input-driven model, which takes an input, and according to the input, we just read the machine, and it changes its state. This proves that any quantum finite automata are completely capable of recognizing languages like Tally with given cut point too. Such languages recognized by a cut point, by quantum finite automata, are called stochastic languages. It further collaborates with the chemical industry with its qubit power over molecular collide, interactive models, and collaborative string processing using nonregular languages.
Quantum finite automata were introduced by C.Moore and J.P.Crutchfield in [MC 97] and by A.Kondacs and J.Watrous in [KW 97]. This notion is not a generalization of the deterministic finite automata, but rather a generalization of deterministic reversible (permutation) automata. In [AF 98] A.Ambainis and R.Freivalds raised the question what kind of probabilistic automata can be viewed as a special case of quantum finite automata. To answer that question and study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We give the necessary condition for a language to be recognized by PRA. We find that there is a strong relationship between different possible models of PRA and corresponding models of quantum finite automata. In these thesis we regard quantum automata, probabilistic reversible and deterministic reversible automata as reversible automata. At least two non-equivalent definitions of language recognition are used for one-way reversible finite automata in various papers. Both of these definitions have their own advantages and disadvantages, summarized in our classification of one-way reversible automata. Further, we introduce a notion of quantum finite multitape automata and prove that there is a language recognized by a quantum finite multitape automaton but not by deterministic finite multitape automata. Additionally we discover unexpected probabilistic automata recognizing complicated languages. Finally, we revise the concept of quantum pushdown automata (QPA), first introduced by C.Moore and J.P.Cruthchfield in [MC 97]. We give the definition of QPA in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [KW 97]. It is established that the unitary criteria of QPA are not equivalent to the corresponding unitary criteria of quantum Turing machines [BV 97]. We show that QPA can recognize every regular language. We also present some simple non-context-free languages recognized by QPA (hence not recognizable by deterministic and nondeterministic pushdown automata).
Quantum computing is a prolific research area, halfway between physics and computer science [27, 29, 52]. Most likely, its origins may be dated back to 70's, when some works on quantum information began to appear (see, e.g., [34, 37]). In early 80's, R.P. Feynman suggested that the computational power of quantum mechanical processes might be beyond that of traditional computation models [25]. Almost at the same time, P. Benioff already proved that such processes are at least as powerful as Turing machines [9]. In 1985, D. Deutsch [22] proposed the notion of a quantum Turing machine as a physically realizable model for a quantum computer. From the point of view of structural complexity, E. Bernstein and U. Vazirani introduced in [20] the class BQP of problems solvable in polynomial time on quantum Turing machines, focusing attention on relations with the corresponding deterministic and probabilistic classes P and BPP, respectively. Several works in the literature explored classical issues in complexity theory from the quantum paradigm perspective (see, e.g., [7, 60, 61]).
Quantum computing is concerned with computer technology based on the principles of quantum mechanics, with operations performed at the quantum level. Quantum computational models make it possible to analyze the resources required for computations. Quantum automata can be classified thusly: quantum finite automata, quantum sequential machine, quantum pushdown automata, quantum Turing machine and orthomodular lattice-valued automata. These models are useful for determining the expressive power and boundaries of various computational features. In light of the current state of quantum computation theory research, a systematic review of the literature seems timely. This article seeks to provide a comprehensive and systematic analysis of quantum finite automata models, quantum finite automata models with density operators and quantum finite automata models with classical states, interactive proof systems, quantum communication complexity and query complexity as described in the literature. The statistics of quantum finite automata related papers are shown and open problems are identified for more advanced research. The current status of quantum automata theory is distributed into various categories. This research work also highlights the previous research, current status and future directions of quantum automata models.
Abstract: Quantum computing is a new type of computing that uses the principles of quantum physics to perform calculations in ways that are not possible with traditional computers. Unlike classical computers, which process information using bits that are either 0 or 1, quantum computers use quantum bits (qubits) that can exist in multiple states at the same time. This ability allows quantum systems to solve certain complex problems much faster than classical machines. This paper presents a simple and human-centered explanation of quantum computing, focusing on how it works, why it matters, and how it can be applied in real-world situations. The study discusses key concepts such as superposition, entanglement, and quantum gates using easy-to-understand language. It also explores practical applications including cryptography, optimization, drug discovery, and material simulation. In addition, this paper examines the current challenges in quantum computing, such as hardware instability, error correction, limited qubit scalability, and high implementation cost. A conceptual hybrid classical–quantum system model is proposed to show how quantum and classical computers can work together to solve complex problems more efficiently. The goal of this research is to make quantum computing more understandable to students, educators, and decision-makers, and to encourage early awareness and responsible development of this powerful technology. Keywords — quantum computing, qubit, superposition, entanglement, quantum gate, error correction, hybrid computing
In this tech-savvy era, as new technologies are developed every day by researchers and scientists, this also paves way to discover replacements to classical computers. One such advancement is the uncovering of quantum computing. They are brought up to light for the purpose of solving problems and scenarios solved by classical computers but in a more effective way and at least a span of time. The study of quantum computing focuses on finding new ways to compute by utilizing quantum physics phenomena. A qubit, in contrast to a typical computer bit, can be either 0 or 1, or it can be a superposition of both 0 and 1. Quantum theory serving as the base to operate supercomputers is based on two aspects of quantum physics: superposition and entanglement. This quantum computing plays extraordinary roles in different zones of applications such as weather forecasting, logistics, finance, healthcare, and cybersecurity. They are discussed with clarity in this chapter by throwing bright light on these important inevitable topics.