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

International Conference on Advances in Computer Technology, Information Science and Communications (CTISC)

Weak Commutativity of Quantum Automata

Feidan Huang, Fasheng Cao

Published Apr 1, 2021• 1 citation
Publisher

Abstract

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.

DOI
10.1109/ctisc52352.2021.00019

Related papers

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

On the class of languages recognizable by 1-way quantum finite automata

Andris Ambainis, Arnolds Ķikusts, Māris Valdats

It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.

arXiv:quant-ph/0009004•Sep 1, 2000•6 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. Keywords: quantum finite automata, probabilistic finite automata, nondeterminism, bounded error, unbounded error, state complexity, decidability and undecidability, computational complexity

EMS Press eBooks•Sep 13, 2021•33 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. Keywords: quantum finite automata, probabilistic finite automata, nondeterminism, bounded error, unbounded error, state complexity, decidability and undecidability, computational complexity

arXiv:1507.01988•Jul 7, 2015•16 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

Non-Clifford quantum cellular automata from invertible topological quantum field theories

Meng Sun, Zongyuan Wang, Bowen Yang +2 more

Quantum cellular automata (QCAs) describe locality-preserving quantum dynamics and link quantum information, many-body physics, and topological quantum field theory (TQFT). Constructing a QCA from a TQFT, however, remains challenging: although a topological action yields a Hamiltonian with commuting terms that realizes the desired ground state, it does not by itself specify an automorphism of the full operator algebra. We develop a unified algebraic construction that extends such Hamiltonians to complete separator-flipper algebras on the full tensor-product Hilbert space, thereby defining the corresponding QCAs microscopically. In 3 spatial dimensions, our framework unifies all previously known QCA constructions associated with the $\mathbb{Z}_8\times\mathbb{Z}_2$ subgroup of the Witt group, including the $U(1)_2$ and $U(1)_4$ QCAs. The same algebraic structure yields new infinite families of generalized $U(1)_2$ and $U(1)_4$ non-Clifford QCAs in spatial dimensions $d=4k-1$. We also reformulate the 4-dimensional $w_2w_3$ QCA and use it to construct QCAs from TQFTs associated with arbitrary products of Stiefel--Whitney classes. For example, we explicitly construct two infinite families: $w_2^nw_3^m$ QCAs in dimension $d=2n+3m-1$ and $w_2w_{4k-1}$ QCAs in dimension $d=4k$. For the 5-dimensional $w_3^2$ and $w_2^3$ QCAs, our construction gives finite-depth quantum circuits, consistent with the cobordism classification. More generally, we show that our construction yields a finite-depth quantum circuit whenever the corresponding Stiefel-Whitney number vanishes on every closed oriented manifold. Overall, these results convert invertible TQFTs into microscopic QCAs, provide higher-dimensional constructions beyond the Clifford setting, and open a systematic route to characterizing their stable structures and boundary anomalies.

quant-pharXiv:2607.21697•Jul 27, 2026•0 citations
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.
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. Keywords: quantum finite automata, probabilistic finite automata, nondeterminism, bounded error, unbounded error, state complexity, decidability and undecidability, computational complexity
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. Keywords: quantum finite automata, probabilistic finite automata, nondeterminism, bounded error, unbounded error, state complexity, decidability and undecidability, computational complexity
Quantum cellular automata (QCAs) describe locality-preserving quantum dynamics and link quantum information, many-body physics, and topological quantum field theory (TQFT). Constructing a QCA from a TQFT, however, remains challenging: although a topological action yields a Hamiltonian with commuting terms that realizes the desired ground state, it does not by itself specify an automorphism of the full operator algebra. We develop a unified algebraic construction that extends such Hamiltonians to complete separator-flipper algebras on the full tensor-product Hilbert space, thereby defining the corresponding QCAs microscopically. In 3 spatial dimensions, our framework unifies all previously known QCA constructions associated with the Z8×Z2\mathbb{Z}_8\times\mathbb{Z}_2Z8​×Z2​ subgroup of the Witt group, including the U(1)2U(1)_2U(1)2​ and U(1)4U(1)_4U(1)4​ QCAs. The same algebraic structure yields new infinite families of generalized U(1)2U(1)_2U(1)2​ and U(1)4U(1)_4U(1)4​ non-Clifford QCAs in spatial dimensions d=4k−1d=4k-1d=4k−1. We also reformulate the 4-dimensional w2w3w_2w_3w2​w3​ QCA and use it to construct QCAs from TQFTs associated with arbitrary products of Stiefel--Whitney classes. For example, we explicitly construct two infinite families: w2nw3mw_2^nw_3^mw2n​w3m​ QCAs in dimension d=2n+3m−1d=2n+3m-1d=2n+3m−1 and w2w4k−1w_2w_{4k-1}w2​w4k−1​ QCAs in dimension d=4kd=4kd=4k. For the 5-dimensional w32w_3^2w32​ and w23w_2^3w23​ QCAs, our construction gives finite-depth quantum circuits, consistent with the cobordism classification. More generally, we show that our construction yields a finite-depth quantum circuit whenever the corresponding Stiefel-Whitney number vanishes on every closed oriented manifold. Overall, these results convert invertible TQFTs into microscopic QCAs, provide higher-dimensional constructions beyond the Clifford setting, and open a systematic route to characterizing their stable structures and boundary anomalies.