Answers are grounded in this paper and cite their sources.
We prove the existence of a class of two-input, two-output gates any one of which is universal for quantum computation. This is done by explicitly constructing the three-bit gate introduced by Deutsch ( Proc. R. Soc. Lond. A 425, 73 (1989)) as a network consisting of replicas of a single two-bit gate.
No takes yet. Share an insight, caveat, or question.
Adriano Barenco (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: