A brief history of cellular automata
ACM Computing Surveys (CSUR)
Theory of cellular automata: a survey
Theoretical Computer Science
From Dirac to Diffusion: Decoherence in Quantum Lattice Gases
Quantum Information Processing
Journal of the ACM (JACM)
Modeling quantum dot devices in Cell-DEVS environment
Proceedings of the 2008 Spring simulation multiconference
One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
Language and Automata Theory and Applications
Measurement-based and universal blind quantum computation
SFM'10 Proceedings of the Formal methods for quantitative aspects of programming languages, and 10th international conference on School on formal methods for the design of computer, communication and software systems
Quantum Information & Computation
On reversible cellular automata with finite cell array
UC'05 Proceedings of the 4th international conference on Unconventional Computation
A simple n-dimensional intrinsically universal quantum cellular automaton
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Intrinsically universal n-dimensional quantum cellular automata
Journal of Computer and System Sciences
On the Circuit Depth of Structurally Reversible Cellular Automata
Fundamenta Informaticae
| Hi-index | 0.00 |
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.