Bonn 2025 – scientific programme

Parts | Days | Selection | Search | Updates | Downloads | Help

QI: Fachverband Quanteninformation

QI 26: Quantum Communication I: Theory

QI 26.3: Talk

Thursday, March 13, 2025, 11:45–12:00, HS IX

Iterative Sifting in QKD — •Yien Liang, Hermann Kampermann, and Dagmar Bruß — Institut für Theoretische Physik III, Heinrich-Heine-Universität Düsseldorf, Universitätsstr. 1, D-40225 Düsseldorf, Germany

We investigate the security of a QKD scheme, where Bob announces publicly his choice of measurement basis right after each detection. Such a scheme saves memory and avoids sending all the classical information only at the end of each block. In previous work the security of such a scheme is based on Azuma's inequality [1], with reduced key rate in comparison to conventional sifting. Our work improves the bound for iterative sifting, restoring the key rate of conventional sifting. We will additionally show how to save classical communication for privacy amplification in the conventional and the iterative scheme.

Reference:

[1] Kiyoshi Tamaki et al 2018 Quantum Sci. Technol. 3 014002

Keywords: Quantum Key Distribution; Quantum Cryptography; Quantum Communication; Concentration Inequalities; Quantum Key Distribution Post-processing