Quantum Sphere-Packing Bounds With Polynomial Prefactors

DOI10.1109/TIT.2019.2891347MaRDI QIDQ5223976zbMATHOpenAlexWikidataFDO

Authors Hao-Chung Cheng, Min-Hsiu Hsieh, Marco Tomamichel

Publication date 19 July 2019

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1704.05703

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Combinatorial codes (94B25) Channel models (including quantum) in information and communication theory (94A40)

Abstract: We study lower bounds on the optimal error probability in classical coding over classical-quantum channels at rates below the capacity, commonly termed quantum sphere-packing bounds. Winter and Dalai have derived such bounds for classical-quantum channels; however, the exponents in their bounds only coincide when the channel is classical. In this paper, we show that these two exponents admit a variational representation and are related by the Golden-Thompson inequality, reaffirming that Dalai's expression is stronger in general classical-quantum channels. Second, we establish a sphere-packing bound for classical-quantum channels, which significantly improves Dalai's 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(logn/n)$, indicating our sphere-packing bound is almost exact in the high rate regime. Finally, for a special class of symmetric classical-quantum channels, we can completely characterize its optimal error probability without the constant composition code assumption. The main technical contributions are two converse Hoeffding bounds for quantum hypothesis testing and the saddle-point properties of error exponent functions.

Cited in

(9)

• Discrimination of quantum states under locality constraints in the many-copy setting
• Quantum \(f\)-divergences via Nussbaum-Szkoła distributions and applications to \(f\)-divergence inequalities
• An efficient solution space exploring and descent method for packing equal spheres in a sphere
• The sphere packing bound for memoryless channels
• scientific article; zbMATH DE number 6487863 (Why is no real title available?)
• Properties of noncommutative Rényi and Augustin information
• Reliability function of quantum information decoupling via the sandwiched Rényi divergence
• A simple derivation of the refined sphere packing bound under certain symmetry hypotheses
• Operational interpretation of the sandwiched Rényi divergence of order 1/2 to 1 as strong converse exponents

This page was built for publication: Quantum Sphere-Packing Bounds With Polynomial Prefactors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223976)