Arithmetic Reconciliation for CVQKD: Challenges and Feasibility

TL;DR

This paper evaluates the feasibility of Arithmetic Reconciliation in CVQKD, demonstrating its potential for efficient secret key sharing at low SNRs through mutual information estimation and sequence matching analysis.

Contribution

It provides the first realistic efficiency estimates and rate analysis for Arithmetic Reconciliation in CVQKD, highlighting its low complexity and promising performance.

Findings

Reconciliation efficiency increases at lower SNRs.

Sequence matching rates are promising for practical CVQKD.

Arithmetic Reconciliation is feasible in realistic scenarios.

Abstract

Continuous variable quantum key distribution allows two legitimate parties to share a common secret key and encompasses reconciliation protocols. A relatively new reconciliation protocol, Arithmetic Reconciliation, presents low complexity and has increasing reconciliation efficiency with lower SNRs. In this paper, we obtain reconciliation efficiencies for this protocol in realistic scenarios, by means of estimation of mutual information, and we also present rates for sequence match of secret keys by Alice and Bob. Results show that this technique is feasible and promising to continuous variable quantum key distribution applications.