A virtual protocol based on universal source compression enables asymptotically tight finite-size security proofs for permutation-symmetrizable QKD by reducing the problem to conditional Rényi entropy estimation.
Duality between source coding with quantum side information and c-q channel coding
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this paper, we establish an interesting duality between two different quantum information-processing tasks, namely, classical source coding with quantum side information, and channel coding over c-q channels. The duality relates the optimal error exponents of these two tasks, generalizing the classical results of Ahlswede and Dueck. We establish duality both at the operational level and at the level of the entropic quantities characterizing these exponents. For the latter, the duality is given by an exact relation, whereas for the former, duality manifests itself in the following sense: an optimal coding strategy for one task can be used to construct an optimal coding strategy for the other task. Along the way, we derive a bound on the error exponent for c-q channel coding with constant composition codes which might be of independent interest.
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Asymptotically tight security analysis of quantum key distribution based on universal source compression
A virtual protocol based on universal source compression enables asymptotically tight finite-size security proofs for permutation-symmetrizable QKD by reducing the problem to conditional Rényi entropy estimation.