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.
Depending on the estimated bit error rate, Alice sends Bob a ˆKEC-bit random bits
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.