Published Articles >> Table of Contents >> Abstract

36th Annual Symposium on Foundations of Computer Science (FOCS'95)   p. 528
On one-dimensional quantum cellular automata
J. Watrous, Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1995.492583
Send link to a friend

Abstract
Since Richard Feynman introduced the notion of quantum computation in 1982, various models of "quantum computers" have been proposed (R. Feynman, 1992). These models include quantum Turing machines and quantum circuits. We define another quantum computational model, one dimensional quantum cellular automata, and demonstrate that any quantum Turing machine can be efficiently simulated by a one dimensional quantum cellular automaton with constant slowdown. This can be accomplished by consideration of a restricted class of one dimensional quantum cellular automata called one dimensional partitioned quantum cellular automata. We also show that any one dimensional partitioned quantum cellular automaton can be simulated by a quantum Turing machine with linear slowdown, but the problem of efficiently simulating an arbitrary one dimensional quantum cellular automaton with a quantum Turing machine is left open. From this discussion, some interesting facts concerning these models are easily deduced.
Back to Top Additional Information
Index Terms- quantum theory; cellular automata; Turing machines; simulation; physics computing; physics; one-dimensional quantum cellular automata; quantum computation; quantum computers; quantum computational model; one dimensional quantum cellular automata; quantum Turing machine; constant slowdown; one dimensional partitioned quantum cellular automata; linear slowdown; 1D partitioned quantum cellular automaton simulation Citation:  J. Watrous, "On one-dimensional quantum cellular automata," focs, p. 528,  36th Annual Symposium on Foundations of Computer Science (FOCS'95),  1995