%0 Conference Proceedings
%T A Gauge-Invariant Reversible Cellular Automaton
%+ Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon) (LIS)
%+ Calcul Naturel (CANA)
%+ Consejo Superior de Investigaciones Cientificas [España] = Spanish National Research Council [Spain] (CSIC)
%A Arrighi, Pablo
%A Molfetta, Giuseppe, Di
%A Eon, Nathanaël
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 24th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Ghent, Belgium
%Y Jan M. Baetens
%Y Martin Kutrib
%I Springer International Publishing
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-10875
%P 1-12
%8 2018-06-20
%D 2018
%Z 1802.07644
%R 10.1007/978-3-319-92675-9_1
%Z Computer Science [cs]Conference papers
%X Gauge-invariance is a fundamental concept in physics—known to provide mathematical justifications for the fundamental forces. In this paper, we provide discrete counterparts to the main gauge theoretical concepts, directly in terms of Cellular Automata. More precisely, we describe a step-by-step gauging procedure to enforce local symmetries upon a given Cellular Automaton. We apply it to a simple Reversible Cellular Automaton for concreteness. From a Computer Science perspective, discretized gauge theories may be of use in numerical analysis, quantum simulation, fault-tolerant (quantum) computation. From a mathematical perspective, discreteness provides a simple yet rigorous route straight to the core concepts.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-01824869/document
%2 https://inria.hal.science/hal-01824869/file/469010_1_En_1_Chapter.pdf
%L hal-01824869
%U https://inria.hal.science/hal-01824869
%~ UNIV-TLN
%~ CNRS
%~ UNIV-AMU
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA
%~ LIS-LAB
%~ IFIP-LNCS-10875