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:1209.5367 · Journal of Mathematical Physics

When is a quantum cellular automaton (QCA) a quantum lattice gas automaton (QLGA)?

Asif Shakeel, Peter J. Love

Published Sep 1, 2013• 24 citations
arXivHTMLPDF

Abstract

Quantum cellular automata (QCA) are models of quantum computation of particular interest from the point of view of quantum simulation. Quantum lattice gas automata (QLGA - equivalently partitioned quantum cellular automata) represent an interesting subclass of QCA. QLGA have been more deeply analyzed than QCA, whereas general QCA are likely to capture a wider range of quantum behavior. Discriminating between QLGA and QCA is therefore an important question. In spite of much prior work, classifying which QCA are QLGA has remained an open problem. In the present paper we establish necessary and sufficient conditions for unbounded, finite QCA (finitely many active cells in a quiescent background) to be QLGA. We define a local condition that classifies those QCA that are QLGA, and we show that there are QCA that are not QLGA. We use a number of tools from functional analysis of separable Hilbert spaces and representation theory of associative algebras that enable us to treat QCA on finite but unbounded configurations in full detail.

DOI
10.1063/1.4821640

Related papers

Quantum cellular automata without particles

DAVID A. MEYER, Asif Shakeel

Quantum cellular automata (QCA) constitute space and time homogeneous discrete models for quantum field theories (QFTs). Although QFTs are defined without reference to particles, computations are done in terms of Feynman diagrams, which are explicitly interpreted in terms of interacting particles. Similarly, the easiest QCA to construct are quantum lattice gas automata (QLGA). A natural question then is, which QCA are not QLGA? Here we construct a nontrivial example of such a QCA; it provides a simple model in $1+1$ dimensions with no particle interpretation at the scale where the QCA dynamics are homogeneous.

arXiv:1506.01639•Physical Review A•Jan 20, 2016•11 citations

Quantum Cellular Automata and Groups

Ruoli Bai

A quantum cellular automaton (QCA) is a unitary discrete-time evolution of a quantum many-body system, which can be described as a dynamics system , where A is any matrix and is a unitary operator representing the global evolution of QCA. And QCAs are characterized by locality (or causality). Among them, quantum circuits are the special classes of QCAs, which use unitary operators to control and transform the initial quantum state of qubit into a final quantum state, quantum circuits are special and widely studied in quantum information. A group is a set of elements combined with an operation, which satisfies associativity, identity and invertibility. This article shows that group theory provides the right language for studying the relation between QCAs and quantum circuits among them.

Theoretical and Natural Science•Apr 24, 2025•0 citations

Quantum Cellular Automata: The Group, the Space, and the Spectrum

Mattie Ji, Bowen Yang

Over an arbitrary commutative ring $R$, we develop a theory of quantum cellular automata. We then use algebraic K-theory to construct a space $\mathbf{Q}(X)$ of quantum cellular automata (QCA) on a given metric space $X$. In most cases of interest, $π_0 \mathbf{Q}(X)$ classifies QCA up to quantum circuits and stabilization. Notably, the QCA spaces are related by homotopy equivalences $\mathbf{Q}(*) \simeq Ω^n \mathbf{Q}(\mathbb{Z}^n)$ for all $n$, which shows that the classification of QCA on Euclidean lattices is given by an $Ω$-spectrum indexed by the dimension $n$. As a corollary, we also obtain a non-connective delooping of the K-theory of Azumaya $R$-algebras, which may be of independent interest. We also include a section leading to the $Ω$-spectrum for QCA over $C^*$-algebras with unitary circuits.

math.ATCross-listedarXiv:2602.16572•Feb 19, 2026

The Equivalence of Schrödinger and Heisenberg Pictures in Quantum Cellular Automata

Asif Shakeel

