2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/33224In this paper we introduce a new quantum computation model, the linear quantum cellular automaton. Well-formedness is an essential property for any quantum computing device since it enables us to define the probability of a configuration in an observation as the squared magnitude of its amplitude. We give an efficient algorithm which decides if a linear quantum cellular automaton is well-formed. The complexity of the algorithm is $O(n^2)$ in the algebraic model of computation if the input automaton has continuous neighborhood.Data Structures and AlgorithmsComputational ComplexityQuantum PhysicsF.1.1; F.2.1text