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

International Journal of Theoretical Physics

QKD Iterative Information Reconciliation Based on LDPC Codes

Guo Limei, Ran Qi, Jin Di, Huang Duan

Published Mar 25, 2020• 13 citations
Publisher
DOI
10.1007/s10773-020-04438-9

Related papers

Information Reconciliation for QKD with Rate-Compatible Non-Binary LDPC Codes

健太 笠井, Kenta Kasai, 隆太郎 松本 +3 more

•Aug 19, 2010•0 citations

Novel intelligent blind information reconciliation for LDPC codes in quantum key distribution systems

Limei Guo, Hsiao‐Chun Wu, Duan Huang

Physical Communication•Mar 26, 2024•4 citations

Flexible Blind Information Reconciliation for QKD based on Rateless Protograph LDPC codes

Marco Ferrari, Alberto Tarable, Rudi Paolo Paganelli

Information Reconciliation (IR) is a crucial step in the process of distillation of unconditionally secure keys in Quantum key distribution (QKD). Novel IR rateless codes based on protograph low-density parity-check (LDPC) codes have been recently designed to replace Cascade. In this paper, a blind IR protocol is described that exploits all the features of rateless protograph LDPC codes.

International Conference on Transparent Optical Networks•Jul 14, 2024•1 citation

Information reconciliation for QKD with rate-compatible non-binary LDPC codes

Kenta Kasai, Ryutaroh Matsumoto, Kohichi Sakaniwa

We study the information reconciliation (IR) scheme for quantum key distribution (QKD) protocols. The IR for the QKD can be seen as the asymmetric Slepian-Wolf problem, which low-density parity-check (LDPC) codes can solve with efficient algorithms, i.e., the belief propagation. However, the LDPC codes are needed to be chosen properly from a collection of codes optimized for multiple key rates, which leads to complex decoder devices and performance degradation for unoptimized key rates. Therefore, it is desired that establish an IR scheme with a single LDPC code which supports multiple rates. To this end, in this paper, we propose an IR scheme with a rate-compatible non-binary LDPC code. Numerical results show the proposed scheme achieves IR efficiency comparable to the best know conventional IR scheme with lower decoding error rates.

International Symposium on Information Theory and its Applications•Oct 1, 2010•24 citations

Effective rate-adaptive reconciliation for CV-QKD using QC-MET-LDPC codes

Kun Zhang, Jia Hou, Xueqin Jiang +3 more

Science China Information Sciences•Jul 4, 2025•3 citations

Rateless Protograph LDPC Codes for Quantum Key Distribution

Alberto Tarable, Rudi Paolo Paganelli, Marco Ferrari

Information Reconciliation (IR) is a key step in Quantum key distribution (QKD). In recent years, blind reconciliation based on low-density parity-check (LDPC) codes has replaced Cascade as a standardde facto, since it guarantees efficient information reconciliation without a priori quantum bit error rate estimation and with limited interactivity between the parties, which is essential in high key-rate and long distance QKD links. In this paper, a novel blind reconciliation scheme based on rateless protograph LDPC codes is proposed. The rate adaptivity, essential for blind reconciliation, is obtained by progressively splitting LDPC check nodes, which ensures a number of degrees of freedom larger than puncturing in code design. The protograph nature of the LDPC codes allows to use the same designed codes with a large variety of sifted-key lengths, enabling a blocklength flexibility, which is important in largely varying key-rate link conditions. The code design is based on a new protograph Discretized Density Evolution tool.

IEEE Transactions on Quantum Engineering•Jan 1, 2024•13 citations
We study the information reconciliation (IR) scheme for quantum key distribution (QKD) protocols. The IR for the QKD can be seen as the asymmetric Slepian-Wolf problem, which low-density parity-check (LDPC) codes can solve with efficient algorithms, i.e., the belief propagation. However, the LDPC codes are needed to be chosen properly from a collection of codes optimized for multiple key rates, which leads to complex decoder devices and performance degradation for unoptimized key rates. Therefore, it is desired that establish an IR scheme with a single LDPC code which supports multiple rates. To this end, in this paper, we propose an IR scheme with a rate-compatible non-binary LDPC code. Numerical results show the proposed scheme achieves IR efficiency comparable to the best know conventional IR scheme with lower decoding error rates.
Information Reconciliation (IR) is a key step in Quantum key distribution (QKD). In recent years, blind reconciliation based on low-density parity-check (LDPC) codes has replaced Cascade as a standardde facto, since it guarantees efficient information reconciliation without a priori quantum bit error rate estimation and with limited interactivity between the parties, which is essential in high key-rate and long distance QKD links. In this paper, a novel blind reconciliation scheme based on rateless protograph LDPC codes is proposed. The rate adaptivity, essential for blind reconciliation, is obtained by progressively splitting LDPC check nodes, which ensures a number of degrees of freedom larger than puncturing in code design. The protograph nature of the LDPC codes allows to use the same designed codes with a large variety of sifted-key lengths, enabling a blocklength flexibility, which is important in largely varying key-rate link conditions. The code design is based on a new protograph Discretized Density Evolution tool.