A universal quantum cellular automaton

@inproceedings{Dam1996AUQ,
  title={A universal quantum cellular automaton},
  author={Wim van Dam},
  year={1996}
}
We will prove the existence of a universal quantum cellular automaton. Such qca are defined as the quantum-mechanical pendant of classical one-dimensional cellular automata. As is the case with quantum Turing machines, the well-formedness restriction plays an important role. It will be shown that every proper qca obeys a local constraint which is comparable with the ‘inverse neighborhood’ of classical reversible cellular automata. This allows us to describe every qca as a periodic quantum gate… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Quantum computational networks

  • Deutsch, David
  • Proceedings of the Royal Society of London A
  • 1989
Highly Influential
4 Excerpts

Quantum Computation, to appear in Complexity Theory Retrospective II, Springer–Verlag

  • Berthiaume, Andre
  • 1996
1 Excerpt

A Universal Two-Bit Gate for Quantum Computation

  • Barenco, Adriano
  • Proceedings of the Royal Society of London A
  • 1995
3 Excerpts

Similar Papers

Loading similar papers…