Polar Codes-based Information Reconciliation Scheme with Frozen Bits Erasure Strategy for Quantum Key Distribution

• URL: http://arxiv.org/abs/2203.02074v1
• Date: Fri, 4 Mar 2022 00:38:46 GMT
• Title: Polar Codes-based Information Reconciliation Scheme with Frozen Bits Erasure Strategy for Quantum Key Distribution
• Authors: Bang-Ying Tang, Chun-Qing Wu, Wei Peng, Bo Liu, Wan-Rong Yu
• Abstract summary: Information reconciliation (IR) ensures the correctness of quantum key distribution systems. We propose a polar codes-based IR scheme with the frozen bits erasure strategy.
• Score: 5.5233040643473315
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Information reconciliation (IR) ensures the correctness of quantum key distribution systems, by correcting the error bits existed in the sifted keys. In this article, we propose a polar codes-based IR scheme with the frozen bits erasure strategy, where an equivalent transmission of sifted keys is conducted, so that the frozen bits in the decoding procedure is erased to 0. Thus, our IR scheme can be implemented efficiently without the assumption of true random numbers. Furthermore, we implement the proposed IR scheme with the fast simplified successive cancellation list decoder and its throughput reaches to 0.88Mbps with the yield of 0.8333, where the decoder list size is 16, the block size is 1Mb and the quantum bit error rate is 0.02.

Related papers

• 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)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Sparse Blossom: correcting a million errors per core second with minimum-weight matching [0.0]
  We introduce a fast implementation of the minimum-weight perfect matching (MWPM) decoder. Our algorithm, which we call sparse blossom, is a variant of the blossom algorithm which directly solves the decoding problem relevant to quantum error correction.
  arXiv  Detail & Related papers  (2023-03-28T12:42:54Z)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• High-throughput decoder of quasi-cyclic LDPC codes with limited precision for continuous-variable quantum key distribution systems [21.494317261979102]
  High-speed decoding for CV-QKD systems with typical code rates 0.2 and 0.1 is implemented on a commercial FPGA. Two throughputs of 360.92Mbps and 194.65Mbps are achieved, respectively, which can support 17.97 Mbps and 2.48 Mbps real-time generation of secret key rates.
  arXiv  Detail & Related papers  (2022-07-05T07:52:54Z)
• Appending Information Reconciliation for Quantum Key Distribution [5.975135520990673]
  Information reconciliation (IR) corrects the errors in the sifted keys, which determines the secure key rate and the link distance of quantum key distribution (QKD) systems. We propose an appending information reconciliation scheme based on polar codes, which achieves high efficiency and ultra-low failure probability simultaneously.
  arXiv  Detail & Related papers  (2022-04-14T13:53:45Z)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Rotation Based Slice Error Correction Protocol for Continuous-variable Quantum Key Distribution and its Implementation with Polar Codes [3.2505671255960324]
  Reconciliation is an essential procedure for continuous-variable quantum key distribution (CV-QKD) In this paper, an improved SEC protocol, named Rotation-based SEC (RSEC), is proposed through performing a random rotation on the raw data before quantization. In terms of finite-size effects, we achieve a secret key rate of $7.83times10-3$ bits/pulse at a distance of 33.93 km.
  arXiv  Detail & Related papers  (2021-06-11T07:25:52Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Shannon-Limit Approached Information Reconciliation for Quantum Key Distribution [3.862523920633411]
  Information reconciliation (IR) corrects the errors in sifted keys and ensures the correctness of quantum key distribution (QKD) systems. Polar codes-based IR schemes can achieve high reconciliation efficiency, however, the incidental high frame error rate decreases the secure key rate of QKD systems. We propose a Shannon-limit approached (SLA) IR scheme, which mainly contains two phases: the forward reconciliation phase and the acknowledgment reconciliation phase.
  arXiv  Detail & Related papers  (2020-03-08T03:59:56Z)

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.