A decision procedure for well-formed linear quantum cellular automata
<|reference_start|>A decision procedure for well-formed linear quantum cellular automata: In 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.<|reference_end|>
@article{durr1999a,
    title={A decision procedure for well-formed linear quantum cellular automata},
    author={Christoph Durr, Huong LeThanh and Miklos Santha},
    journal={Random Structures and Algorithms 11, 381-394, 1997},
    year={1999},
    archivePrefix={arXiv},
    eprint={cs/9906024},
    primaryClass={cs.DS cs.CC quant-ph}
}