Sphere-packing bound for classical-quantum channels

Publication Type:
Conference Proceeding
Citation:
IEEE International Symposium on Information Theory - Proceedings, 2018, 2018-January pp. 479 - 483
Issue Date:
2018-01-31
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
08278039.pdfPublished version153.92 kB
Adobe PDF
© 2017 IEEE. We study lower bounds on the optimal error probability in channel coding at rates below capacity, commonly termed sphere-packing bounds. In this work, we establish a sphere-packing bound for classical-quantum channels, which significantly improves previous prefactor from the order of subexponential to polynomial. Furthermore, the gap between the obtained error exponent for constant composition codes and the best known classical random coding exponent vanishes in the order of o(log n/n), indicating our sphere-packing bound is almost exact in the high rate regime. The main technical contributions are two converse Hoeffding bounds for quantum hypothesis testing and the saddle-point properties of error exponent functions.
Please use this identifier to cite or link to this item: