Quantum cellular automata without quiescent states

摘要

We show how to construct quantum cellular automata (QCA) based on the formalism introduced by Watrous but without that formalism's "quiescent states," by using shift-invariant Lebesgue measure on Cantor space. Although QCA's with quiescent states are strictly sufficient for computational purposes, removing quiescent states as a requirement allows global QCA states with infinite support that allows the state space of the QCA to be identified with the class of interpretations of logic-based formalism in a formal methods approach to proving the correctness correctness of QCAs with respect to formal specifications