Proceedings Article10.1109/CCISP51026.2020.9273490
High Efficiency Continuous-Variable Quantum Key Distribution Based on Quasi-Cyclic LDPC Codes
Kun Zhang,Xue-Qin Jiang,Yan Feng,Runhe Qiu,Enjian Bai +4 more
- 01 Nov 2020
4
TL;DR: This work construct Quasi-Cyclic low-density paritycheck codes based on LDPC codes in the digital video broadcasting second generation terrestrial (DVB-T2) standard, and then combine these codes with information reconciliation in the CVQKD system, which can extremely ameliorate the performance of secret key rate and maximum transmission distance.
read more
Abstract: Information reconciliation in the continuousvariable quantum key distribution (CVQKD) plays a vital role on affecting secret key rate as well as maximum transmission distance. It is necessary to search good error-correcting codes in order to improve the performance of reconciliation efficiency. In this work, we construct Quasi-Cyclic (QC) low-density paritycheck (LDPC) codes based on LDPC codes in the digital video broadcasting second generation terrestrial (DVB-T2) standard, and then combine these codes with information reconciliation in the CVQKD system, which can extremely ameliorate the performance of secret key rate and maximum transmission distance. The simulation results show that our proposed QC-LDPC codes can achieve higher reconciliation efficiency of 93.05% compare to DVB-T2 LDPC codes, which means our proposed QC-LDPC codes can obtain better performance of secret key rate and longer maximum transmission distance.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Low-Density Parity-Check Codes: Research Status and Development Direction
Jie Xu,Zhiyong Zheng,Kun Tian +2 more
TL;DR: In this paper , the authors conclude that the construction of low-density parity-check matrix tends to be more flexible and the parameter variability is enhanced, and they propose that the current development cost should be lower with the progress of electronic technology and they need research on more practical Low-Density Parity-Check Codes (LDPC).
2
Evaluation of Adaptive Reconciliation Protocols for CV-QKD using Systematic Polar Codes
Meixiang Zhang,Qiang Wang,Thara Son,Sooyoung Kim +3 more
- 09 Aug 2023
TL;DR: Evaluation of adaptive reconciliation protocols for CV-QKD using systematic polar codes TLDR: The paper evaluates and proposes new adaptive reconciliation protocols for CV-QKD using systematic polar codes, increasing efficiency and reducing complexity.
1
The Road to Near-Capacity CV-QKD Reconciliation: An FEC-Agnostic Design
Xin Liu,Chao-Nong Xu,Yasir Noori,Soon Xin Ng,Lajos Hanzo +4 more
TL;DR: Simulation results demonstrate that thanks to the proposed regime, the performance improvements of the QuC and of the ClC benefit each other, leading to an improved secret key rate (SKR) that inches closer to both the Pirandola-Laurenza-Ottaviani-Banchi (PLOB) bound and to the maximum achievable rate bound.
Evaluation of adaptive reconciliation protocols for CV-QKD using systematic polar codes
Meixiang Zhang,Qiang Wang,Thara Son,Sooyoung Kim +3 more
Abstract: Quantum key distribution is a secure cryptographic technology that enables two authenticated parties to share secret keys. Information reconciliation is an essential step in continuous-variable quantum key distribution protocols, which affects both the complexity and performance of the system. This paper reviews adaptive reconciliation protocols and also proposes a new efficient scheme using systematic polar codes. The proposed scheme utilizes adaptive polar codes, where the code rates are determined by the channel condition. Additionally, a compact function is presented to set the optimum code rate for a given channel condition. Simulation results show that the proposed scheme can significantly increase reconciliation efficiency and reduce the overall computational complexity by reducing the average number of retransmissions, without significant reduction in effective secret key length.
References
Quantum Cryptography
TL;DR: The author revealed that quantum teleportation as “Quantum one-time-pad” had changed from a “classical teleportation” to an “optical amplification, privacy amplification and quantum secret growing” situation.
Quantum cryptography
TL;DR: A protocol for coin-tossing by exchange of quantum messages is presented, which is secure against traditional kinds of cheating, even by an opponent with unlimited computing power, but ironically can be subverted by use of a still subtler quantum phenomenon, the Einstein-Podolsky-Rosen paradox.
6.2K
Gaussian quantum information
Christian Weedbrook,Stefano Pirandola,Raúl García-Patrón,Nicolas J. Cerf,Timothy C. Ralph,Jeffrey H. Shapiro,Seth Lloyd +6 more
TL;DR: This review focuses on continuous-variable quantum information processes that rely on any combination of Gaussian states, Gaussian operations, and Gaussian measurements, including quantum communication, quantum cryptography, quantum computation, quantum teleportation, and quantum state and channel discrimination.
The security of practical quantum key distribution
Valerio Scarani,Helle Bechmann-Pasquinucci,Nicolas J. Cerf,Miloslav Dušek,Norbert Lütkenhaus,Momtchil Peev +5 more
TL;DR: Essential theoretical tools that have been developed to assess the security of the main experimental platforms are presented (discrete- variable, continuous-variable, and distributed-phase-reference protocols).