𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of the realization of subdefinite matrices by gate schemes

✍ Scribed by A. E. Andreev

Publisher
SP MAIK Nauka/Interperiodica
Year
1987
Tongue
English
Weight
375 KB
Volume
41
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the realizability of fundamental circ
On the realizability of fundamental circuit matrices
✍ Yoji Kajitani πŸ“‚ Article πŸ“… 1970 πŸ› Elsevier Science 🌐 English βš– 672 KB

This paper presents a necessary and sufltcient condition for the realizability of the fundamental circuit matrix without construction of the corresponding graph. The result affords an eficient algorithm of realizing the graphs with a given fundamental circuit matrix. The idea is mainly based upon th

Realization of the universal-NOT gate an
Realization of the universal-NOT gate and of the universal quantum cloning
✍ C. Sias; F. Sciarrino; F. De Martini πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 248 KB

## Abstract An arbitrary quantum state cannot be β€œcloned” perfectly, i.e. reproduced with β€œfidelity” __F__ = 1 into __M__ > 1 states identical to the original by any conceivable physical device. The main root of this impossibility resides in the linearity of quantum mechanics. A second β€œquantum imp