×

Additivity for unital qubit channels. (English) Zbl 1060.94006

Summary: Additivity of the Holevo capacity is proved for product channels, under the condition that one of the channels is a unital qubit channel, with the other completely arbitrary. As a byproduct this proves that the Holevo bound is the classical information capacity of such qubit channels, and provides an explicit formula for this classical capacity. Additivity of minimal entropy and multiplicativity of \(p\)-norms are also proved under the same assumptions. The proof relies on a new bound for the \(p\)-norm of an output state from the half-noisy phase-damping channel.

MSC:

94A17 Measures of information, entropy
81P68 Quantum computation

References:

[1] Amosov
[2] Amosov, Probl. Inf. Transm. 36 pp 305– (2000)
[3] Bennett, C. H., Fuchs, C. A., and Smolin, J. A., ”Entanglement-Enhanced Classical Communication on a Noisy Quantum Channel,” inQuantum Communication, Computing and Measurement, edited by O. Hirota, A. S. Holevo, and C. M. Caves (Plenum, New York, 1997), pp. 79–88.
[4] Bruss, J. Mod. Opt. 47 pp 325– (2000)
[5] Epstein, Commun. Math. Phys. 31 pp 317– (1973)
[6] Fuchs, C., private communication.
[7] Fujiwara, Phys. Rev. A 59 pp 3290– (1999)
[8] Holevo, IEEE Trans. Inf. Theory 44 pp 269– (1998)
[9] Holevo, Russ. Math. Surveys 53 pp 1295– (1999)
[10] King, J. Math. Phys. 43 pp 1247– (2002)
[11] King, IEEE Trans. Inf. Theory 47 pp 1– (2001)
[12] Lieb, E. and Thirring, W., ”Inequalities for the Moments of the Eigenvalues of the Schrödinger Hamiltonian and Their Relation to Sobolev Inequalities,” inStudies in Mathematical Physics, edited by E. Lieb, B. Simon, and A. Wightman (Princeton University Press, Princeton, NJ, 1976), pp. 269–303. · Zbl 0342.35044
[13] Ohya, Prob. Math. Stats. 17 pp 170– (1997)
[14] Schumacher, Phys. Rev. A 56 pp 131– (1997)
[15] Schumacher
[16] Shor · Zbl 1085.81029
[17] Werner
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.