Quantum cellular automata (QCA) are discrete models of space and time homogeneous quantum field theories (QFTs) and regarded as natural candidates for quantum simulation. Description of a QCA over the separable Hilbert space of finite, unbounded configurations (UFC Hilbert space) with unitary state evolution is the {\it Schrödinger template}, and over the incomplete infinite tensor product algebra (ITPA) with evolution by algebra automorphism is the {\it Heisenberg template}. Whether every Heisenberg template admits an equivalent Schrödinger template is a foundational question, and one that has persisted as an open problem. In the present paper we prove that for every Heisenberg template an equivalent Schrödinger template exists. We frame the question from a representation theory standpoint, using constructs and results from the representation theory of finite and countably infinite dimensional vector spaces and from category theory to answer it. With the previously known existence of a Heisenberg template for every Schrödinger template, our result establishes the equivalence of the templates.

arXiv:1807.01192•Jul 3, 2018•1 citation

Approximate QCAs in one dimension using approximate algebras

Daniel Ranard, Michael Walter, Freek Witteveen

Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality, with local quantum circuits as a simple example. We study approximate QCAs, where the locality condition is only satisfied up to a small error, as occurs for local quantum dynamics on the lattice. A priori, approximate QCAs could exhibit genuinely new behavior, failing to be well-approximated by any exact QCA. We show this does not occur in one dimension: every approximate QCA on a finite circle can be rounded to a strict QCA with approximately the same action on local operators, so these systems are classified by the same index as in the exact case. Previous work considered the case of the infinite line, by using global methods not amenable to finite systems. Our new approach proceeds locally and now applies to finite systems, including circles or homomorphisms from sub-intervals. We extract exact local boundary algebras from the approximate QCA restricted to local patches, then glue these to form a strict QCA. The key technical ingredient is a robust notion of the intersection of two subalgebras: when the projections onto two subalgebras approximately commute, we construct an exact subalgebra that serves as a stable proxy for their intersection. This construction uses a recent theorem of Kitaev on the rigidity of approximate $C^*$-algebras.

quant-pharXiv:2603.08702•Mar 10, 2026•0 citations

Quantum Cellular Automata: Schr\"{o}dinger and Heisenberg Pictures

Asif Shakeel

Axiomatic definitions of Quantum Cellular Automata (QCA) are foundational in discrete space-time models of physics. Templates of axiomatic QCA serve as primary points of investigations concerning properties, structural results, and classes of QCA that are potentially significant for quantum algorithms and simulations. We examine, from a representation theory standpoint, the relation between the templates corresponding to the Schr\{o}dinger and the Heisenberg pictures of evolution for QCA over finite, unbounded configurations.

