Universality in Quantum Computation

D. Deutsch; A. Barenco; A. Ekert

doi:10.1098/rspa.1995.0065

Universality in Quantum Computation

Quantum Physics 2015-06-26 v1

Authors: D. Deutsch , A. Barenco , A. Ekert

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as logic gates.

Keywords

quantum computing quantum gates and qubits quantum circuit compilation

Cite

@article{arxiv.quant-ph/9505018,
  title  = {Universality in Quantum Computation},
  author = {D. Deutsch and A. Barenco and A. Ekert},
  journal= {arXiv preprint arXiv:quant-ph/9505018},
  year   = {2015}
}

Comments

11 pages, LaTeX

Related papers

View all related →