Sphere-packing bound for classical-quantum channels
Journal
IEEE International Symposium on Information Theory - Proceedings
Journal Volume
2018-January
Pages
479-483
Date Issued
2018
Author(s)
Abstract
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. ? 2017 IEEE.
Subjects
Channel coding; Errors; Packing; Quantum entanglement; Spheres; Classical-quantum channels; Constant composition codes; Error exponent; Hoeffding bound; Quantum hypothesis; Random coding exponent; Sphere packing bound; Technical contribution; Codes (symbols)
Type
conference paper