RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1979 Volume 15, Issue 4, Pages 3–11 (Mi ppi1507)

This article is cited in 18 papers

Information Theory and Coding Theory

On Capacity of a Quantum Communications Channel

A. S. Holevo


Abstract: An example is constructed that shows that the additive property $C_{n+m}=C_n+C_m$ that is characteristic of the capacities in classical information theory need not obtain for a quantum communications channel. In view of this, the definition itself of capacity of a quantum communications channel is in need of refinement. By using the property of subadditiveness, $C_{n+m}\leq C_n+C_m$, which is maintained in the quantum case, it is natural to define the capacity as $C=\lim_{n\to\infty}C_n/n$. Generally speaking, $C>C_1$ in this case. An analog of the classical coding theorem obtains for $C$. Some bounds are obtained for the capacity $C$.

UDC: 621.391.63

Received: 23.02.1978


 English version:
Problems of Information Transmission, 1979, 15:4, 247–253

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025