|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'503'724
Articles rated: 2609
24 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
A decision procedure for well-formed linear quantum cellular automata | | Christoph Durr
; Huong LeThanh
; Miklos Santha
; | | Date: |
23 Jun 1999 | | Journal: | Random Structures and Algorithms 11, 381-394, 1997 | | Subject: | Data Structures and Algorithms; Computational Complexity ACM-class: F.1.1; F.2.1 | cs.DS cs.CC quant-ph | | 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(n^2)$ in the algebraic model of computation if the input automaton has continuous neighborhood. | | Source: | arXiv, cs.DS/9906024 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER