.png){kind=icon}
.png){kind=icon}
Return
Low-complexity adaptive reconciliation protocol for continuous-variable quantum key distribution
.png){kind=icon}
PRE
AI
S
J
黄
G
DOI：10.1088/2058-9565/ad1f3c.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In continuous-variable quantum key distribution systems, reconciliation is a crucial step that significantly affects the secret key rate (SKR). The rateless protocol based on Raptor codes can achieve high reconciliation efficiency at low signal-to-noise ratios (SNRs). However, the high complexity of low-density parity-check (LDPC) codes used for the precoding in Raptor codes limits the speed of reconciliation. In this paper, we propose an adaptive reconciliation protocol by modifying Raptor codes. The length of random binary sequences is increased because we remove the LDPC precoding that adds redundancy. The modified Raptor codes reduce the complexity of encoding with better performance. The proposed protocol gives a reconciliation efficiency higher than 98.1% in the SNR below -20 dB and maintains a certain SKR in long-distance transmission.
Keywords:
information reconciliation
continuous-variable quantum key distribution
post-processing
Journal
IF:
5
Papers:
1.4K
Citations:
5.1K
Organization
Cited Papers