|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'500'096
Articles rated: 2609
18 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
A decision procedure for unitary linear quantum cellular automata | | Christoph Durr
; Miklos Santha
; | | Date: |
9 Apr 1996 | | Journal: | Proceeding of the 37th IEEE Symposium on Foundations of Computer Science, 38--45, 1996 | | Subject: | Quantum Physics; Computational Complexity | quant-ph cs.CC | | Affiliation: | LRI), Miklos Santha (CNRS | | Abstract: | Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quantum machine: it has to be unitary, that is its time evolution operator has to be a unitary transformation. In this paper we give an efficient algorithm to decide if a linear quantum cellular automaton is unitary. The complexity of the algorithm is O(n^((3r-1)/(r+1))) = O(n^3) in the algebraic computational model if the automaton has a continuous neighborhood of size r, where $n$ is the size of the input. | | Source: | arXiv, quant-ph/9604007 | | 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 claudebot
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER