Neural network-based prediction of the secret-key rate of quantum key distribution

• URL: http://arxiv.org/abs/2108.02578v3
• Date: Mon, 30 May 2022 01:50:13 GMT
• Title: Neural network-based prediction of the secret-key rate of quantum key distribution
• Authors: Min-Gang Zhou, Zhi-Ping Liu, Wen-Bo Liu, Chen-Long Li, Jun-Lin Bai, Yi-Ran Xue, Yao Fu, Hua-Lei Yin, Zeng-Bing Chen
• Abstract summary: We construct a neural network that can quickly predict the secure key rate based on the experimental parameters and experimental results. This allows the secure key rate of discrete-modulated CV-QKD to be extracted in real time on a low-power platform.
• Score: 6.040436695129137
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Numerical methods are widely used to calculate the secure key rate of many quantum key distribution protocols in practice, but they consume many computing resources and are too time-consuming. In this work, we take the homodyne detection discrete-modulated continuous-variable quantum key distribution (CV-QKD) as an example, and construct a neural network that can quickly predict the secure key rate based on the experimental parameters and experimental results. Compared to traditional numerical methods, the speed of the neural network is improved by several orders of magnitude. Importantly, the predicted key rates are not only highly accurate but also highly likely to be secure. This allows the secure key rate of discrete-modulated CV-QKD to be extracted in real time on a low-power platform. Furthermore, our method is versatile and can be extended to quickly calculate the complex secure key rates of various other unstructured quantum key distribution protocols.

Related papers

• 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)
• Towards efficient and secure quantum-classical communication networks [47.27205216718476]
  There are two primary approaches to achieving quantum-resistant security: quantum key distribution (QKD) and post-quantum cryptography (PQC) We introduce the pros and cons of these protocols and explore how they can be combined to achieve a higher level of security and/or improved performance in key distribution. We hope our discussion inspires further research into the design of hybrid cryptographic protocols for quantum-classical communication networks.
  arXiv  Detail & Related papers  (2024-11-01T23:36:19Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• How to harness high-dimensional temporal entanglement, using limited interferometry setups [62.997667081978825]
  We develop the first complete analysis of high-dimensional entanglement in the polarization-time-domain. We show how to efficiently certify relevant density matrix elements and security parameters for Quantum Key Distribution. We propose a novel setup that can further enhance the noise resistance of free-space quantum communication.
  arXiv  Detail & Related papers  (2023-08-08T17:44:43Z)
• High-rate discretely-modulated continuous-variable quantum key distribution using quantum machine learning [4.236937886028215]
  We propose a high-rate scheme for discretely-modulated continuous-variable quantum key distribution (DM CVQKD) using quantum machine learning technologies. A low-complexity quantum k-nearest neighbor (QkNN) is designed for predicting the lossy discretely-modulated coherent states (DMCSs) at Bob's side. Numerical simulation shows that the secret key rate of our proposed scheme is explicitly superior to the existing DM CVQKD protocols.
  arXiv  Detail & Related papers  (2023-08-07T04:00:13Z)
• Practical quantum secure direct communication with squeezed states [55.41644538483948]
  We report the first table-top experimental demonstration of a CV-QSDC system and assess its security. This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
  arXiv  Detail & Related papers  (2023-06-25T19:23:42Z)
• Quantum key distribution rates from semidefinite programming [0.0]
  We introduce an efficient algorithm for computing the key rate in quantum key distribution protocols. The resulting algorithm is easy to implement and easy to use. We use it to reanalyse experimental data to demonstrate how higher key rates can be achieved.
  arXiv  Detail & Related papers  (2022-11-10T17:47:37Z)
• Automated machine learning for secure key rate in discrete-modulated continuous-variable quantum key distribution [1.805579209946251]
  Continuous-variable quantum key distribution (CV QKD) with discrete modulation has attracted increasing attention due to its experimental simplicity. numerical methods have been proposed to analyze the security of these protocols against collective attacks. To improve this issue, a neural network model predicting key rates in nearly real time has been proposed previously.
  arXiv  Detail & Related papers  (2022-01-24T02:21:28Z)
• 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)
• Dimension Reduction in Quantum Key Distribution for Continuous- and Discrete-Variable Protocols [3.749120127914018]
  We develop a method to connect the infinite-dimensional description of optical continuous-variable key distribution protocols to a finite-dimensional formulation. The secure key rates of quantum optical QKD protocols can then be evaluated using recently-developed reliable numerical methods for key rate calculations.
  arXiv  Detail & Related papers  (2021-01-14T18:59:19Z)
• Tight security bounds for decoy-state quantum key distribution [1.1563829079760959]
  The BB84 quantum key distribution (QKD) combined with decoy-state method is currently the most practical protocol. Here, we provide the rigorous and optimal analytic formula to solve the above tasks. Our results can be widely applied to deal with statistical fluctuation in quantum cryptography protocols.
  arXiv  Detail & Related papers  (2020-02-16T07:48:25Z)

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.