Skip to Main content Skip to Navigation
Conference papers

The fractal structure of cellular automata on abelian groups

Abstract : It is a well-known fact that the spacetime diagrams of some cellular automata have a fractal structure: for instance Pascal's triangle modulo $2$ generates a Sierpinski triangle. Explaining the fractal structure of the spacetime diagrams of cellular automata is a much explored topic, but virtually all of the results revolve around a special class of automata, whose main features include irreversibility, an alphabet with a ring structure and a rule respecting this structure, and a property known as being (weakly) $p$-Fermat. The class of automata that we study in this article fulfills none of these properties. Their cell structure is weaker and they are far from being $p$-Fermat, even weakly. However, they do produce fractal spacetime diagrams, and we will explain why and how. These automata emerge naturally from the field of quantum cellular automata, as they include the classical equivalent of the Clifford quantum cellular automata, which have been studied by the quantum community for several reasons. They are a basic building block of a universal model of quantum computation, and they can be used to generate highly entangled states, which are a primary resource for measurement-based models of quantum computing.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, August 20, 2015 - 2:16:39 PM
Last modification on : Saturday, June 5, 2021 - 8:10:02 PM
Long-term archiving on: : Wednesday, April 26, 2017 - 9:44:16 AM


Publisher files allowed on an open archive




Johannes Gütschow, Vincent Nesme, Reinhard F. Werner. The fractal structure of cellular automata on abelian groups. Automata 2010 - 16th Intl. Workshop on CA and DCS, 2010, Nancy, France. pp.51-70, ⟨10.46298/dmtcs.2759⟩. ⟨hal-01185495⟩



Record views


Files downloads