Information Reconciliation for Continuous-Variable Quantum Key Distribution with $\beta > 1$ Using Short Blocklength Error Correction Codes: Proposal and Concerns

TL;DR

This paper proposes a two-step error correction protocol for continuous-variable quantum key distribution using short and long blocklength codes, achieving high reconciliation efficiency but requiring further security validation.

Contribution

It introduces a novel two-step error correction scheme combining short and long blocklength codes for CV-QKD reconciliation.

Findings

Achieves reconciliation efficiencies above 1.

Uses a short-blocklength low-density parity-check code.

Highlights security proof requirements.

Abstract

In this paper, we introduce a reconciliation protocol with a two-step error correction scheme that uses a short-blocklength, low-rate code and a long-blocklength, high-rate code. We simulate the protocol using a short-block-length low-density parity-check code and show that we can achieve reconciliation efficiencies above 1 using this method. We discuss the necessary steps required regarding security proofs before this protocol can be securely implemented.