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.
Reference17 articles.
1. A universal two-bit gate for quantum computation
2. Conditional Quantum Dynamics and Logic Gates
3. Quantum cryptography using any two nonorthogonal states
4. Bennett C. H. & Brassard G. 1984 In Proc. IEEE Int. Conf. on Computers Systems and Signal Processing. New York: IEEE.
5. Bernstein E. & Vazirani U. 1993 In Proc. 25th ACM Symp. on Theory of Computation p. 11.
Cited by
320 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献