Finite-size analysis of a continuous-variable quantum key distribution

By Anthony Leverrier, F. Grosshans, Philippe Grangier. 2010

350 citations recorded by the source corpus.

The goal of this paper is to extend the framework of finite-size analysis recently developed for quantum key distribution to continuous-variable protocols. We do not solve this problem completely here, and we mainly consider the finite-size effects on the parameter estimation procedure. Despite the fact that some questions are left open, we are able to give an estimation of the secret key rate for protocols which do not contain a postselection procedure. As expected, these results are significantly more pessimistic than those obtained in the asymptotic regime. However, we show that recent continuous-variable protocols are able to provide fully secure secret keys in the finite-size scenario, over distances larger than $50$ km.

Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics

View Paper: https://www.semanticscholar.org/paper/f910fb1942ba483a5c23397d3240d2e94f33fa8c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Atomic and Molecular Physics, and Optics

Citations in the corpus

Long-distance continuous-variable quantum key distribution over 202.81 km fiber (2020, background): “Then taking finite-size effects into account, the reverse-reconciliation secret key rate is given by the general formula [1, 23]”
Long-distance continuous-variable quantum key distribution by controlling excess noise (2016, methodology): “Another practical distance limitation of our experiment is essentially the finite-size effect, and appear to be due mostly to the excess noise induced by finite statistics 9–11 .”
Continuous‐Variable Quantum Key Distribution with Gaussian Modulation—The Theory of Practical Implementations (2017, background): “sian channels [44, 15, 45]. While these proofs only hold in the asymptotic limit, the security of CV-QKD with nite block sizes is much more involved and, to this date, a vital eld of ongoing research [46, 47, 48, 49]. A non-asymptotic composable2 security proof against collective attacks was rst int”