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

2024/09/20 by Kadir Gümüş, Gümüş, Kadir, João Frazão +14
Computer Science · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography

paper · pdf · doi:10.48550/arxiv.2409.13667

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.

Related

• Short Blocklength Error Correction Codes for Continuous-Variable Quantum Key Distribution
• Continuous-Variable Quantum Key Distribution with key rates far above the PLOB bound
• Repeat-Accumulate Codes for Reconciliation in Continuous Variable\n Quantum Key Distribution
• Information Reconciliation for Continuous-Variable Quantum Key Distribution using Non-Binary Low-Density Parity-Check Codes
• A Simple Approach to Error Reconciliation in Quantum Key Distribution