TY - GEN
T1 - Classical capacity of averaged quantum channels
AU - Bjelaković, Igor
AU - Boche, Holger
PY - 2008
Y1 - 2008
N2 - In this paper we extend recent coding results by Datta and Dorlas on classical capacity of averaged quantum channels with finitely many memoryless branches to arbitrary number of branches. Only assumption in our approach is that the channel satisfies some weak measurability properties. Our approach to the direct coding theorem is based on our previous work on compound classical-quantum channels. The weak converse requires an alternative characterization of the essential infimum and the remaining proof proceeds via application of Holevo's bound and Fano's inequality.
AB - In this paper we extend recent coding results by Datta and Dorlas on classical capacity of averaged quantum channels with finitely many memoryless branches to arbitrary number of branches. Only assumption in our approach is that the channel satisfies some weak measurability properties. Our approach to the direct coding theorem is based on our previous work on compound classical-quantum channels. The weak converse requires an alternative characterization of the essential infimum and the remaining proof proceeds via application of Holevo's bound and Fano's inequality.
UR - http://www.scopus.com/inward/record.url?scp=52349103281&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2008.4594953
DO - 10.1109/ISIT.2008.4594953
M3 - Conference contribution
AN - SCOPUS:52349103281
SN - 9781424422579
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 86
EP - 90
BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Y2 - 6 July 2008 through 11 July 2008
ER -