CRQUANT-PHMay 22, 2012

LDPC for QKD Reconciliation

arXiv:1205.4977v222 citations
AI Analysis

This work addresses the need for practical algorithm descriptions and performance analysis to support QKD deployment, but it is incremental as it applies existing LDPC methods to QKD without introducing new paradigms.

The paper tackles the problem of adapting Low Density Parity Check (LDPC) forward error correction for Quantum Key Distribution (QKD) protocols by evaluating standard parity check matrices as a function of quantum bit error rate, providing a performance analysis and computational precision requirements for developers.

We present the Low Density Parity Check (LDPC) forward error correction algorithm adapted for the Quantum Key Distribution (QKD) protocol in a form readily applied by developers. A sparse parity check matrix is required for the LDPC algorithm and we suggest using some that have been defined by the IEEE and ETSI standards organizations for use in various communication protocols. We evaluate the QKD performance of these various parity check matrices as a function of the quantum bit error rate. We also discuss the computational precision required for this LPDC algorithm. As QKD evolves towards deployment, complete algorithm descriptions and performance analysis, as we present, will be required.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes