Details
| Original language | Russian |
|---|---|
| Pages (from-to) | 25-34 |
| Number of pages | 10 |
| Journal | Problemy Peredachi Informatsii |
| Volume | 36 |
| Issue number | 4 |
| Publication status | Published - 2000 |
Abstract
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Problemy Peredachi Informatsii, Vol. 36, No. 4, 2000, p. 25-34.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - On the additivity hypothesis in quantum information theory
AU - Amosov, G. G.
AU - Holevo, A. S.
AU - Werner, R. F.
PY - 2000
Y1 - 2000
N2 - Summary (translated from the Russian): which can be simply formulated but has not yet been solved, relates to the additivity of some characteristics of a quantum communication channel of `classical capacity' or `maximal output state purity' type with respect to the tensor product of channels. All known results, including numerical verification, are consistent with this hypothesis. An affirmative solution of this problem would mean, in particular, that the use of linked states will not increase classical capacity and would have important significance for quantum information theory. In the present paper we present a formulation of some additivity/multiplicativity problems, study the interrelations between them, and give a proof of partial results that support the hypothesis.rqq
AB - Summary (translated from the Russian): which can be simply formulated but has not yet been solved, relates to the additivity of some characteristics of a quantum communication channel of `classical capacity' or `maximal output state purity' type with respect to the tensor product of channels. All known results, including numerical verification, are consistent with this hypothesis. An affirmative solution of this problem would mean, in particular, that the use of linked states will not increase classical capacity and would have important significance for quantum information theory. In the present paper we present a formulation of some additivity/multiplicativity problems, study the interrelations between them, and give a proof of partial results that support the hypothesis.rqq
M3 - Article
VL - 36
SP - 25
EP - 34
JO - Problemy Peredachi Informatsii
JF - Problemy Peredachi Informatsii
IS - 4
ER -