- Full text PDF available (1)
Journals and Conferences
Discrete quantum cellular automata are cellular automata with reversible transition. This paper deals with 1d cellular automata with finite cell array and triplet local transition rules. We present the necessary condition of local transition rules for cellular automata to be reversible, and prove the reversibility of some cellular automata.
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.