Lower Bounds on the Probability of Error for Classical and Classical-Quantum Channels
Author:
- 26 September 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 59 (12) , 8027-8056
Abstract
In this paper, lower bounds on error probability in coding for discrete classical and classical-quantum channels are studied. The contribution of the paper goes in two main directions: 1) extending classical bounds of Shannon to classical-quantum channels, and 2) proposing a new framework for lower bounding the probability of error of channels with a zero-error capacity in the low rate region. The relation between these two problems is revealed by showing that Lovász' bound on zero-error capacity emerges as a natural consequence of the sphere packing bound once we move to the more general context of classical-quantum channels. A variation of Lovász' bound is then derived to lower bound the probability of error in the low rate region by means of auxiliary channels. As a result of this study, connections between the Lovász theta function, the expurgated bound of Gallager, the cutoff rate of a classical channel, and the sphere packing bound for classical-quantum channels are established.Keywords
All Related Versions
This publication has 43 references indexed in Scilit:
- Quantum Information Theory2013
- Min- and Max-Relative Entropies and a New Entanglement MonotoneIEEE Transactions on Information Theory, 2009
- The Chernoff lower bound for symmetric quantum hypothesis testingThe Annals of Statistics, 2009
- Asymptotic Error Rates in Quantum Hypothesis TestingCommunications in Mathematical Physics, 2008
- Cut-off rate for quantum communication channels with entangled measurementQuantum and Semiclassical Optics: Journal of the European Optical Society Part B, 1998
- Generalized cutoff rates and Renyi's information measuresIEEE Transactions on Information Theory, 1995
- Linear Matrix Inequalities in System and Control Theory1994
- Hypothesis testing and information theoryIEEE Transactions on Information Theory, 1974
- Information radiusProbability Theory and Related Fields, 1969
- Exponential error bounds for erasure, list, and decision feedback schemesIEEE Transactions on Information Theory, 1968