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:1703.05890 · Physical Review A

Simple derivation of the Weyl and Dirac quantum cellular automata

Philippe Raynal

Published Jun 30, 2017• 8 citations
arXivHTMLPDF

Abstract

We consider quantum cellular automata on a body-centered cubic lattice and provide a simple derivation of the only two homogenous, local, isotropic, and unitary two-dimensional automata [G. M. D'Ariano and P. Perinotti, Phys. Rev. A 90, 062106 (2014)]. Our derivation relies on the notion of Gram matrix and emphasizes the link between the transition matrices that characterize the automata and the body-centered cubic lattice: The transition matrices essentially are the matrix representation of the vertices of the lattice's primitive cell. As expected, the dynamics of these two automata reduce to the Weyl equation in the limit of small wave vectors and continuous time. We also briefly examine the four-dimensional case, where we find two one-parameter families of automata that reduce to the Dirac equation in a suitable limit.

DOI
10.1103/physreva.95.062344

Related papers

Analytical Solutions of the Dirac Quantum Cellular Automata: Path-sum Methods for the Solution of Quantum Walk Dynamics in Position Space

Nicola Mosco

The thesis focuses on the analytical and the numerical study of the Weyl and Dirac Quantum Cellular Automata (QCAs). A QCA describes the unitary local evolution of a denumerable collection of quantum systems in mutual interaction. The Weyl QCA can be derived under the assumptions of linearity, unitarity, locality, homogeneity and isotropy and one can show that it recovers the relativistic evolution of the Weyl equation in the limit of small wave-vectors. Under these assumptions a QCA can be described in terms of a set of so-called transition matrices. In the specific case of the Weyl automaton the transition matrices generate a semigroup allowing for the explicit computation of the propagator in position space as a sum over paths. The computation of the propagator is simplified by encoding the lattice paths as binary strings, so that the problems reduces to a combinatorial problem for the binary strings. The thesis also addresses the Thirring QCA, featuring an on-site interaction. We provide a starting point for the study of the perturbation theory in this case.

•Nov 10, 2019•1 citation

From Quantum Cellular Automata To Quantum Lattice Gases

David Meyer, From Qca, Qlga David +1 more

A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, in this paper we begin an investigation of exactly unitary cellular automata. After proving that there can be no nontrivial, homogeneous, local, unitary, scalar cellular automaton in one dimension, we weaken the homogeneity condition and show that there are nontrivial, exactly unitary, partitioning cellular automata. We find a one parameter family of evolution rules which are best interpreted as those for a one particle quantum automaton. This model is naturally reformulated as a two component cellular automaton which we demonstrate to limit to the Dirac equation. We describe two generalizations of this automaton, the second of which, to multiple interacting particles, is the correct definition of a quantum lattice gas. KEY WORDS: quantum cellular automaton; quantum lattice gas; quantum computation. to appear in J. Stat. Phys.

•Apr 4, 1996•496 citations

Asymptotic properties of the Dirac quantum cellular automaton

Armando Pérez

We show that the Dirac quantum cellular automaton [A. Bisio, G. M. D'Ariano, and A. Tosini, Ann. Phys. (N.Y.) 354, 244 (2015)] shares many properties in common with the discrete-time quantum walk. These similarities can be exploited to study the automaton as a unitary process that takes place at regular time steps on a one-dimensional lattice, in the spirit of general quantum cellular automata. In this way, it becomes an alternative to the quantum walk, with a dispersion relation that can be controlled by a parameter that plays a similar role to the coin angle in the quantum walk. The Dirac Hamiltonian is recovered under a suitable limit. We provide two independent analytical approximations to the long-term probability distribution. It is shown that, starting from localized conditions, the asymptotic value of the entropy of entanglement between internal and motional degrees of freedom overcomes the known limit that is approached by the quantum walk for the same initial conditions and is similar to the ones achieved by highly localized states of the Dirac equation.

arXiv:1504.07418•Physical Review A•Jan 15, 2016•16 citations

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

Reversible quantum cellular automata

Benjamin W. Schumacher, Reinhard F. Werner

We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions this allows us to give an explicit characterization of all local rules generating such automata. The same local rules also generate the global time step for automata with periodic boundary conditions. Our main structure theorem asserts that any quantum cellular automaton is structurally reversible, i.e., that it can be obtained by applying two blockwise unitary operations in a generalized Margolus partitioning scheme. This implies that, in contrast to the classical case, the inverse of a nearest neighbor quantum cellular automaton is again a nearest neighbor automaton. We present several construction methods for quantum cellular automata, based on unitaries commuting with their translates, on the quantization of (arbitrary) reversible classical cellular automata, on quantum circuits, and on Clifford transformations with respect to a description of the single cells by finite Weyl systems. Moreover, we indicate how quantum random walks can be considered as special cases of cellular automata, namely by restricting a quantum lattice gas automaton with local particle number conservation to the single particle sector.

arXiv:quant-ph/0405174•May 28, 2004•239 citations

Unitarity in one dimensional nonlinear quantum cellular automata

David Meyer

Unitarity of the global evolution is an extremely stringent condition on finite state models in discrete spacetime. Quantum cellular automata, in particular, are tightly constrained. In previous work we proved a simple No-go Theorem which precludes nontrivial homogeneous evolution for linear quantum cellular automata. Here we carefully define general quantum cellular automata in order to investigate the possibility that there be nontrivial homogeneous unitary evolution when the local rule is nonlinear. Since the unitary global transition amplitudes are constructed from the product of local transition amplitudes, infinite lattices require different treatment than periodic ones. We prove Unitarity Theorems for both cases, expressing the equivalence in $1+1$ dimensions of global unitarity and certain sets of constraints on the local rule, and then show that these constraints can be solved to give a variety of multiparameter families of nonlinear quantum cellular automata. The Unitarity Theorems, together with a Surjectivity Theorem for the infinite case, also imply that unitarity is decidable for one dimensional cellular automata.

arXiv:quant-ph/9605023•May 15, 1996•30 citations
We consider quantum cellular automata on a body-centered cubic lattice and provide a simple derivation of the only two homogenous, local, isotropic, and unitary two-dimensional automata [G. M. D'Ariano and P. Perinotti, Phys. Rev. A 90, 062106 (2014)]. Our derivation relies on the notion of Gram matrix and emphasizes the link between the transition matrices that characterize the automata and the body-centered cubic lattice: The transition matrices essentially are the matrix representation of the vertices of the lattice's primitive cell. As expected, the dynamics of these two automata reduce to the Weyl equation in the limit of small wave vectors and continuous time. We also briefly examine the four-dimensional case, where we find two one-parameter families of automata that reduce to the Dirac equation in a suitable limit.
The thesis focuses on the analytical and the numerical study of the Weyl and Dirac Quantum Cellular Automata (QCAs). A QCA describes the unitary local evolution of a denumerable collection of quantum systems in mutual interaction. The Weyl QCA can be derived under the assumptions of linearity, unitarity, locality, homogeneity and isotropy and one can show that it recovers the relativistic evolution of the Weyl equation in the limit of small wave-vectors. Under these assumptions a QCA can be described in terms of a set of so-called transition matrices. In the specific case of the Weyl automaton the transition matrices generate a semigroup allowing for the explicit computation of the propagator in position space as a sum over paths. The computation of the propagator is simplified by encoding the lattice paths as binary strings, so that the problems reduces to a combinatorial problem for the binary strings. The thesis also addresses the Thirring QCA, featuring an on-site interaction. We provide a starting point for the study of the perturbation theory in this case.
A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, in this paper we begin an investigation of exactly unitary cellular automata. After proving that there can be no nontrivial, homogeneous, local, unitary, scalar cellular automaton in one dimension, we weaken the homogeneity condition and show that there are nontrivial, exactly unitary, partitioning cellular automata. We find a one parameter family of evolution rules which are best interpreted as those for a one particle quantum automaton. This model is naturally reformulated as a two component cellular automaton which we demonstrate to limit to the Dirac equation. We describe two generalizations of this automaton, the second of which, to multiple interacting particles, is the correct definition of a quantum lattice gas. KEY WORDS: quantum cellular automaton; quantum lattice gas; quantum computation. to appear in J. Stat. Phys.
We show that the Dirac quantum cellular automaton [A. Bisio, G. M. D'Ariano, and A. Tosini, Ann. Phys. (N.Y.) 354, 244 (2015)] shares many properties in common with the discrete-time quantum walk. These similarities can be exploited to study the automaton as a unitary process that takes place at regular time steps on a one-dimensional lattice, in the spirit of general quantum cellular automata. In this way, it becomes an alternative to the quantum walk, with a dispersion relation that can be controlled by a parameter that plays a similar role to the coin angle in the quantum walk. The Dirac Hamiltonian is recovered under a suitable limit. We provide two independent analytical approximations to the long-term probability distribution. It is shown that, starting from localized conditions, the asymptotic value of the entropy of entanglement between internal and motional degrees of freedom overcomes the known limit that is approached by the quantum walk for the same initial conditions and is similar to the ones achieved by highly localized states of the Dirac equation.
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.
We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions this allows us to give an explicit characterization of all local rules generating such automata. The same local rules also generate the global time step for automata with periodic boundary conditions. Our main structure theorem asserts that any quantum cellular automaton is structurally reversible, i.e., that it can be obtained by applying two blockwise unitary operations in a generalized Margolus partitioning scheme. This implies that, in contrast to the classical case, the inverse of a nearest neighbor quantum cellular automaton is again a nearest neighbor automaton. We present several construction methods for quantum cellular automata, based on unitaries commuting with their translates, on the quantization of (arbitrary) reversible classical cellular automata, on quantum circuits, and on Clifford transformations with respect to a description of the single cells by finite Weyl systems. Moreover, we indicate how quantum random walks can be considered as special cases of cellular automata, namely by restricting a quantum lattice gas automaton with local particle number conservation to the single particle sector.
Unitarity of the global evolution is an extremely stringent condition on finite state models in discrete spacetime. Quantum cellular automata, in particular, are tightly constrained. In previous work we proved a simple No-go Theorem which precludes nontrivial homogeneous evolution for linear quantum cellular automata. Here we carefully define general quantum cellular automata in order to investigate the possibility that there be nontrivial homogeneous unitary evolution when the local rule is nonlinear. Since the unitary global transition amplitudes are constructed from the product of local transition amplitudes, infinite lattices require different treatment than periodic ones. We prove Unitarity Theorems for both cases, expressing the equivalence in 1+11+11+1 dimensions of global unitarity and certain sets of constraints on the local rule, and then show that these constraints can be solved to give a variety of multiparameter families of nonlinear quantum cellular automata. The Unitarity Theorems, together with a Surjectivity Theorem for the infinite case, also imply that unitarity is decidable for one dimensional cellular automata.