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
  • Mathematics, 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… Expand
165 Citations
An Introduction to Quantum Cellular Automata
  • 4
  • PDF
A Decision Procedure for Unitary Linear Quantum Cellular Automata
  • 42
  • PDF
A universal quantum cellular automaton
  • 14
  • Highly Influenced
  • PDF
An overview of quantum computation models: quantum automata
  • Daowen Qiu, L. Li
  • Computer Science
  • Frontiers of Computer Science in China
  • 2008
  • 16
Reversible quantum cellular automata
  • 119
  • PDF
A decision procedure for unitary linear quantum cellular automata
  • C. Dürr, M. Santha
  • Mathematics, Computer Science
  • Proceedings of 37th Conference on Foundations of Computer Science
  • 1996
  • 6
  • Highly Influenced
  • PDF
An overview of quantum cellular automata
  • P. Arrighi
  • Computer Science, Physics
  • Natural Computing
  • 2019
  • 25
  • Highly Influenced
  • PDF
Discrete Time Quantum Lattice Systems
  • 7
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 12 REFERENCES
Quantum complexity theory
  • 747
  • PDF
Computation universality of one-dimensional reversible (injective) cellular automata
  • 139
  • PDF
Quantum theory, the Church–Turing principle and the universal quantum computer
  • D. Deutsch
  • Mathematics
  • Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1985
  • 3,562
  • PDF
Quantum Circuit Complexity
  • A. Yao
  • Mathematics, Computer Science
  • FOCS
  • 1993
  • 671
  • PDF
Algorithms for quantum computation: discrete logarithms and factoring
  • P. Shor
  • Mathematics, Computer Science
  • Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
  • 4,898
  • PDF
The Quantum Theory
  • 1,246
  • PDF
Simulating physics with computers
  • 5,057
  • PDF
Quantum Circuit Complexity , Proc . 34 thAnn
  • Quantum Complexity Theory , Proc . 25 th Ann . ACM Symp . on Theory of Computing
  • 1993
An introduction to hilbert space
  • 333
A n Introduction to Hilbert Space, Canibridge
  • 1988
...
1
2
...