Security of discrete-modulated continuous-variable quantum key distribution
Résumé
To do so, and contrary to most of the existing schemes, we first discretize all the continuous variables generated during the protocol. This allows us to use the entropy accumulation theorem, a tool that has previously been used in the setting of discrete variables, to construct the finite-size security proof. We then compute the corresponding finite-key rates through semi-definite programming and under a photon-number cutoff. Our analysis provides asymptotic rates in the range of 0.1 -10 -4 bits per round for distances up to hundred kilometres, while in the finite case and for realistic parameters, we get of the order of 10 Gbits of secret key after n ∼ 10 11 rounds and distances of few tens of kilometres. Contents A Proof of Lemma 3 B Proof of Lemma 4 C Upper bounding the classical smooth max entropy D Perturbative analysis for finite-key distillation References.
Domaines
Physique Quantique [quant-ph]Origine | Fichiers produits par l'(les) auteur(s) |
---|