The Road to Near-Capacity CV-QKD Reconciliation: An FEC-Agnostic Design

• URL: http://arxiv.org/abs/2403.16180v1
• Date: Sun, 24 Mar 2024 14:47:08 GMT
• Title: The Road to Near-Capacity CV-QKD Reconciliation: An FEC-Agnostic Design
• Authors: Xin Liu, Chao Xu, Yasir Noori, Soon Xin Ng, Lajos Hanzo,
• Abstract summary: A new codeword-based QKD reconciliation scheme is proposed. Both the authenticated classical channel (ClC) and the quantum channel (QuC) are protected by separate forward error correction (FEC) coding schemes. The proposed system makes QKD reconciliation compatible with a wide range of FEC schemes.
• Score: 53.67135680812675
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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, a new codeword-based - rather than syndrome-based - QKD reconciliation scheme is proposed, where Alice sends an FEC-protected 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 achieveable rate bound.

Related papers

• Performance of Cascade and LDPC-codes for Information Reconciliation on Industrial Quantum Key Distribution Systems [69.47813697920358]
  We analyze, simulate, optimize, and compare the performance of two prevalent algorithms used for Information Reconciliation. We focus on their applicability in practical and industrial settings, operating in realistic and application-close conditions.
  arXiv  Detail & Related papers  (2024-08-28T12:51:03Z)
• Bit-flipping Decoder Failure Rate Estimation for (v,w)-regular Codes [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder. We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40:24Z)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• Dimensional advantage in secure information trading via the noisy dense coding protocol [0.0]
  We present the DC-based QKD protocol for higher dimensional systems. We report the lower bounds on secret key rate, when the shared state is a two-qudit maximally entangled state. We prove that the set of useless states in the DC-based QKD protocol is convex and compact.
  arXiv  Detail & Related papers  (2023-10-31T17:50:48Z)
• Efficient Information Reconciliation for High-Dimensional Quantum Key Distribution [2.4277680835263005]
  We introduce two novel methods for reconciliation in high-dimensional QKD systems. The methods are based on nonbinary LDPC codes and the Cascade algorithm, and achieve efficiencies close the the Slepian-Wolf bound on q-ary symmetric channels.
  arXiv  Detail & Related papers  (2023-07-05T12:06:27Z)
• Practical quantum secure direct communication with squeezed states [55.41644538483948]
  We report the first table-top experimental demonstration of a CV-QSDC system and assess its security. This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
  arXiv  Detail & Related papers  (2023-06-25T19:23:42Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• Quantum Error Correction via Noise Guessing Decoding [0.0]
  Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation. This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime.
  arXiv  Detail & Related papers  (2022-08-04T16:18:20Z)
• High-dimensional coherent one-way quantum key distribution [0.0]
  High-dimensional quantum key distribution (QKD) offers secure communication, with secure key rates that surpass those achievable by QKD protocols. Existing high-dimensional QKD protocols require additional experimental resources, such as multiport interferometers and multiple detectors. We present and analyze a novel protocol for arbitrary-dimensional QKD, that requires only the hardware of a standard two-dimensional system.
  arXiv  Detail & Related papers  (2021-05-11T01:06:36Z)
• Twin-field quantum key distribution with passive-decoy state [22.26373392802507]
  We propose passive-decoy based TF-QKD, in which we combine TF-QKD with the passive-decoy method. We present a simulation comparing the key generation rate with that in active-decoy, the result shows our scheme performs as good as active decoy TF-QKD.
  arXiv  Detail & Related papers  (2020-11-15T04:02:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.