Reconciliation for Practical Quantum Key Distribution with BB84 protocol

• URL: http://arxiv.org/abs/2002.07778v1
• Date: Sun, 16 Feb 2020 20:46:18 GMT
• Title: Reconciliation for Practical Quantum Key Distribution with BB84 protocol
• Authors: Nedra Benletaief and Houria Rezig and Ammar Bouallegue
• Abstract summary: 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.
• Score: 0.22099217573031674
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper investigates a new information reconciliation method for quantum key distribution in the case where two parties exchange key in the presence of a malevolent eavesdropper. We have observed that reconciliation is a special case of channel coding and for that existing techniques can be adapted for reconciliation. 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.

Related papers

• 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)
• 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)
• Information Reconciliation for High-Dimensional Quantum Key Distribution using Nonbinary LDPC codes [0.0]
  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.
  arXiv  Detail & Related papers  (2023-05-15T13:26:08Z)
• SarDub19: An Error Estimation and Reconciliation Protocol [1.4890829254686686]
  We present SarDub19 error key estimation and reconciliation protocol. It is realized through public channel and it dominates the communication of the quantum key distribution process.
  arXiv  Detail & Related papers  (2022-12-24T21:16:21Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• 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)
• Representation matching for delegated quantum computing [64.67104066707309]
  representation matching is a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks.
  arXiv  Detail & Related papers  (2020-09-14T18:07:43Z)
• 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)
• A classical attack on the coherent one way protocol for quantum key distribution [0.0]
  We propose a way to retrieve the secure key generated by the coherent one way protocol without reading the information transmitted on the quantum channel. In particular, we propose a way to retrieve the secure key generated by the coherent one way protocol without reading the information transmitted on the quantum channel.
  arXiv  Detail & Related papers  (2020-03-12T09:22:49Z)

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.