Abstract
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(n2) if the input automaton has continuous neighborhood.
Author supplied keywords
Cite
CITATION STYLE
Dürr, C., Thanh, H. L., & Santha, M. (1996). A decision procedure for well-formed linear quantum cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1046, pp. 281–292). Springer Verlag. https://doi.org/10.1007/3-540-60922-9_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
