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

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Quantum state transition diagram: a bridge from classical computing to quantum computing

Loyd R. Hook, Sam Lee

Published Mar 25, 2010• 2 citations
Publisher

Abstract

Very few papers have been written on the topic of a quantum version of the finite state machine, (or finite state automata). Furthermore, these papers only serve to define what a quantum finite state machine might be in the mathematical sense using the early languages of Turing machines. This paper seeks to further develop the notion of a quantum finite state machine (FSM) using constructs developed for the classical FSM and utilized for classical FSM design. In particular the quantum state transition diagram (QSTD) is constructed to further the understanding and realization of quantum finite state machines and quantum computers.

DOI
10.1117/12.847450

Related papers

State transition diagrams for a universal quantum gate set

Anuradha Mahasinghe, Ayodhya Liyanage

A quantum Turing machine (QTM) is an abstract model of computing that serves as the quantum counterpart of a classical Turing machine. Closely related to the probabilistic Turing machine, a QTM utilises quantum effects such as superposition, entanglement and unitary evolution. Despite its historical role as a framework for devising quantum algorithms and the significance of its classical counterpart in theoretical computing, very little attention has been paid in literature to the state transition of QTM’s for basic quantum gates. In this paper, we construct the state transition diagrams for a set of elementary quantum gates that consists of the Hadamard, CNOT, and T gates, providing a universal basis for fault tolerant quantum computation. We verify the necessary conditions to ensure that the designed state transition diagrams comply with the postulates of quantum mechanics, verifying their well formedness.

JUCS - Journal of Universal Computer Science•Mar 23, 2026•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

Algorithm to build quantum circuit from classical description of DFSM

Varun Puram, Dingyi Kang, K. M. George +1 more

There are several papers that define quantum finite automaton analogous to classical finite automaton. Some papers describe the power of quantum automaton. In general, in quantum automata unitary matrices are associated to input symbols. Even though quantum circuits (or unitary matrices) are shown in specific cases, there is no general method given to construct a circuit or unitary matrix is found in the literature. This research focuses on construction of unitary matrices for each input symbol from the classical definition of a Deterministic Finite State Machine (DFSM). An algorithm is developed to associate a quantum circuit to an input symbol which considered as a mapping of classical DFSM states. IBM quantum composer is used to design circuits and build examples.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•2 citations

Simulation of finite state machines in a quantum computer

Michael R. Dunlavey

A construction is given for simulating any deterministic finite state machine (FSM) on a quantum computer in a space-efficient manner. By constructing a superposition of input strings of lengths K or less, questions can be asked about the FSM, such as the inputs that reach particular nodes, and the answers can be found using a search algorithm such as Grover's. This has implications for the eventual utility of quantum computers for software validation.

arXiv:quant-ph/9807026•Jul 9, 1998•5 citations

Quantum Representation for Deterministic Push-Down Automata

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

There are many papers presenting quantum computing models. The definitions parallel the classical definitions of finite state automata, push-down automata, context-free grammars, etc. Classical computing model definitions define languages precisely. We can state that a string belongs to a language or does not belong to it with no room for error. Quantum definitions do not possess this certainty. Sacrificing the certainty and adopting a quantum definition of a computing model does not appear to provide any concrete power to the model. Therefore, the path of this paper is to begin from the classical definition and end in a quantum circuit. In this paper, we start from a deterministic push-down automaton (DPDA). We present circuits for state transition and stack operations. The circuits presented can be viewed as independent algorithms. As an example, the approach used to construct the circuit for state transition can be utilized to build the circuit for a function presented as a Boolean matrix.

Electronics•Nov 18, 2024•0 citations
Very few papers have been written on the topic of a quantum version of the finite state machine, (or finite state automata). Furthermore, these papers only serve to define what a quantum finite state machine might be in the mathematical sense using the early languages of Turing machines. This paper seeks to further develop the notion of a quantum finite state machine (FSM) using constructs developed for the classical FSM and utilized for classical FSM design. In particular the quantum state transition diagram (QSTD) is constructed to further the understanding and realization of quantum finite state machines and quantum computers.
A quantum Turing machine (QTM) is an abstract model of computing that serves as the quantum counterpart of a classical Turing machine. Closely related to the probabilistic Turing machine, a QTM utilises quantum effects such as superposition, entanglement and unitary evolution. Despite its historical role as a framework for devising quantum algorithms and the significance of its classical counterpart in theoretical computing, very little attention has been paid in literature to the state transition of QTM’s for basic quantum gates. In this paper, we construct the state transition diagrams for a set of elementary quantum gates that consists of the Hadamard, CNOT, and T gates, providing a universal basis for fault tolerant quantum computation. We verify the necessary conditions to ensure that the designed state transition diagrams comply with the postulates of quantum mechanics, verifying their well formedness.
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.
There are several papers that define quantum finite automaton analogous to classical finite automaton. Some papers describe the power of quantum automaton. In general, in quantum automata unitary matrices are associated to input symbols. Even though quantum circuits (or unitary matrices) are shown in specific cases, there is no general method given to construct a circuit or unitary matrix is found in the literature. This research focuses on construction of unitary matrices for each input symbol from the classical definition of a Deterministic Finite State Machine (DFSM). An algorithm is developed to associate a quantum circuit to an input symbol which considered as a mapping of classical DFSM states. IBM quantum composer is used to design circuits and build examples.
There are many papers presenting quantum computing models. The definitions parallel the classical definitions of finite state automata, push-down automata, context-free grammars, etc. Classical computing model definitions define languages precisely. We can state that a string belongs to a language or does not belong to it with no room for error. Quantum definitions do not possess this certainty. Sacrificing the certainty and adopting a quantum definition of a computing model does not appear to provide any concrete power to the model. Therefore, the path of this paper is to begin from the classical definition and end in a quantum circuit. In this paper, we start from a deterministic push-down automaton (DPDA). We present circuits for state transition and stack operations. The circuits presented can be viewed as independent algorithms. As an example, the approach used to construct the circuit for state transition can be utilized to build the circuit for a function presented as a Boolean matrix.