Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0908.2042

Problems in application of LDPC codes to information reconciliation in quantum key distribution protocols

Ryutaroh Matsumoto

Published Aug 14, 2009• 9 citations
arXivHTMLPDF

Abstract

The information reconciliation in a quantum key distribution protocol can be studied separately from other steps in the protocol. The problem of information reconciliation can be reduced to that of distributed source coding. Its solution by LDPC codes is reviewed. We list some obstacles preventing the LDPC-based distributed source coding from becoming a more favorable alternative to the Cascade protocol for information reconciliation in quantum key distribution protocols. This exposition does not require knowledge of the quantum theory.

DOI
10.48550/arxiv.0908.2042

Related papers

Performance of Cascade and LDPC-codes for Information Reconciliation on Industrial Quantum Key Distribution Systems

Ronny Müller, Claudia De Lazzari, Fernando Chirici +5 more

Information Reconciliation is a critical component of Quantum Key Distribution, ensuring that mismatches between Alice's and Bob's keys are corrected. In this study, we analyze, simulate, optimize, and compare the performance of two prevalent algorithms used for Information Reconciliation: Cascade and LDPC codes in combination with the Blind protocol. We focus on their applicability in practical and industrial settings, operating in realistic and application-close conditions. The results are further validated through evaluation on a live industrial QKD system.

arXiv:2408.15758•Aug 28, 2024•1 citation

The information reconciliation protocol basing on error codes

Sun Niuniu, Zhang Shui-lian, Xin Gang +1 more

Information reconciliation (IR) is an important step in quantum key distribution (QKD). The error correcting codes are widely used in IR, which can also be seen as error correction. But it proved that this approach contains deleting the leaked information in practical applications. Error coding is not always a guarantee of the reconciliation. It only require of the data's consistency and security. In this paper, Author proposed an improvement scheme of LDPC code on the property of reconciliation and performed some number simulations to evaluate that method. It's shown that this method would achieve a higher efficiency than the original algorithm. Therefore, this algorithm has special important meaning to the key generation.

IEEE International Conference on Software Engineering and Service Science (ICSESS)•May 1, 2013•2 citations

Information Reconciliation for High-Dimensional Quantum Key Distribution using Nonbinary LDPC codes

Ronny Müller, Davide Bacco, Leif Katsuo Oxenløwe +1 more

Information Reconciliation is an essential part of Quantum Key distribution protocols that closely resembles Slepian-Wolf coding. The application of nonbinary LDPC codes in the Information Reconciliation stage of a high-dimensional discrete-variable Quantum Key Distribution setup is proposed. We model the quantum channel using a q-ary symmetric channel over which qudits are sent. Node degree distributions optimized via density evolution for the Quantum Key Distribution setting are presented, and we show that codes constructed using these distributions allow for efficient reconciliation of large-alphabet keys.

arXiv:2305.08631•International Symposium on Turbo Codes and Iterative Information Processing•Sep 4, 2023•2 citations

Blind Information Reconciliation With Polar Codes for Quantum Key Distribution

Evgeniy O. Kiktenko, Aleksei Malyshev, Aleksey K. Fedorov

We suggest a new protocol for the information reconciliation stage of quantum key distribution based on polar codes. The suggested approach is based on the blind technique, which is proved to be useful for low-density parity-check (LDPC) codes. We show that the suggested protocol outperforms the blind reconciliation with LDPC codes, especially when there are high fluctuations in quantum bit error rate (QBER).

arXiv:2008.12299•IEEE Communications Letters•Sep 2, 2020•19 citations

High Performance Information Reconciliation for QKD with CASCADE

Thomas B. Pedersen, Mustafa Toyran

