Universality in Quantum Computation

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.

Detaylı Bibliyografya
Asıl Yazarlar: Deutsch, D, Barenco, A, Ekert, A
Materyal Türü: Journal article
Baskı/Yayın Bilgisi: 1995
Search Result 1

UNIVERSALITY IN QUANTUM COMPUTATION Yazar: Deutsch, D, Barenco, A, Ekert, A

Baskı/Yayın Bilgisi 1995
Journal article