Sharp finite statistics for minimum data block sizes in quantum key distribution

• URL: http://arxiv.org/abs/2410.04095v1
• Date: Sat, 5 Oct 2024 09:30:55 GMT
• Title: Sharp finite statistics for minimum data block sizes in quantum key distribution
• Authors: Vaisakh Mannalath, Víctor Zapatero, Marcos Curty,
• Abstract summary: We introduce an alternative solution that exploits a link between random sampling with and without replacement. Despite its simplicity, it notably boosts the achievable secret key rate. Bounds of this kind naturally fit in finite-key security proofs of decoy-state QKD schemes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The performance of quantum key distribution (QKD) heavily depends on the finite statistics of its security proof. For multiple protocols and proof techniques, the central statistical task is a random sampling problem, which is customarily addressed by invoking suitable tail bounds on the hypergeometric distribution. In this work, we introduce an alternative solution that exploits a link between random sampling with and without replacement. Despite its simplicity, it notably boosts the achievable secret key rate, particularly in the regime of small data block sizes critical for satellite QKD and other envisioned QKD applications. Moreover, as a by-product of the proposed tool, tight Neyman constructions are derived for the average of independent Bernoulli variables. Bounds of this kind naturally fit in finite-key security proofs of decoy-state QKD schemes, further sharpening the finite statistics compared to previous approaches.

Related papers

• 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)
• 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)
• Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and Applications [38.98556852157875]
  We focus on the practical scenario of CCMCKP, where the probability distributions of random weights are unknown but only sample data is available. To solve CCMCKP, we propose a data-driven adaptive local search (DDALS) algorithm.
  arXiv  Detail & Related papers  (2023-06-26T13:35:05Z)
• Testing randomness of series generated in Bell's experiment [62.997667081978825]
  We use a toy fiber optic based setup to generate binary series, and evaluate their level of randomness according to Ville principle. Series are tested with a battery of standard statistical indicators, Hurst, Kolmogorov complexity, minimum entropy, Takensarity dimension of embedding, and Augmented Dickey Fuller and Kwiatkowski Phillips Schmidt Shin to check station exponent. The level of randomness of series obtained by applying Toeplitz extractor to rejected series is found to be indistinguishable from the level of non-rejected raw ones.
  arXiv  Detail & Related papers  (2022-08-31T17:39:29Z)
• 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)
• KSD Aggregated Goodness-of-fit Test [38.45086141837479]
  We introduce a strategy to construct a test, called KSDAgg, which aggregates multiple tests with different kernels. We provide non-asymptotic guarantees on the power of KSDAgg. We find that KSDAgg outperforms other state-of-the-art adaptive KSD-based goodness-of-fit testing procedures.
  arXiv  Detail & Related papers  (2022-02-02T00:33:09Z)
• Finite-key analysis for quantum key distribution with discrete phase randomization [21.561489948824274]
  We develop a technique based on conjugate measurement and quantum state distinguishment to ana-lyze the security. Our result shows that TF-QKD with reasonable number of discrete random phases, e.g. 8 phases from 0, pi/4, pi/2,..., 7pi/4, can achieve satisfactory performance.
  arXiv  Detail & Related papers  (2022-01-09T15:45:44Z)
• Sampling-Based Robust Control of Autonomous Systems with Non-Gaussian Noise [59.47042225257565]
  We present a novel planning method that does not rely on any explicit representation of the noise distributions. First, we abstract the continuous system into a discrete-state model that captures noise by probabilistic transitions between states. We capture these bounds in the transition probability intervals of a so-called interval Markov decision process (iMDP)
  arXiv  Detail & Related papers  (2021-10-25T06:18:55Z)
• 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)
• Finite-key analysis of loss-tolerant quantum key distribution based on random sampling theory [0.0]
  We propose an alternative security analysis of the LT protocol against general attacks. Our security proof provides considerably higher secret-key rates than the previous finite-key analysis.
  arXiv  Detail & Related papers  (2021-01-29T14:32:09Z)
• 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)

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.