Sphere-packing bound for symmetric classical-quantum channels

Publication Type:
Conference Proceeding
Citation:
IEEE International Symposium on Information Theory - Proceedings, 2017, pp. 286 - 290
Issue Date:
2017-08-09
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
1701.02957v2.pdfSubmitted Version284.58 kB
Adobe PDF
© 2017 IEEE. "To be considered for the 2017 IEEE Jack Keil Wolf ISIT Student Paper Award." We provide a sphere-packing lower bound for the optimal error probability in finite blocklengths when coding over a symmetric classical-quantum channel. Our result shows that the pre-factor can be significantly improved from the order of the subexponential to the polynomial, This established pre-factor is arguably optimal because it matches the best known random coding upper bound in the classical case. Our approaches rely on a sharp concentration inequality in strong large deviation theory and crucial properties of the error-exponent function.
Please use this identifier to cite or link to this item: