Universality in Quantum Computation
ArXiv quant-ph/9505018 (1995)
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.Conditional Quantum Dynamics and Logic Gates.
Phys Rev Lett 74:20 (1995) 4083-4086
Conditional Quantum Dynamics and Logic Gates
ArXiv quant-ph/9503017 (1995)