On one-dimensional quantum cellular automata

@article{Watrous1995OnOQ,
  title={On one-dimensional quantum cellular automata},
  author={J. Watrous},
  journal={Proceedings of IEEE 36th Annual Foundations of Computer Science},
  year={1995},
  pages={528-537}
}
  • J. Watrous
  • Published 1995
  • Computer Science
  • Proceedings of IEEE 36th Annual Foundations of Computer Science
  • 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… CONTINUE READING
    An Introduction to Quantum Cellular Automata
    3
    A Decision Procedure for Unitary Linear Quantum Cellular Automata
    40
    A universal quantum cellular automaton
    12
    An overview of quantum computation models: quantum automata
    16
    Reversible quantum cellular automata
    108
    An overview of quantum cellular automata
    14
    Discrete Time Quantum Lattice Systems
    6
    Quantum walks via quantum cellular automata
    7

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 10 REFERENCES
    Quantum complexity theory
    603
    Computation Universality of One-Dimensional Reversible (Injective) Cellular Automata
    131
    Quantum Circuit Complexity
    642
    Algorithms for quantum computation: discrete logarithms and factoring
    • P. Shor
    • Computer Science, Mathematics
    • 1994
    4469
    The Quantum Theory
    1146
    Simulating physics with computers
    4605
    An introduction to hilbert space
    307
    Infinite Matrices and Sequence Spaces
    254
    Quantum Circuit Complexity , Proc . 34 thAnn
    • 1993