•Jul 3, 2018•3 citations
Quantum cellular automata (QCA) are models of quantum computation of particular interest from the point of view of quantum simulation. Quantum lattice gas automata (QLGA - equivalently partitioned quantum cellular automata) represent an interesting subclass of QCA. QLGA have been more deeply analyzed than QCA, whereas general QCA are likely to capture a wider range of quantum behavior. Discriminating between QLGA and QCA is therefore an important question. In spite of much prior work, classifying which QCA are QLGA has remained an open problem. In the present paper we establish necessary and sufficient conditions for unbounded, finite QCA (finitely many active cells in a quiescent background) to be QLGA. We define a local condition that classifies those QCA that are QLGA, and we show that there are QCA that are not QLGA. We use a number of tools from functional analysis of separable Hilbert spaces and representation theory of associative algebras that enable us to treat QCA on finite but unbounded configurations in full detail.
Quantum cellular automata (QCA) constitute space and time homogeneous discrete models for quantum field theories (QFTs). Although QFTs are defined without reference to particles, computations are done in terms of Feynman diagrams, which are explicitly interpreted in terms of interacting particles. Similarly, the easiest QCA to construct are quantum lattice gas automata (QLGA). A natural question then is, which QCA are not QLGA? Here we construct a nontrivial example of such a QCA; it provides a simple model in 1+11+11+1 dimensions with no particle interpretation at the scale where the QCA dynamics are homogeneous.
A quantum cellular automaton (QCA) is a unitary discrete-time evolution of a quantum many-body system, which can be described as a dynamics system , where A is any matrix and is a unitary operator representing the global evolution of QCA. And QCAs are characterized by locality (or causality). Among them, quantum circuits are the special classes of QCAs, which use unitary operators to control and transform the initial quantum state of qubit into a final quantum state, quantum circuits are special and widely studied in quantum information. A group is a set of elements combined with an operation, which satisfies associativity, identity and invertibility. This article shows that group theory provides the right language for studying the relation between QCAs and quantum circuits among them.
Over an arbitrary commutative ring RRR, we develop a theory of quantum cellular automata. We then use algebraic K-theory to construct a space Q(X)\mathbf{Q}(X)Q(X) of quantum cellular automata (QCA) on a given metric space XXX. In most cases of interest, π0Q(X)π_0 \mathbf{Q}(X)π0​Q(X) classifies QCA up to quantum circuits and stabilization. Notably, the QCA spaces are related by homotopy equivalences Q(∗)≃ΩnQ(Zn)\mathbf{Q}(*) \simeq Ω^n \mathbf{Q}(\mathbb{Z}^n)Q(∗)≃ΩnQ(Zn) for all nnn, which shows that the classification of QCA on Euclidean lattices is given by an ΩΩΩ-spectrum indexed by the dimension nnn. As a corollary, we also obtain a non-connective delooping of the K-theory of Azumaya RRR-algebras, which may be of independent interest. We also include a section leading to the ΩΩΩ-spectrum for QCA over C∗C^*C∗-algebras with unitary circuits.
Quantum cellular automata (QCA) are discrete models of space and time homogeneous quantum field theories (QFTs) and regarded as natural candidates for quantum simulation. Description of a QCA over the separable Hilbert space of finite, unbounded configurations (UFC Hilbert space) with unitary state evolution is the {\it Schrödinger template}, and over the incomplete infinite tensor product algebra (ITPA) with evolution by algebra automorphism is the {\it Heisenberg template}. Whether every Heisenberg template admits an equivalent Schrödinger template is a foundational question, and one that has persisted as an open problem. In the present paper we prove that for every Heisenberg template an equivalent Schrödinger template exists. We frame the question from a representation theory standpoint, using constructs and results from the representation theory of finite and countably infinite dimensional vector spaces and from category theory to answer it. With the previously known existence of a Heisenberg template for every Schrödinger template, our result establishes the equivalence of the templates.
Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality, with local quantum circuits as a simple example. We study approximate QCAs, where the locality condition is only satisfied up to a small error, as occurs for local quantum dynamics on the lattice. A priori, approximate QCAs could exhibit genuinely new behavior, failing to be well-approximated by any exact QCA. We show this does not occur in one dimension: every approximate QCA on a finite circle can be rounded to a strict QCA with approximately the same action on local operators, so these systems are classified by the same index as in the exact case. Previous work considered the case of the infinite line, by using global methods not amenable to finite systems. Our new approach proceeds locally and now applies to finite systems, including circles or homomorphisms from sub-intervals. We extract exact local boundary algebras from the approximate QCA restricted to local patches, then glue these to form a strict QCA. The key technical ingredient is a robust notion of the intersection of two subalgebras: when the projections onto two subalgebras approximately commute, we construct an exact subalgebra that serves as a stable proxy for their intersection. This construction uses a recent theorem of Kitaev on the rigidity of approximate C∗C^*C∗-algebras.
Axiomatic definitions of Quantum Cellular Automata (QCA) are foundational in discrete space-time models of physics. Templates of axiomatic QCA serve as primary points of investigations concerning properties, structural results, and classes of QCA that are potentially significant for quantum algorithms and simulations. We examine, from a representation theory standpoint, the relation between the templates corresponding to the Schr\{o}dinger and the Heisenberg pictures of evolution for QCA over finite, unbounded configurations.