Information Reconciliation for High-Dimensional Quantum Key Distribution using Nonbinary LDPC codes

• URL: http://arxiv.org/abs/2305.08631v1
• Date: Mon, 15 May 2023 13:26:08 GMT
• Title: Information Reconciliation for High-Dimensional Quantum Key Distribution using Nonbinary LDPC codes
• Authors: Ronny Mueller, Davide Bacco, Leif Katsou Oxenl{\o}we, S{\o}ren Forchhammer
• Abstract summary: The application of nonbinary LDPC codes in the Information Reconciliation stage of a high-dimensional discrete-variable Quantum Key Distribution setup is proposed. We show that codes constructed using these distributions allow for efficient reconciliation of large-alphabet keys.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Information Reconciliation is an essential part of Quantum Key distribution protocols that closely resembles Slepian-Wolf coding. The application of nonbinary LDPC codes in the Information Reconciliation stage of a high-dimensional discrete-variable Quantum Key Distribution setup is proposed. We model the quantum channel using a $q$-ary symmetric channel over which qudits are sent. Node degree distributions optimized via density evolution for the Quantum Key Distribution setting are presented, and we show that codes constructed using these distributions allow for efficient reconciliation of large-alphabet keys.

Related papers

• Resource Estimation for Delayed Choice Quantum Entanglement Based Sneakernet Networks Using Neutral Atom qLDPC Memories [0.0]
  We design a quantum communication network with a central party connecting the users through delayed-choice quantum entanglement swapping. Our analysis compares this approach with traditional surface codes, demonstrating that qLDPC codes offer superior scaling in terms of resource efficiency and logical qubit count. We show that with near-term attainable patch sizes, one can attain medium-to-high fidelity correlations, paving the way towards large-scale commercial quantum networks.
  arXiv  Detail & Related papers  (2024-10-02T03:39:45Z)
• Twin-field-based multi-party quantum key agreement [0.0]
  We study a method to extend the twin-field key distribution protocol to a scheme for multi-party quantum key agreement. We derive the key rate based on the entanglement-based source-replacement scheme.
  arXiv  Detail & Related papers  (2024-09-06T11:51:10Z)
• 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)
• Distributed Quantum Computing in Silicon [40.16556091789959]
  We present preliminary demonstrations of some key distributed quantum computing protocols on silicon T centres in isotopically-enriched silicon. We demonstrate the distribution of entanglement between modules and consume it to apply a teleported gate sequence.
  arXiv  Detail & Related papers  (2024-06-03T18:02:49Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• 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)
• Quantum Key Distribution Using a Quantum Emitter in Hexagonal Boron Nitride [48.97025221755422]
  We demonstrate a room temperature, discrete-variable quantum key distribution system using a bright single photon source in hexagonal-boron nitride. We have generated keys with one million bits length, and demonstrated a secret key of approximately 70,000 bits, at a quantum bit error rate of 6%. Our work demonstrates the first proof of concept finite-key BB84 QKD system realised with hBN defects.
  arXiv  Detail & Related papers  (2023-02-13T09:38:51Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• 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)
• Blind information reconciliation with polar codes for quantum key distribution [0.0]
  We suggest a new protocol for the information reconciliation stage of quantum key distribution based on polar codes. The suggested approach is based on the blind technique, which is proved to be useful for low-density parity-check (LDPC) codes.
  arXiv  Detail & Related papers  (2020-08-27T09:08:03Z)
• Reconciliation for Practical Quantum Key Distribution with BB84 protocol [0.22099217573031674]
  We describe an explicit reconciliation method based on Turbo codes. We believe that the proposed method can improve the efficiency of quantum key distribution protocols based on discrete quantum states.
  arXiv  Detail & Related papers  (2020-02-16T20:46:18Z)

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.