Finite-size analysis of prepare-and-measure and decoy-state QKD via entropy accumulation

• URL: http://arxiv.org/abs/2406.10198v2
• Date: Wed, 14 Aug 2024 18:58:05 GMT
• Title: Finite-size analysis of prepare-and-measure and decoy-state QKD via entropy accumulation
• Authors: Lars Kamin, Amir Arqand, Ian George, Norbert Lütkenhaus, Ernest Y. -Z. Tan,
• Abstract summary: We present techniques for applying the generalized entropy accumulation theorem (GEAT) in finite-size analysis of generic prepare-and-measure protocols. We develop methods to incorporate some improvements to the finite-size terms in the proofs GEAT, and implement techniques to automatically optimize the min-tradeoff function.
• Score: 0.8246494848934447
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: An important goal in quantum key distribution (QKD) is the task of providing a finite-size security proof without the assumption of collective attacks. For prepare-and-measure QKD, one approach for obtaining such proofs is the generalized entropy accumulation theorem (GEAT), but thus far it has only been applied to study a small selection of protocols. In this work, we present techniques for applying the GEAT in finite-size analysis of generic prepare-and-measure protocols, with a focus on decoy-state protocols. In particular, we present an improved approach for computing entropy bounds for decoy-state protocols, which has the dual benefits of providing tighter bounds than previous approaches (even asymptotically) and being compatible with methods for computing min-tradeoff functions in the GEAT. Furthermore, we develop methods to incorporate some improvements to the finite-size terms in the GEAT, and implement techniques to automatically optimize the min-tradeoff function. Our approach also addresses some numerical stability challenges specific to prepare-and-measure protocols, which were not addressed in previous works.

Related papers

• Discrete-modulated continuous-variable quantum key distribution secure against general attacks [0.0]
  This work presents a security analysis of DM-CV-QKD against general sequential attacks, including finite-size effects. Remarkably, our proof considers attacks that are neither independent nor identical, and makes no assumptions about the Hilbert space dimension of the receiver.
  arXiv  Detail & Related papers  (2024-09-04T11:50:18Z)
• Last-Iterate Global Convergence of Policy Gradients for Constrained Reinforcement Learning [62.81324245896717]
  We introduce an exploration-agnostic algorithm, called C-PG, which exhibits global last-ite convergence guarantees under (weak) gradient domination assumptions. We numerically validate our algorithms on constrained control problems, and compare them with state-of-the-art baselines.
  arXiv  Detail & Related papers  (2024-07-15T14:54:57Z)
• Provably Efficient UCB-type Algorithms For Learning Predictive State Representations [55.00359893021461]
  The sequential decision-making problem is statistically learnable if it admits a low-rank structure modeled by predictive state representations (PSRs) This paper proposes the first known UCB-type approach for PSRs, featuring a novel bonus term that upper bounds the total variation distance between the estimated and true models. In contrast to existing approaches for PSRs, our UCB-type algorithms enjoy computational tractability, last-iterate guaranteed near-optimal policy, and guaranteed model accuracy.
  arXiv  Detail & Related papers  (2023-07-01T18:35:21Z)
• Conformal Prediction for Federated Uncertainty Quantification Under Label Shift [57.54977668978613]
  Federated Learning (FL) is a machine learning framework where many clients collaboratively train models. We develop a new conformal prediction method based on quantile regression and take into account privacy constraints.
  arXiv  Detail & Related papers  (2023-06-08T11:54:58Z)
• 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)
• Finite-Size Security for Discrete-Modulated Continuous-Variable Quantum Key Distribution Protocols [4.58733012283457]
  We present a composable finite-size security proof against independently and identically distributed collective attacks for a general DM CV-QKD protocol. We extend and apply a numerical security proof technique to calculate tight lower bounds on the secure key rate. Results show that our security proof method yields secure finitesize key rates under experimentally viable conditions up to at least 72km transmission distance.
  arXiv  Detail & Related papers  (2023-01-20T17:16:21Z)
• 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)
• Device-independent lower bounds on the conditional von Neumann entropy [10.2138250640885]
  We introduce a numerical method to compute lower bounds on rates of quantum protocols. We find substantial improvements over all previous numerical techniques. Our method is compatible with the entropy accumulation theorem.
  arXiv  Detail & Related papers  (2021-06-25T15:24:12Z)
• 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)
• Logistic Q-Learning [87.00813469969167]
  We propose a new reinforcement learning algorithm derived from a regularized linear-programming formulation of optimal control in MDPs. The main feature of our algorithm is a convex loss function for policy evaluation that serves as a theoretically sound alternative to the widely used squared Bellman error.
  arXiv  Detail & Related papers  (2020-10-21T17:14:31Z)
• Numerical Calculations of Finite Key Rate for General Quantum Key Distribution Protocols [3.749120127914018]
  We extend our pre-existing reliable, efficient, tight, and generic numerical method for calculating the key rate of device-dependent QKD protocols. We explain how this extension preserves the reliability, efficiency, and tightness of the Hilbert method.
  arXiv  Detail & Related papers  (2020-04-24T17:15:53Z)

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.