Arithmetic Reconciliation for CVQKD: Challenges and Feasibility

• URL: http://arxiv.org/abs/2602.05526v1
• Date: Thu, 05 Feb 2026 10:37:24 GMT
• Title: Arithmetic Reconciliation for CVQKD: Challenges and Feasibility
• Authors: Rávilla R. S. Leite, Juliana M. de Assis, Micael A. Dias, Francisco M. de Assis,
• Abstract summary: A reconciliation protocol, Arithmetic Reconciliation, presents low complexity and has increasing reconciliation efficiency with lower SNRs.<n>Results show that this technique is feasible and promising to continuous variable quantum key distribution applications.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Continuous variable quantum key distribution allows two legitimate parties to share a common secret key and encompasses reconciliation protocols. A relatively new reconciliation protocol, Arithmetic Reconciliation, presents low complexity and has increasing reconciliation efficiency with lower SNRs. In this paper, we obtain reconciliation efficiencies for this protocol in realistic scenarios, by means of estimation of mutual information, and we also present rates for sequence match of secret keys by Alice and Bob. Results show that this technique is feasible and promising to continuous variable quantum key distribution applications.

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)
• Information reconciliation for discretely-modulated continuous-variable quantum key distribution [2.9914612342004503]
  We explain the reconciliation problem for continuous-variable quantum key distribution protocols with a discrete modulation. We argue that this problem is nontrivial and deserves further attention.
  arXiv  Detail & Related papers  (2023-10-26T16:44:06Z)
• Boosted quantum and semi-quantum communication protocols [0.0]
  We show that it is possible to reduce the number of such runs by a suitable design of the key generation rule. We illustrate this advantage by proposing quantum and semi-quantum key distribution protocols.
  arXiv  Detail & Related papers  (2023-03-24T12:33:22Z)
• 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)
• 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)
• Round-robin differential phase-time-shifting protocol for quantum key distribution: theory and experiment [58.03659958248968]
  Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties. Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments. We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario. Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
  arXiv  Detail & Related papers  (2021-03-15T15:20:09Z)
• 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)
• Experimental study and pratical realization of a reconciliation method for quantum key distribution system [0.22099217573031674]
  This paper investigates a reconciliation method in order to establish an errorless secret key in a QKD protocol. The proposed method accomplishes reconciliation by using QTC in the special problem of sideinformation source coding.
  arXiv  Detail & Related papers  (2020-02-16T21:40:36Z)
• 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)
• Multi-matrix rate-compatible reconciliation for quantum key distribution [4.112451875105169]
  Reconciliation efficiency is the most important figure for judging the quality of a reconciliation scheme. To improve reconciliation efficiency, rate-compatible technologies was proposed for key reconciliation. In this paper, a recently suggested technique called multi-matrix reconciliation is introduced into SRCR. We show that MRCR we proposed outperforms SRCR in reconciliation efficiency and throughput.
  arXiv  Detail & Related papers  (2020-01-04T13:03:04Z)

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.