Advantage Distillation for Quantum Key Distribution

• URL: http://arxiv.org/abs/2404.14733v1
• Date: Tue, 23 Apr 2024 04:27:03 GMT
• Title: Advantage Distillation for Quantum Key Distribution
• Authors: Zhenyu Du, Guoding Liu, Xiongfeng Ma,
• Abstract summary: Building on the entanglement distillation protocol, our framework integrates all the existing key distillation methods. Our framework can achieve higher key rates, particularly without one-time pad encryption for postprocessing.
• Score: 0.40964539027092917
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Enhancing the performance of quantum key distribution is crucial, driving the exploration of various key distillation techniques to increase the key rate and tolerable error rate. It is imperative to develop a comprehensive framework to encapsulate and enhance the existing methods. In this work, we propose an advantage distillation framework for quantum key distribution. Building on the entanglement distillation protocol, our framework integrates all the existing key distillation methods and offers better generalization and performance. Using classical linear codes, our framework can achieve higher key rates, particularly without one-time pad encryption for postprocessing. Our approach provides insights into existing protocols and offers a systematic way for future enhancements of quantum key distribution protocols.

Related papers

• Enhancing Quantum Key Distribution with Entanglement Distillation and Classical Advantage Distillation [0.0]
  We present a two-stage distillation scheme concatenating entanglement distillation and classical advantage distillation. We show that our scheme achieves finite key rates even in the high-noise regime. The proposed scheme is well-suited for near-term quantum key distribution tasks.
  arXiv  Detail & Related papers  (2024-10-25T06:40:09Z)
• Beating the Optimal Verification of Entangled States via Collective Strategies [0.0]
  In quantum information processing, the efficient characterization of entangled states poses an overwhelming challenge. We propose a new verification scheme using collective strategies, showcasing arbitrarily high efficiency that beats the optimal verification with global measurements. The approach consumes only a few copies of the entangled states, while ensuring the preservation of unmeasured ones, and even boosting their fidelity for any subsequent tasks.
  arXiv  Detail & Related papers  (2024-10-01T10:01:25Z)
• Neural auto-designer for enhanced quantum kernels [59.616404192966016]
  We present a data-driven approach that automates the design of problem-specific quantum feature maps. Our work highlights the substantial role of deep learning in advancing quantum machine learning.
  arXiv  Detail & Related papers  (2024-01-20T03:11:59Z)
• FRAPPE: A Group Fairness Framework for Post-Processing Everything [48.57876348370417]
  We propose a framework that turns any regularized in-processing method into a post-processing approach. We show theoretically and through experiments that our framework preserves the good fairness-error trade-offs achieved with in-processing.
  arXiv  Detail & Related papers  (2023-12-05T09:09:21Z)
• Boosting quantum key distribution via the end-to-end loss control [0.0]
  We show a remarkable improvement in the quantum key distribution (QKD) performance using end-to-end line tomography. Our approach is based on the real-time detection of interventions in the transmission channel. Our findings provide everlastingly secure efficient quantum cryptography deployment.
  arXiv  Detail & Related papers  (2023-08-07T17:32:14Z)
• 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)
• 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)
• Sequential Information Design: Markov Persuasion Process and Its Efficient Reinforcement Learning [156.5667417159582]
  This paper proposes a novel model of sequential information design, namely the Markov persuasion processes (MPPs) Planning in MPPs faces the unique challenge in finding a signaling policy that is simultaneously persuasive to the myopic receivers and inducing the optimal long-term cumulative utilities of the sender. We design a provably efficient no-regret learning algorithm, the Optimism-Pessimism Principle for Persuasion Process (OP4), which features a novel combination of both optimism and pessimism principles.
  arXiv  Detail & Related papers  (2022-02-22T05:41:43Z)
• 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)

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.