Neural network for excess noise estimation in continuous-variable quantum key distribution under composable finite-size security

• URL: http://arxiv.org/abs/2507.23117v1
• Date: Wed, 30 Jul 2025 21:44:42 GMT
• Title: Neural network for excess noise estimation in continuous-variable quantum key distribution under composable finite-size security
• Authors: Lucas Q. Galvão, Davi Juvêncio G. de Sousa, Micael Andrade Dias, Nelson Alves Ferreira Neto,
• Abstract summary: We show that neural networks can be reliably employed for parameter estimation in continuous quantum key distribution (CV-QKD)<n>Using a protocol that is operationally equivalent to standard approaches, our method produces significantly tighter confidence intervals.<n>These results open up new perspectives for integrating modern machine learning techniques into quantum cryptographic protocols.
• Score: 0.3374875022248866
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Parameter estimation is a critical step in continuous-variable quantum key distribution (CV-QKD), especially in the finite-size regime where worst-case confidence intervals can significantly reduce the achievable secret-key rate. We provide a finite-size security analysis demonstrating that neural networks can be reliably employed for parameter estimation in CV-QKD with quantifiable failure probabilities $\epsilon_{PE}$, endowed with an operational interpretation and composable security guarantees. Using a protocol that is operationally equivalent to standard approaches, our method produces significantly tighter confidence intervals, unlocking higher key rates even under collective Gaussian attacks. The proposed approach yields tighter confidence intervals, leading to a quantifiable increase in the secret-key rate under collective Gaussian attacks. These results open up new perspectives for integrating modern machine learning techniques into quantum cryptographic protocols, particularly in practical resource-constrained scenarios.

Related papers

• Asymptotically tight security analysis of quantum key distribution based on universal source compression [0.5242869847419834]
  Quantum key distribution (QKD) protocols require a finite-size security proof.<n>PEC approach is one of the general strategies for security analyses.<n>New PEC-type strategy can provably achieve theally optimal key rate.
  arXiv  Detail & Related papers  (2025-04-10T00:52:13Z)
• The probabilistic combinatorial attacks on atmospheric continuous-variable quantum secret sharing [0.9742230414221046]
  We study the practical security of free-space quantum secret sharing channels.<n>We propose an attack strategy that combines two-point distribution attack and uniform distribution attack.<n>Results show that the combination attacks reduce the real key rate of CV-QSS under moderate intensity turbulence, but still enable secure QSS at a distance of 8 km on a scale of hundreds.
  arXiv  Detail & Related papers  (2025-03-17T01:43:13Z)
• Numerical security analysis for quantum key distribution with partial state characterization [0.34952465649465553]
  We introduce a novel security proof technique that can evaluate the secret-key rate for both prepare-and-measure and measurement-device-independent QKD protocols.<n>We demonstrate that our method can outperform current analytical approaches addressing partial state characterization in terms of achievable secret-key rates.
  arXiv  Detail & Related papers  (2025-03-10T12:08:25Z)
• Practical hybrid PQC-QKD protocols with enhanced security and performance [44.8840598334124]
  We develop hybrid protocols by which QKD and PQC inter-operate within a joint quantum-classical network. In particular, we consider different hybrid designs that may offer enhanced speed and/or security over the individual performance of either approach.
  arXiv  Detail & Related papers  (2024-11-02T00:02:01Z)
• Finite-Key Analysis for Coherent One-Way Quantum Key Distribution [18.15943439545963]
  Coherent-one-way (COW) quantum key distribution (QKD) is a significant communication protocol that has been implemented experimentally and deployed in practical products. Existing security analyses of COW-QKD either provide a short transmission distance or lack immunity against coherent attacks in the finite-key regime. We present a tight finite-key framework for a variant of COW-QKD, which has been proven to extend the secure transmission distance in the case.
  arXiv  Detail & Related papers  (2023-09-28T03:32:06Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Robust Control for Dynamical Systems With Non-Gaussian Noise via Formal Abstractions [59.605246463200736]
  We present a novel controller synthesis method that does not rely on any explicit representation of the noise distributions. First, we abstract the continuous control system into a finite-state model that captures noise by probabilistic transitions between discrete states. We use state-of-the-art verification techniques to provide guarantees on the interval Markov decision process and compute a controller for which these guarantees carry over to the original control system.
  arXiv  Detail & Related papers  (2023-01-04T10:40:30Z)
• Quantization enabled Privacy Protection in Decentralized Stochastic Optimization [34.24521534464185]
  Decentralized optimization can be used in areas as diverse as machine learning, control, and sensor networks. Privacy protection has emerged as a crucial need in the implementation of decentralized optimization. We propose an algorithm that is able to guarantee provable convergence accuracy even in the presence of aggressive quantization errors.
  arXiv  Detail & Related papers  (2022-08-07T15:17:23Z)
• 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)
• 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)
• Improved DIQKD protocols with finite-size analysis [2.940150296806761]
  We show that positive randomness is achievable up to depolarizing noise values of $9.33%$, exceeding all previously known noise thresholds. We also develop a modification to random-key-measurement protocols, using a pre-shared seed followed by a "seed recovery" step.
  arXiv  Detail & Related papers  (2020-12-16T03:04:19Z)
• Learning, compression, and leakage: Minimising classification error via meta-universal compression principles [87.054014983402]
  A promising group of compression techniques for learning scenarios is normalised maximum likelihood (NML) coding. Here we consider a NML-based decision strategy for supervised classification problems, and show that it attains PAC learning when applied to a wide variety of models. We show that the misclassification rate of our method is upper bounded by the maximal leakage, a recently proposed metric to quantify the potential of data leakage in privacy-sensitive scenarios.
  arXiv  Detail & Related papers  (2020-10-14T20:03:58Z)

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.