Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
A 1995 study studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: