A decision procedure for well-formed linear quantum cellular automata
数据结构与算法
2007-05-23 v2 计算复杂性
量子物理
摘要
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 in the algebraic model of computation if the input automaton has continuous neighborhood.
引用
@article{arxiv.cs/9906024,
title = {A decision procedure for well-formed linear quantum cellular automata},
author = {Christoph Durr and Huong LeThanh and Miklos Santha},
journal= {arXiv preprint arXiv:cs/9906024},
year = {2007}
}