The Block Neighborhood
Pablo Arrighi (LIG), Vincent Fabrice Nesme

TL;DR
This paper introduces the concept of block neighborhood for reversible cellular automata, providing a combinatorial characterization that simplifies computation and enables bounds on neighborhood size, impacting quantum computing and CA decomposition.
Contribution
It offers a new combinatorial framework for understanding block neighborhoods in reversible CA, facilitating easier computation and bounding of neighborhood sizes.
Findings
Provided a combinatorial characterization of block neighborhoods.
Derived upper bounds on block neighborhoods based on classical and inverse neighborhoods.
Identified a class of elementary CAs that cannot be decomposed into simpler parts.
Abstract
We define the block neighborhood of a reversible CA, which is related both to its decomposition into a product of block permutations and to quantum computing. We give a purely combinatorial characterization of the block neighborhood, which helps in two ways. First, it makes the computation of the block neighborhood of a given CA relatively easy. Second, it allows us to derive upper bounds on the block neighborhood: for a single CA as function of the classical and inverse neighborhoods, and for the composition of several CAs. One consequence of that is a characterization of a class of "elementary" CAs that cannot be written as the composition of two simpler parts whose neighborhoods and inverse neighborhoods would be reduced by one half.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Cellular Automata and Applications · semigroups and automata theory
