(Enter summary)
Abstract: Since Richard Feynman introduced the notion of
quantum computation in 1982, various models of
"quantum computers" have been proposed. These
models include quantum Turing machines and quantum
circuits. In this paper we define another quantum
computational model, one-dimensional quantum
cellular automata, and demonstrate that any quantum
Turing machine can be efficiently simulated by a onedimensional
quantum cellular automaton with constant
slowdown. This can be accomplished by consideration
of a ... (Update)
Context of citations to this paper: More
...of simple, local unitary transformations. This problem has been solved in the special case of linearly bounded quantum cellular automata [24, 45]. Finally, several researchers have explored the computational power of quantum Turing Machines. Early work by Deutsch and Jozsa [22]...
...quantum computational device: its time evolution operator has to be unitary. For QTMs [7] space periodic LQCAs [9] and partitioned LQCAs [25] well formedness implies unitarity, but not for the model of LQCAs we consider here. Building on the present algorithm we gave in a...
Cited by: More
Quantum Computation - Aharonov (1998)
(Correct)
A Decision Procedure For Unitary Linear Quantum Cellular Automata - Dürr, Santha (1999)
(Correct)
BOOK REVIEW on A New Kind of Science by Stephen Wolfram Wolfram - Aaronson (2001)
(Correct)
Active bibliography (related documents): More All
0.0: Logical Universality and Self-Reproduction in Reversible.. - Morita, Imai (1996)
(Correct)
0.0: Unknown - Th Summer School (1998)
(Correct)
0.0: Cellular Automata and Artificial Life - Computation and Life in.. - Morita (1998)
(Correct)
Similar documents based on text: More All
0.4: Configuration-Interaction Based Simulation of a.. - Girlanda..
(Correct)
0.4: International Journal Of Circuit Theory And Applications - Int Circ Theor
(Correct)
0.3: Evaluation of the Effect of Fabrication Tolerances on the.. - Macucci, al. (2000)
(Correct)
Related documents from co-citation: More All
10: Quantum complexity theory
- Bernstein, Vazirani - 1993
10: Quantum circuit complexity
- Yao - 1993
10: Online preprint quant-ph (context) - Benioff, Robots et al. - 1997
BibTeX entry: (Update)
J. Watrous. On one-dimensional quantum cellular automata. In 36th Annual Symposium on Foundations of Computer Science, pages 528-537, Milwaukee, Wisconsin, (October 1995). IEEE. http://citeseer.ist.psu.edu/watrous95onedimensional.html More
@inproceedings{ watrous95onedimensional,
author = "John Watrous",
title = "On One-Dimensional Quantum Cellular Automata",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "528-537",
year = "1995",
url = "citeseer.ist.psu.edu/watrous95onedimensional.html" }
Citations (may not include all citations):
173
Quantum Complexity Theory
- Bernstein, Vazirani - 1993
168
Algorithms for Quantum Computation: Discrete Logarithms and ..
- Shor - 1994
118
the Church-Turing Principle and the Universal Quantum Comput.. (context) - Deutsch, Theory - 1985
116
Simulating Physics with Computers
- Feynman - 1982
32
Foundations of Computer Science (context) - Yao, Complexity et al. - 1993
27
An Introduction to Hilbert Space (context) - Young - 1988
18
Computation Universality of One-Dimensional Reversible (context) - Morita, Harao - 1989
1
Macmillan and Co (context) - Cooke, Matrices et al. - 1950
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.wisc.edu/~watrous/publications.html):
Relationships Between Quantum and Classical Space-Bounded.. - Watrous (1998)
(Correct)
On the Power of Quantum Finite State Automata - Kondacs, Watrous (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC