Universality in Quantum Computation
arXiv:quant-ph/9505018 · doi:10.1098/rspa.1995.0065
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.
11 pages, LaTeX