It is widely accepted in the quantum cryptography community that interactive information reconciliation protocols, such as cascade, are ineffcient due to the communication overhead. Instead, non-interactive information reconciliation protocols based on i.e. LDPC codes or, more recently, polar codes have been proposed. In this work, we argue that interactive protocols should be taken into consideration in modern quantum key distribution systems. In particular, we demonstrate how to improve the performance of cascade by proper implementation and use. Our implementation of cascade reaches a throughput above 80 Mbps under realistic conditions. This is more than four times the throughput previously demonstrated in any information reconciliation protocol.

arXiv:1307.7829•Jul 30, 2013•7 citations

Performance of Cascade and LDPC Codes for Information Reconciliation on Industrial Quantum Key Distribution Systems

Ronny Müller, Claudia De Lazzari, Fernando Chirici +5 more

ABSTRACT Information reconciliation is a critical component of quantum key distribution, ensuring that mismatches between Alice's and Bob's keys are corrected. In this study, we analyse, simulate, optimise and compare the performance of two prevalent algorithms used for information reconciliation: Cascade and LDPC codes in combination with the blind protocol. We focus on their applicability in practical and industrial settings, operating in realistic and application‐close conditions. The results are further validated through evaluation on a live industrial QKD system.

IET Quantum Communication•Jan 1, 2025•3 citations
The information reconciliation in a quantum key distribution protocol can be studied separately from other steps in the protocol. The problem of information reconciliation can be reduced to that of distributed source coding. Its solution by LDPC codes is reviewed. We list some obstacles preventing the LDPC-based distributed source coding from becoming a more favorable alternative to the Cascade protocol for information reconciliation in quantum key distribution protocols. This exposition does not require knowledge of the quantum theory.
Information Reconciliation is a critical component of Quantum Key Distribution, ensuring that mismatches between Alice's and Bob's keys are corrected. In this study, we analyze, simulate, optimize, and compare the performance of two prevalent algorithms used for Information Reconciliation: Cascade and LDPC codes in combination with the Blind protocol. We focus on their applicability in practical and industrial settings, operating in realistic and application-close conditions. The results are further validated through evaluation on a live industrial QKD system.
Information reconciliation (IR) is an important step in quantum key distribution (QKD). The error correcting codes are widely used in IR, which can also be seen as error correction. But it proved that this approach contains deleting the leaked information in practical applications. Error coding is not always a guarantee of the reconciliation. It only require of the data's consistency and security. In this paper, Author proposed an improvement scheme of LDPC code on the property of reconciliation and performed some number simulations to evaluate that method. It's shown that this method would achieve a higher efficiency than the original algorithm. Therefore, this algorithm has special important meaning to the key generation.
Information Reconciliation is an essential part of Quantum Key distribution protocols that closely resembles Slepian-Wolf coding. The application of nonbinary LDPC codes in the Information Reconciliation stage of a high-dimensional discrete-variable Quantum Key Distribution setup is proposed. We model the quantum channel using a q-ary symmetric channel over which qudits are sent. Node degree distributions optimized via density evolution for the Quantum Key Distribution setting are presented, and we show that codes constructed using these distributions allow for efficient reconciliation of large-alphabet keys.
It is widely accepted in the quantum cryptography community that interactive information reconciliation protocols, such as cascade, are ineffcient due to the communication overhead. Instead, non-interactive information reconciliation protocols based on i.e. LDPC codes or, more recently, polar codes have been proposed. In this work, we argue that interactive protocols should be taken into consideration in modern quantum key distribution systems. In particular, we demonstrate how to improve the performance of cascade by proper implementation and use. Our implementation of cascade reaches a throughput above 80 Mbps under realistic conditions. This is more than four times the throughput previously demonstrated in any information reconciliation protocol.
ABSTRACT Information reconciliation is a critical component of quantum key distribution, ensuring that mismatches between Alice's and Bob's keys are corrected. In this study, we analyse, simulate, optimise and compare the performance of two prevalent algorithms used for information reconciliation: Cascade and LDPC codes in combination with the blind protocol. We focus on their applicability in practical and industrial settings, operating in realistic and application‐close conditions. The results are further validated through evaluation on a live industrial QKD system.