Information Reconciliation for Continuous-Variable Quantum Key Distribution Beyond the Devetak-Winter Bound Using Short Blocklength Error Correction Codes

In this paper we introduce a reconciliation protocol with a two-step error correction scheme using a short blocklength low rate code and a long blocklength high rate code. We show that by using this two-step decoding method it is possible to achieve secret key rates beyond the Devetak-Winter bound....

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2024-09
Main Authors: Gümüş, Kadir, João dos Reis Frazão, Albores-Mejia, Aaron, Škorić, Boris, Liga, Gabriele, Yunus Can Gültekin, Bradley, Thomas, Alvarado, Alex, Okonkwo, Chigo
Format: Article
Language:English
Subjects:
Decoding
Error correction
Quantum cryptography
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we introduce a reconciliation protocol with a two-step error correction scheme using a short blocklength low rate code and a long blocklength high rate code. We show that by using this two-step decoding method it is possible to achieve secret key rates beyond the Devetak-Winter bound. We simulate the protocol using short blocklength low-density parity check code, and show that we can obtain reconciliation efficiencies up to 1.5. Using these high reconciliation efficiencies, it is possible double the achievable distances of CV-QKD systems.
ISSN:2331-8422