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

Journal of Physics A Mathematical and General

On cellular automata models for quantum systems

José M. G. Vilar, Ricard V. Solé

Published Dec 21, 1996• 1 citation
Publisher

Abstract

We analyse a recent approach to quantum systems based on some recent cellular automata models. It is shown that, although mass and probability conservation holds, non-physical behaviour is typically obtained.
DOI
10.1088/0305-4470/29/24/038

Related papers

Cellular automata for quantum systems

Morton D. Kostin

Cellular automata for modelling quantum systems are presented. The mass at each site is updated according to rules that depend on the masses of neighbouring sites. An essential feature of these local rules is that mass and probability are conserved. In the limit of small spatial and time steps it is shown that the equation defining one class of automata reduces to the Schrodinger equation and the equation defining another class of automata reduces to the Dirac equation. Advantages of these methods are discussed.

Journal of Physics A Mathematical and General•Mar 7, 1993•9 citations

A review of Quantum Cellular Automata

Terry Farrelly

Discretizing spacetime is often a natural step towards modelling physical systems. For quantum systems, if we also demand a strict bound on the speed of information propagation, we get quantum cellular automata (QCAs). These originally arose as an alternative paradigm for quantum computation, though more recently they have found application in understanding topological phases of matter and have} been proposed as models of periodically driven (Floquet) quantum systems, where QCA methods were used to classify their phases. QCAs have also been used as a natural discretization of quantum field theory, and some interesting examples of QCAs have been introduced that become interacting quantum field theories in the continuum limit. This review discusses all of these applications, as well as some other interesting results on the structure of quantum cellular automata, including the tensor-network unitary approach, the index theory and higher dimensional classifications of QCAs.

arXiv:1904.13318•Quantum•Nov 30, 2020•196 citations

Relation between coined quantum walks and quantum cellular automata

Masatoshi Hamada, Norio Konno, Etsuo Segawa

Motivated by the recent work of Patel et al., this paper clarifies a connection between coined quantum walks and quantum cellular automata in a general setting. As a consequence, their result is naturally derived from the connection.

arXiv:quant-ph/0408100•Aug 16, 2004•17 citations

A review of quantum cellular automata

Terry Farrelly

Discretizing spacetime is often a natural step towards modelling physical systems. For quantum systems, if we also demand a strict bound on the speed of information propagation, we get quantum cellular automata (QCAs). These originally arose as an alternative paradigm for quantum computation, though more recently they have found application in understanding topological phases of matter and have been proposed as models of periodically driven (Floquet) quantum systems, where QCA methods were used to classify their phases. QCAs have also been used as a natural discretization of quantum field theory, and some interesting examples of QCAs have been introduced that become interacting quantum field theories in the continuum limit. This review discusses all of these applications, as well as some other interesting results on the structure of quantum cellular automata, including the tensor-network unitary approach, the index theory and higher dimensional classifications of QCAs. © 2020 Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften. All rights reserved.

•Jan 1, 2020•0 citations

A conservation law in quantum cellular automata

Gerhard Grössing, Anton Zeilinger

Physica D Nonlinear Phenomena•May 1, 1988•11 citations

Models of Quantum Cellular Automata

Carlos A. Pérez-Delgado, Donny Cheung

In this paper we present a systematic view of Quantum Cellular Automata (QCA), a mathematical formalism of quantum computation. First we give a general mathematical framework with which to study QCA models. Then we present four different QCA models, and compare them. One model we discuss is the traditional QCA, similar to those introduced by Shumacher and Werner, Watrous, and Van Dam. We discuss also Margolus QCA, also discussed by Schumacher and Werner. We introduce two new models, Coloured QCA, and Continuous-Time QCA. We also compare our models with the established models. We give proofs of computational equivalence for several of these models. We show the strengths of each model, and provide examples of how our models can be useful to come up with algorithms, and implement them in real-world physical devices.

arXiv:quant-ph/0508164•Aug 23, 2005•15 citations
Cellular automata for modelling quantum systems are presented. The mass at each site is updated according to rules that depend on the masses of neighbouring sites. An essential feature of these local rules is that mass and probability are conserved. In the limit of small spatial and time steps it is shown that the equation defining one class of automata reduces to the Schrodinger equation and the equation defining another class of automata reduces to the Dirac equation. Advantages of these methods are discussed.
Discretizing spacetime is often a natural step towards modelling physical systems. For quantum systems, if we also demand a strict bound on the speed of information propagation, we get quantum cellular automata (QCAs). These originally arose as an alternative paradigm for quantum computation, though more recently they have found application in understanding topological phases of matter and have} been proposed as models of periodically driven (Floquet) quantum systems, where QCA methods were used to classify their phases. QCAs have also been used as a natural discretization of quantum field theory, and some interesting examples of QCAs have been introduced that become interacting quantum field theories in the continuum limit. This review discusses all of these applications, as well as some other interesting results on the structure of quantum cellular automata, including the tensor-network unitary approach, the index theory and higher dimensional classifications of QCAs.
Discretizing spacetime is often a natural step towards modelling physical systems. For quantum systems, if we also demand a strict bound on the speed of information propagation, we get quantum cellular automata (QCAs). These originally arose as an alternative paradigm for quantum computation, though more recently they have found application in understanding topological phases of matter and have been proposed as models of periodically driven (Floquet) quantum systems, where QCA methods were used to classify their phases. QCAs have also been used as a natural discretization of quantum field theory, and some interesting examples of QCAs have been introduced that become interacting quantum field theories in the continuum limit. This review discusses all of these applications, as well as some other interesting results on the structure of quantum cellular automata, including the tensor-network unitary approach, the index theory and higher dimensional classifications of QCAs. © 2020 Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften. All rights reserved.
In this paper we present a systematic view of Quantum Cellular Automata (QCA), a mathematical formalism of quantum computation. First we give a general mathematical framework with which to study QCA models. Then we present four different QCA models, and compare them. One model we discuss is the traditional QCA, similar to those introduced by Shumacher and Werner, Watrous, and Van Dam. We discuss also Margolus QCA, also discussed by Schumacher and Werner. We introduce two new models, Coloured QCA, and Continuous-Time QCA. We also compare our models with the established models. We give proofs of computational equivalence for several of these models. We show the strengths of each model, and provide examples of how our models can be useful to come up with algorithms, and implement them in real-world physical devices.