Theory of Probability and Its Applications

Coding Theorems for Hybrid Channels

A. A. Kuznetsova, A. S. Holevo

Published Jan 1, 2014• 4 citations

Abstract

The main result of this paper is the coding theorem for the entanglement-assisted capacity of measurement channel with arbitrary alphabet (Theorem \refcea). As a by-product, a number of results concerning entropies of hybrid (classical-quantum) systems are obtained, as well as the capacities of channels with hybrid output, which are used in the proof of Theorem 3.

DOI: 10.1137/s0040585x97986527

Related papers

On the Proof of the Entanglement-assisted Coding Theorem for a Quantum Measurement Channel

A. A. Kuznetsova

Abstract We consider the notion of conditional entropy in hybrid (quantum-classical) systems and prove some of its properties. As an application we estimate the capacity of a measurement channel augmented by quantum feedback. We also refine the proof of the coding theorem for the entanglement-assisted classical capacity of the measurement channel with arbitrary output alphabet given in [1, 2].

Lobachevskii Journal of MathematicsOct 1, 20211 citation

Coding Theorems for Hybrid Channels. II

A. A. Kuznetsova, Alexander Semenovich Holevo

The present paper continues investigation of the capacities of measurement (quantum-classical) channels in the most general setting, initiated in [A. A. Kuznetsova and A. S. Holevo, Theory Probab. Appl., 58 (2014), pp. 264--285]. The proof of coding theorems is given for the classical capacity and entanglement-assisted classical capacity of the measurement channel with arbitrary output alphabet, without assuming that the channel is given by a bounded operator-valued density.

arXiv:1408.3255Theory of Probability and Its ApplicationsJan 1, 20155 citations

Entanglement-Assisted Capacities of Constrained Quantum Channels

Alexander Semenovich Holevo

In this paper we fill a gap in previous works by proving the conjectured formula for the classical entanglement-assisted capacity of a quantum channel with additive constraint (such as the Bosonic Gaussian channel). Our main tools are the coding theorem for classical-quantum constrained channels and a finite-dimensional approximation of the input density operators for entanglement-assisted capacity. We also give sufficient conditions under which suprema in the capacity formulas are achieved.

Theory of Probability and Its ApplicationsJan 1, 200453 citations

Entanglement-assisted capacity of constrained channels

A. S. Holevo

In this paper we fil a gap in previous work by proving the conjectured formula for the antanglement-assisted capacity of quantum channel with additive input constraint (such as Bosonic Gaussian channel). The main tools are the coding theorem for classical-quantum constrained channels and a finite dimensional approximation of the input density operators for the entanglement-assisted capacity.

arXiv:quant-ph/0211170Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIEJul 23, 200324 citations

Coding Theorems of Quantum Information Theory

Andreas Winter

Coding theorems and (strong) converses for memoryless quantum communication channels and quantum sources are proved: for the quantum source the coding theorem is reviewed, and the strong converse proven. For classical information transmission via quantum channels we give a new proof of the coding theorem, and prove the strong converse, even under the extended model of nonstationary channels. As a by-product we obtain a new proof of the famous Holevo bound. Then multi-user systems are investigated, and the capacity region for the quantum multiple access channel is determined. The last chapter contains a preliminary discussion of some models of compression of correlated quantum sources, and a proposal for a program to obtain operational meaning for quantum conditional entropy. An appendix features the introduction of a notation and calculus of entropy in quantum systems.

arXiv:quant-ph/9907077Jul 24, 1999108 citations

Quantum coding theorems

Alexander Semenovich Holevo

Contents I. Introduction II. General considerations § 1. Quantum communication channel § 2. Entropy bound and channel capacity § 3. Formulation of the quantum coding theorem. Weak conversion III. Proof of the direct statement of the coding theorem § 1. Channels with pure signal states § 2. Reliability function § 3. Quantum binary channel § 4. Case of arbitrary states with bounded entropy IV. c-q channels with input constraints § 1. Coding theorem § 2. Gauss channel with one degree of freedom § 3. Classical signal on quantum background noise Bibliography

arXiv:quant-ph/9809023Russian Mathematical SurveysDec 31, 1998230 citations