✦ LIBER ✦
A decision procedure for well-formed linear quantum cellular automata
✍ Scribed by Christoph Dürr; Huong LêThanh; Miklos Santha
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 196 KB
- Volume
- 11
- Category
- Article
- ISSN
- 1042-9832
No coin nor oath required. For personal study only.
✦ Synopsis
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 Ž 2 . algorithm is O n in the algebraic model of computation if the input automaton has Ž .