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

World Scientific proceedings series on computer engineering and information science

THE PRODUCT OF QUANTUM AUTOMATA

Zhi–Wen Mo, QING-LEI CHEN, Jun Liu

Published Oct 1, 2012• 0 citations
Publisher

Abstract

In this paper we want to establish the multiplication theory of quantum automata(orthomodular lattice-valued automata). According this theory, we kan construct complex quantum automata. First we give the definition of direct product, cascading product and ring product. Then we discuss the basic properties of them. At last, we give the form of the language that can be recognized by product quantum automata.

DOI
10.1142/9789814417747_0106

Related papers

Weak Commutativity of Quantum Automata

Feidan Huang, Fasheng Cao

Weak commutativity of quantum automata and weak commutativity of generalized quantum automata are defined. Weak commutativity of (generalized) quantum automata is discussed, and weak commutativity of general direct product, full direct product, restricted direct product, cascade product and wreath product of (generalized) quantum automata are studied, and several necessary and sufficient conditions of weak commutativity of some products of (generalized) quantum automata are obtained.

International Conference on Advances in Computer Technology, Information Science and Communications (CTISC)•Apr 1, 2021•2 citations

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

Chapter 8 Quantum computing in automata theory

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

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.

De Gruyter eBooks•Aug 7, 2023•3 citations

Some Properties of Quantum Languages

Guo Xiu-hong

Tensor product of two automata over the different alphabets is defined in this paper and quantum languages accepted by the tensor product are studied. Quantum languages and generalized quantum languages are discussed. Some of their properties are derived.

Journal of Sichuan Normal University•Jan 1, 2005•0 citations

Tensor product of quantum logics

Sylvia Pulmannová

A quantum logic is the couple (L,M) where L is an orthomodular σ-lattice and M is a strong set of states on L. The Jauch–Piron property in the σ-form is also supposed for any state of M. A ‘‘tensor product’’ of quantum logics is defined. This definition is compared with the definition of a free orthodistributive product of orthomodular σ-lattices. The existence and uniqueness of the tensor product in special cases of Hilbert space quantum logics and one quantum and one classical logic are studied.

Journal of Mathematical Physics•Jan 1, 1985•43 citations

Quantum automata for infinite periodic words

Konstantinos Giannakis, Christos Papalitsas, Theodore Andronikos

Quantum computing defines the use of quantum mechanics in the computation process. Given that Moore's law is about to reach its physical limits, it is natural to search for new technologies and computation models. The need for mechanisms and verification processes for infinite quantum computation will draw the attention of the research community. Potential applications of the proposed automata concern the verification of quantum systems and the design of appropriate quantum circuits. In the present work we define a quantum version of ω-automata, the periodic quantum automata that are able to efficiently recognize ω-languages of the form (amb)ω, where m is a finite number. We present our definitions through examples and figures. Even if our definition is simple, yet it has several interesting and useful properties. For example, they seem to be space efficient for periodic ω-languages of the form (amb)ω.

International Conference on Information, Intelligence, Systems & Applications (IISA)•Jul 1, 2015•10 citations
In this paper we want to establish the multiplication theory of quantum automata(orthomodular lattice-valued automata). According this theory, we kan construct complex quantum automata. First we give the definition of direct product, cascading product and ring product. Then we discuss the basic properties of them. At last, we give the form of the language that can be recognized by product quantum automata.
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).
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.
A quantum logic is the couple (L,M) where L is an orthomodular σ-lattice and M is a strong set of states on L. The Jauch–Piron property in the σ-form is also supposed for any state of M. A ‘‘tensor product’’ of quantum logics is defined. This definition is compared with the definition of a free orthodistributive product of orthomodular σ-lattices. The existence and uniqueness of the tensor product in special cases of Hilbert space quantum logics and one quantum and one classical logic are studied.
Quantum computing defines the use of quantum mechanics in the computation process. Given that Moore's law is about to reach its physical limits, it is natural to search for new technologies and computation models. The need for mechanisms and verification processes for infinite quantum computation will draw the attention of the research community. Potential applications of the proposed automata concern the verification of quantum systems and the design of appropriate quantum circuits. In the present work we define a quantum version of ω-automata, the periodic quantum automata that are able to efficiently recognize ω-languages of the form (amb)ω, where m is a finite number. We present our definitions through examples and figures. Even if our definition is simple, yet it has several interesting and useful properties. For example, they seem to be space efficient for periodic ω-languages of the form (amb)ω.