Sphere-packing bound for symmetric classical-quantum channels
Journal
IEEE International Symposium on Information Theory - Proceedings
Pages
286-290
Date Issued
2017
Author(s)
Abstract
"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. ? 2017 IEEE.
Subjects
Information theory; Packing; Quantum entanglement; Classical-quantum channels; Concentration inequality; Error exponent; Large deviation theory; Optimal error; Random coding; Sphere packing bound; Sphere packings; Communication channels (information theory)
SDGs
Type
conference paper