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

Natural Computing

An overview of quantum cellular automata

Pablo J. Arrighi

Published Sep 20, 2019• 133 citations
Publisher
DOI
10.1007/s11047-019-09762-6

Related papers

An Introduction to Quantum Cellular Automata Technology and Its Defects

Zohre Beiki, Ali Shahidinejad

An Introduction to Quantum Cellular Automata Technology and Its Defects

Reviews in Theoretical Science•Jan 31, 2014•12 citations

Quantum Cellular Automata

Karoline Wiesner

Springer eBooks•Nov 2, 2011•5 citations

Quantum Cellular Automata

Karoline Wiesner

Quantum cellular automata (QCA) are reviewed, including early and more recent proposals. QCA are a generalization of (classical) cellular automata (CA) and in particular of reversible CA. The latter are reviewed shortly. An overview is given over early attempts by various authors to define one-dimensional QCA. These turned out to have serious shortcomings which are discussed as well. Various proposals subsequently put forward by a number of authors for a general definition of one- and higher-dimensional QCA are reviewed and their properties such as universality and reversibility are discussed.

arXiv:0808.0679•Aug 5, 2008•8 citations

Quantum Cellular Automata

Ioannis Liliopoulos, Georgios D. Varsamis, Ioannis G. Karafyllidis

Emergence, complexity and computation•Jan 1, 2025•1 citation

An overview of Quantum Cellular Automata

Pablo J. Arrighi

Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates information at a bounded speed) and translation-invariant (it acts everywhere the same). Quantum cellular automata provide a model/architecture for distributed quantum computation. More generally, they encompass most of discrete-space discrete-time quantum theory. We give an overview of their theory, with particular focus on structure results; computability and universality results; and quantum simulation results.

arXiv:1904.12956•Apr 29, 2019•35 citations

Quantum Trick Cellular Automata

Sai Venkatesh Balasubramanian

The present work explores a radically new perspective exploiting the advantages of quantum computation using classical systems. Termed ‘Quantum Tricks’, the essence of the technique is replacing the inherent probabilistic nature of a qubit with a pseudorandom generator, resulting in the implementation of basic Quantum Gates such as the Pauli X, Y, Z, Hadamard and CNOT gates using extremely simple mathematical operations followed by an implementation of entanglement. Following this, a brief overview of the concept of cellular automata and associated rules is presented. Finally, the ‘Quantum Trick Cellular Automata’ (QTCA) concept is formulated, differing from the classical cellular automata in two aspects - presence of superposed states other than 1 and 0, and implementation of above mentioned quantum gates. It is seen that QCTA comprising of CNOT and Entanglement operations give rise to rich, complex and ornamental patterns, characteristic of the underlying chaos. The extreme simplicity of the proposed design coupled with its efficacy in implementing rich patterns using cellular automata concepts form the highlights of the present work.

•Oct 1, 2015•0 citations
Quantum cellular automata (QCA) are reviewed, including early and more recent proposals. QCA are a generalization of (classical) cellular automata (CA) and in particular of reversible CA. The latter are reviewed shortly. An overview is given over early attempts by various authors to define one-dimensional QCA. These turned out to have serious shortcomings which are discussed as well. Various proposals subsequently put forward by a number of authors for a general definition of one- and higher-dimensional QCA are reviewed and their properties such as universality and reversibility are discussed.
Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates information at a bounded speed) and translation-invariant (it acts everywhere the same). Quantum cellular automata provide a model/architecture for distributed quantum computation. More generally, they encompass most of discrete-space discrete-time quantum theory. We give an overview of their theory, with particular focus on structure results; computability and universality results; and quantum simulation results.
The present work explores a radically new perspective exploiting the advantages of quantum computation using classical systems. Termed ‘Quantum Tricks’, the essence of the technique is replacing the inherent probabilistic nature of a qubit with a pseudorandom generator, resulting in the implementation of basic Quantum Gates such as the Pauli X, Y, Z, Hadamard and CNOT gates using extremely simple mathematical operations followed by an implementation of entanglement. Following this, a brief overview of the concept of cellular automata and associated rules is presented. Finally, the ‘Quantum Trick Cellular Automata’ (QTCA) concept is formulated, differing from the classical cellular automata in two aspects - presence of superposed states other than 1 and 0, and implementation of above mentioned quantum gates. It is seen that QCTA comprising of CNOT and Entanglement operations give rise to rich, complex and ornamental patterns, characteristic of the underlying chaos. The extreme simplicity of the proposed design coupled with its efficacy in implementing rich patterns using cellular automata concepts form the highlights of the present work.