The University of Southampton
University of Southampton Institutional Repository

The road to near-capacity CV-QKD reconciliation: an FEC-agnostic design

The road to near-capacity CV-QKD reconciliation: an FEC-agnostic design
The road to near-capacity CV-QKD reconciliation: an FEC-agnostic design

New near-capacity continuous-variable quantum key distribution (CV-QKD) reconciliation schemes are proposed, where both the authenticated classical channel (ClC) and the quantum channel (QuC) for QKD are protected by separate forward error correction (FEC) coding schemes. More explicitly, all of the syndrome-based QKD reconciliation schemes found in literature rely on syndrome-based codes, such as low-density parity-check (LDPC) codes. Hence at the current state-of-the-art the channel codes that cannot use syndrome decoding such as the family of convolutional codes (CCs) and polar codes cannot be directly applied. Moreover, the ClC used for syndrome transmission in these schemes is generally assumed to be idealistically error-free, where the realistic additive white Gaussian noise (AWGN) and Rayleigh fading of the ClC have not been taken into account. To circumvent this limitation, a new codeword-based - rather than syndrome-based - QKD reconciliation scheme is proposed, where Alice sends an FECprotected codeword to Bob through a ClC, while Bob sends a separate FEC protected codeword to Alice through a QuC. Upon decoding the codeword received from the other side, the final key is obtained by applying a simple modulo-2 operation to the local codeword and the decoded remote codeword. As a result, first of all, the proposed codeword-based QKD reconciliation system ensures protection of both the QuC and of the ClC. Secondly, the proposed system has a similar complexity at both sides, where both Alice and Bob have an FEC encoder and an FEC decoder. Thirdly, the proposed system makes QKD reconciliation compatible with a wide range of FEC schemes, including polar codes, CCs and irregular convolutional codes (IRCCs), where a near-capacity performance can be achieved for both the QuC and for the ClC. Our simulation results demonstrate that thanks to the proposed regime, the performance improvements of the QuC and of the ClC benefit each other, hence 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.

Continuous variable quantum key distribution (CV-QKD), irregular convolutional codes (IRCC), low-density parity check (LDPC) codes, multidimensional reconciliation, near-capacity codes, secret key rate (SKR)
2644-125X
2089-2112
Liu, Xin
fe780be6-f498-4ee1-9eba-175aa2cb0731
Xu, Chao
5710a067-6320-4f5a-8689-7881f6c46252
Noori, Yasir
704d0b70-1ea6-4e00-92ce-cc2543087a09
Ng, Soon Xin
e19a63b0-0f12-4591-ab5f-554820d5f78c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
et al.
Liu, Xin
fe780be6-f498-4ee1-9eba-175aa2cb0731
Xu, Chao
5710a067-6320-4f5a-8689-7881f6c46252
Noori, Yasir
704d0b70-1ea6-4e00-92ce-cc2543087a09
Ng, Soon Xin
e19a63b0-0f12-4591-ab5f-554820d5f78c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Liu, Xin, Xu, Chao and Noori, Yasir , et al. (2024) The road to near-capacity CV-QKD reconciliation: an FEC-agnostic design. IEEE Open Journal of the Communications Society, 5, 2089-2112. (doi:10.1109/OJCOMS.2024.3382225).

Record type: Article

Abstract

New near-capacity continuous-variable quantum key distribution (CV-QKD) reconciliation schemes are proposed, where both the authenticated classical channel (ClC) and the quantum channel (QuC) for QKD are protected by separate forward error correction (FEC) coding schemes. More explicitly, all of the syndrome-based QKD reconciliation schemes found in literature rely on syndrome-based codes, such as low-density parity-check (LDPC) codes. Hence at the current state-of-the-art the channel codes that cannot use syndrome decoding such as the family of convolutional codes (CCs) and polar codes cannot be directly applied. Moreover, the ClC used for syndrome transmission in these schemes is generally assumed to be idealistically error-free, where the realistic additive white Gaussian noise (AWGN) and Rayleigh fading of the ClC have not been taken into account. To circumvent this limitation, a new codeword-based - rather than syndrome-based - QKD reconciliation scheme is proposed, where Alice sends an FECprotected codeword to Bob through a ClC, while Bob sends a separate FEC protected codeword to Alice through a QuC. Upon decoding the codeword received from the other side, the final key is obtained by applying a simple modulo-2 operation to the local codeword and the decoded remote codeword. As a result, first of all, the proposed codeword-based QKD reconciliation system ensures protection of both the QuC and of the ClC. Secondly, the proposed system has a similar complexity at both sides, where both Alice and Bob have an FEC encoder and an FEC decoder. Thirdly, the proposed system makes QKD reconciliation compatible with a wide range of FEC schemes, including polar codes, CCs and irregular convolutional codes (IRCCs), where a near-capacity performance can be achieved for both the QuC and for the ClC. Our simulation results demonstrate that thanks to the proposed regime, the performance improvements of the QuC and of the ClC benefit each other, hence 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.

Text
The_Road_to_Near-Capacity_CV-QKD_Reconciliation_Xin_OJ-COMMS_final - Accepted Manuscript
Available under License Creative Commons Attribution.
Download (1MB)

More information

Accepted/In Press date: 24 March 2024
e-pub ahead of print date: 27 March 2024
Published date: 27 March 2024
Additional Information: Publisher Copyright: © 2020 IEEE.
Keywords: Continuous variable quantum key distribution (CV-QKD), irregular convolutional codes (IRCC), low-density parity check (LDPC) codes, multidimensional reconciliation, near-capacity codes, secret key rate (SKR)

Identifiers

Local EPrints ID: 488720
URI: http://eprints.soton.ac.uk/id/eprint/488720
ISSN: 2644-125X
PURE UUID: fde3f3e3-6b69-46b2-8675-fb37f6d9fbea
ORCID for Chao Xu: ORCID iD orcid.org/0000-0002-8423-0342
ORCID for Yasir Noori: ORCID iD orcid.org/0000-0001-5285-8779
ORCID for Soon Xin Ng: ORCID iD orcid.org/0000-0002-0930-7194
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 04 Apr 2024 16:56
Last modified: 08 May 2024 01:55

Export record

Altmetrics

Contributors

Author: Xin Liu
Author: Chao Xu ORCID iD
Author: Yasir Noori ORCID iD
Author: Soon Xin Ng ORCID iD
Author: Lajos Hanzo ORCID iD
Corporate Author: et al.

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×