The strong converse exponent of composable randomness extraction against quantum side information
Abstract
We find a tight characterization of the strong converse exponent for randomness extraction against quantum side information. In contrast to previous tight bounds, we employ a composable error criterion given by the fidelity (or purified distance) to a uniform distribution in product with the marginal state. Our characterization is formulated in terms of the club-sandwiched conditional entropy, recently introduced by Rubboli, Goodarzi, and Tomamichel. It extends the corresponding result for classical side information, whose strong converse exponent was first established by Berta and Yao and later recovered by Li, Li, and Yu within this entropic framework. This provides the first precise operational interpretation of this family of conditional entropies in the quantum setting.
Fields of Study & Subjects
Quantum Information and Cryptography
Quantum Computing Algorithms and Architecture
Computability
Logic
AI Algorithms
Publication details
- Journal / source
- IEEE Transactions on Information Theory
- Pages
- 1–1
- Publication date
- 1 January 2026