Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours

Authors:
Pablo Arrighi;Renan Fargetton;Zizhu Wang
Affiliations:
(Correspd.) University of Grenoble LIG, 46 avenue Felix Viallet, 38000 Grenoble, France. pablo.arrighi@imag.fr/ renan.fargetton@imag.fr;University of Grenoble LIG, 46 avenue Felix Viallet, 38000 Grenoble, France. pablo.arrighi@imag.fr/ renan.fargetton@imag.fr;University of Grenoble LIG, 46 avenue Felix Viallet, 38000 Grenoble, France. pablo.arrighi@imag.fr/ renan.fargetton@imag.fr
Venue:
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Year:
2009

Citing 9
Cited 0

Cellular automata machines: a new environment for modeling

Cellular automata machines: a new environment for modeling
Ininvertible cellular automata: a review

Physica D
A decision procedure for well-formed linear quantum cellular automata

Proceedings of the workshop on Randomized algorithms and computation
A Decision Procedure for Unitary Linear Quantum Cellular Automata

SIAM Journal on Computing
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
Universality in cellular automata

SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Algebraic characterizations of unitary linear quantum cellular automata

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On the Circuit Depth of Structurally Reversible Cellular Automata

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a one-dimensional quantum cellular automaton (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any onedimensional QCA can be encoded within the initial configuration of the universal QCA. Several steps of the universal QCA will 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. The encoding is linear and hence does not carry any of the cost of the computation. We do this in two flavours: a weak one which requires an infinite but periodic initial configuration and a strong one which needs only a finite initial configuration.