  We provide algebraic criteria for the unitarity of linear quantum cellular
automata, i.e. one dimensional quantum cellular automata. We derive these both
by direct combinatorial arguments, and by adding constraints into the model
which do not change the quantum cellular automata's computational power. The
configurations we consider have finite but unbounded size.
