A simple n-dimensional intrinsically universal quantum cellular automaton

Authors:
Pablo Arrighi;Jonathan Grattage
Affiliations:
LIG, University of Grenoble, France;LIP, ENS-Lyon, Lyon cedex 07, France
Venue:
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Year:
2010

Citing 12
Cited 3

Reversible simulation of one-dimensional irreversible cellular automata

Theoretical Computer Science
Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata

LATIN '95 Proceedings of the Second Latin American Symposium on Theoretical Informatics
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Inducing an Order on Cellular Automata by a Grouping Operation

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
A Decision Procedure for Well-Formed Linear Quantum Cellular Automata

STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
On one-dimensional quantum cellular automata

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata
One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations

Language and Automata Theory and Applications
Universality in cellular automata

SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours

Fundamenta Informaticae - Machines, Computations and Universality, Part II
Quantum Computation and Quantum Information: 10th Anniversary Edition

Quantum Computation and Quantum Information: 10th Anniversary Edition
Algebraic characterizations of unitary linear quantum cellular automata

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Partitioned quantum cellular automata are intrinsically universal

Natural Computing: an international journal
Grids and universal computations on one-dimensional cellular automata

Natural Computing: an international journal
Intrinsically universal n-dimensional quantum cellular automata

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a simple n-dimensional quantum cellular automaton (QCA) capable of simulating all others, in that the initial configuration and the forward evolution of any n-dimensional QCA can be encoded within the initial configuration of the intrinsically universal QCA. Several steps of the intrinsically universal QCA then correspond to one step of the simulated QCA. The simulation preserves the topology in the sense that each cell of the simulated QCA is encoded as a group of adjacent cells in the universal QCA.