Optimal key rates for quantum key distribution with partial source characterization

• URL: http://arxiv.org/abs/2510.13085v2
• Date: Wed, 29 Oct 2025 00:49:32 GMT
• Title: Optimal key rates for quantum key distribution with partial source characterization
• Authors: Margarida Pereira, Guillermo Currás-Lorenzo, Mateus Araújo,
• Abstract summary: We extend conic-optimization methods to scenarios where only partial information about the emitted states is known.<n>We demonstrate that our method outperforms state-of-the-art analytical and numerical approaches under realistic source imperfections.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Numerical security proofs based on conic optimization are known to deliver optimal secret-key rates, but so far they have mostly assumed that the emitted states are fully characterized. In practice, this assumption is unrealistic, since real devices inevitably suffer from imperfections and side channels that are extremely difficult to model in detail. Here, we extend conic-optimization methods to scenarios where only partial information about the emitted states is known, covering both prepare-and-measure and measurement-device-independent protocols. We demonstrate that our method outperforms state-of-the-art analytical and numerical approaches under realistic source imperfections, especially for protocols that use non-qubit encodings. These results advance numerical-based proofs towards a standard, implementation-ready framework for evaluating quantum key distribution protocols in the presence of source imperfections.

Related papers

• Benchmarking Few-shot Transferability of Pre-trained Models with Improved Evaluation Protocols [123.73663884421272]
  Few-shot transfer has been revolutionized by stronger pre-trained models and improved adaptation algorithms.<n>We establish FEWTRANS, a comprehensive benchmark containing 10 diverse datasets.<n>By releasing FEWTRANS, we aim to provide a rigorous "ruler" to streamline reproducible advances in few-shot transfer learning research.
  arXiv  Detail & Related papers  (2026-02-28T05:41:57Z)
• Long-distance device-independent quantum key distribution with standard optics tools [0.0]
  Device-independent quantum key distribution (DI-QKD) enables information-theoretically secure key exchange between remote parties.<n>We propose two long-distance DI-QKD protocols based on a heralding scheme using single-photon interference.
  arXiv  Detail & Related papers  (2025-08-04T10:10:59Z)
• 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)
• Prototype-based Aleatoric Uncertainty Quantification for Cross-modal Retrieval [139.21955930418815]
  Cross-modal Retrieval methods build similarity relations between vision and language modalities by jointly learning a common representation space. However, the predictions are often unreliable due to the Aleatoric uncertainty, which is induced by low-quality data, e.g., corrupt images, fast-paced videos, and non-detailed texts. We propose a novel Prototype-based Aleatoric Uncertainty Quantification (PAU) framework to provide trustworthy predictions by quantifying the uncertainty arisen from the inherent data ambiguity.
  arXiv  Detail & Related papers  (2023-09-29T09:41:19Z)
• 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)
• Upper bounds on key rates in device-independent quantum key distribution based on convex-combination attacks [1.118478900782898]
  We present the convex-combination attack as an efficient, easy-to-use technique for upper-bounding DIQKD key rates. It allows verifying the accuracy of lower bounds on key rates for state-of-the-art protocols.
  arXiv  Detail & Related papers  (2022-06-13T15:27:48Z)
• 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)
• Loss-tolerant quantum key distribution with a twist [0.0]
  We provide an extension of the loss-tolerant protocol [Phys. Rev. A 90, 052314 (2014)], a leading proof technique for analyzing the security of QKD, to MDI QKD protocols that employ mixed signal states. We find that the mixed states can be interpreted as providing Alice and Bob with a virtual shield system they can employ to reduce Eve's knowledge of the secret key.
  arXiv  Detail & Related papers  (2020-07-16T12:37:43Z)
• Optimizing the Decoy-State BB84 QKD Protocol Parameters [3.6954802719347413]
  The performance of a QKD implementation is determined by the tightness of the underlying security analysis. It is known that optimal protocol parameters, such as the number of decoy states and their intensities, can be found by solving a nonlinear optimization problem. We show an improved performance for the Decoy-State BB84 QKD protocol, demonstrating that the assumptions typically made are too restrictive.
  arXiv  Detail & Related papers  (2020-06-29T12:06:16Z)
• Unlabelled Data Improves Bayesian Uncertainty Calibration under Covariate Shift [100.52588638477862]
  We develop an approximate Bayesian inference scheme based on posterior regularisation. We demonstrate the utility of our method in the context of transferring prognostic models of prostate cancer across globally diverse populations.
  arXiv  Detail & Related papers  (2020-06-26T13:50:19Z)

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.