A gauge-invariant reversible cellular automaton
arXiv:1802.07644 · doi:10.1007/978-3-319-92675-9_1
Abstract
Gauge-invariance is a fundamental concept in physics---known to provide the mathematical justification for all four 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 applied to numerical analysis, quantum simulation, fault-tolerant (quantum) computation. From a mathematical perspective, discreteness provides a simple yet rigorous route straight to the core concepts.
arXiv comment12 pages, 5 figures
References in corpus (11)
- Fault-tolerant quantum computation by anyons
- Non-Abelian Anyons and Topological Quantum Computation
- Quantum Simulation
- Quantum Link Models: A Discrete Approach to Gauge Theories
- Tensor networks for Lattice Gauge Theories and Atomic Quantum Simulation
- Lattice Gauge Tensor Networks
- Quantum Walks in artificial electric and gravitational Fields
- Quantum Walks as simulators of neutrino oscillations in vacuum and matter
- Quantum walks and non-Abelian discrete gauge theory
- Discrete Lorentz covariance for Quantum Walks and Quantum Cellular Automata
- Discrete Dynamics: Gauge Invariance and Quantization