Tight One-Shot Analysis for Convex Splitting with Applications in Quantum Information Theory

From MaRDI portal
Publication:6434097

arXiv2304.12055MaRDI QIDQ6434097FDOQ6434097


Authors: Hao-Chung Cheng, Li Gao Edit this on Wikidata


Publication date: 24 April 2023

Abstract: Convex splitting is a powerful technique in quantum information theory used in proving the achievability of numerous information-processing protocols such as quantum state redistribution and quantum network channel coding. In this work, we establish a one-shot error exponent and a one-shot strong converse for convex splitting with trace distance as an error criterion. Our results show that the derived error exponent (strong converse exponent) is positive if and only if the rate is in (outside) the achievable region. This leads to new one-shot exponent results in various tasks such as communication over quantum wiretap channels, secret key distillation, one-way quantum message compression, quantum measurement simulation, and quantum channel coding with side information at the transmitter. We also establish a near-optimal one-shot characterization of the sample complexity for convex splitting, which yields matched second-order asymptotics. This then leads to stronger one-shot analysis in many quantum information-theoretic tasks.













This page was built for publication: Tight One-Shot Analysis for Convex Splitting with Applications in Quantum Information Theory

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