  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.
