A DECISION PROCEDURE FOR WELL-FORMED LINEAR QUANTUM CELLULAR-AUTOMATA

In this pager 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 pro bability of a configuration in an observation as the squared magnitude of its amplitude. We give an efficient algorithm which decides if a l inear quantum cellular automaton is well-formed. The complexity of the algorithm is O(n(2)) in the algebraic model elf computation if the in put automaton has continuous neighborhood. (C) 1997 John Wiley & Sons, Inc.