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.
[1]
M. Zwaan.
An introduction to hilbert space
,
1990
.
[2]
Umesh V. Vazirani,et al.
Quantum complexity theory
,
1993,
STOC.
[3]
Peter W. Shor,et al.
Algorithms for quantum computation: discrete logarithms and factoring
,
1994,
Proceedings 35th Annual Symposium on Foundations of Computer Science.
[4]
R. G. Cooke,et al.
Infinite Matrices and Sequence Spaces
,
1966
.
[5]
D. Deutsch.
Quantum theory, the Church–Turing principle and the universal quantum computer
,
1985,
Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.
[6]
R. Feynman.
Simulating physics with computers
,
1999
.
[7]
H. S. Allen.
The Quantum Theory
,
1928,
Nature.
[8]
K. Morita,et al.
Computation universality of one-dimensional reversible (injective) cellular automata
,
1989
.
[9]
Andrew Chi-Chih Yao,et al.
Quantum Circuit Complexity
,
1993,
FOCS.