Efficient Information Reconciliation for High-Dimensional Quantum Key Distribution

TL;DR

This paper introduces two novel information reconciliation methods for high-dimensional quantum key distribution, utilizing nonbinary LDPC codes and the Cascade algorithm to improve efficiency close to theoretical limits.

Contribution

It presents new reconciliation techniques specifically designed for high-dimensional QKD, enhancing performance over existing methods.

Findings

Achieves reconciliation efficiencies near the Slepian-Wolf bound.

Demonstrates improved throughput and range for high-dimensional QKD systems.

Introduces nonbinary LDPC and Cascade-based methods tailored for q-ary channels.

Abstract

The Information Reconciliation phase in quantum key distribution has significant impact on the range and throughput of any QKD system. We explore this stage for high-dimensional QKD implementations and introduce two novel methods for reconciliation. The methods are based on nonbinary LDPC codes and the Cascade algorithm, and achieve efficiencies close the the Slepian-Wolf bound on q-ary symmetric channels.