On Reversible Cellular Automata with Triplet Local Rules
classification
🌊 nlin.CG
keywords
automatacellularreversiblediscretelocalquantumrulestriplet
read the original abstract
Bijections between sets may be seen as discrete (or crisp) unitary transformations used in quantum computations. So discrete quantum cellular automata are cellular automata with reversible transition functions. This note studies on 1d reversible cellular automata with triplet local rules.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.