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.

書誌詳細
主要な著者: Deutsch, D, Barenco, A, Ekert, A
フォーマット: Journal article
出版事項: 1995