New Key Rate Bound for High-Dimensional BB84 with Multiple Basis Measurements

• URL: http://arxiv.org/abs/2504.11315v1
• Date: Tue, 15 Apr 2025 15:55:24 GMT
• Title: New Key Rate Bound for High-Dimensional BB84 with Multiple Basis Measurements
• Authors: Trevor N. Thomas, Walter O. Krawec,
• Abstract summary: We derive a new bound on the secret key-rate of the High Dimensional BB84 protocol.<n>We show that far more optimistic key-rates are possible for a low number of signals, even in general channels.
• Score: 2.8851756275902467
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper we derive a new bound on the secret key-rate of the High Dimensional BB84 protocol operating with multiple mutually unbiased bases (MUBs). To our knowledge, our proof is the first for this protocol that is both general (in that it can handle arbitrary, asymmetric channels), and also the first that derives a bound on the quantum min entropy for general attacks, without relying on post selection techniques or the asymptotic equipartition property. Because of this, our new result shows that far more optimistic key-rates are possible for a low number of signals, even in general channels. Furthermore, our proof methods may be broadly applicable to other protocols relying on multiple measurement bases and we prove several technical lemmas that may have independent interest. We evaluate our new bound and compare to prior work, showing that higher key-rates are possible in several operating scenarios. We also show some interesting behavior of the protocol when faced with asymmetric noise.

Related papers

• Security of hybrid BB84 with heterodyne detection [0.0]
  Quantum key distribution (QKD) promises everlasting security based on the laws of physics. Recent hybrid QKD protocols have been introduced to leverage advantages from both categories. We provide a rigorous security proof for a protocol introduced by Qi in 2021, where information is encoded in discrete variables.
  arXiv  Detail & Related papers  (2024-02-26T19:00:01Z)
• 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)
• 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)
• Scalable Mediated Semi-quantum Key Distribution [5.548873288570182]
  Mediated semi-quantum key distribution (M-SQKD) permits two limited "semi-quantum" or "classical" users to establish a secret key with the help of a third party (TP) Several protocols have been studied recently for two-party scenarios, but no one has considered M-SQKD for multi-party scenarios.
  arXiv  Detail & Related papers  (2022-05-13T09:21:12Z)
• Improved Semi-Quantum Key Distribution with Two Almost-Classical Users [1.827510863075184]
  We revisit a mediated semi-quantum key distribution protocol introduced by Massa et al. We show how this protocol may be extended to improve its efficiency and also its noise tolerance. We evaluate the protocol's performance in a variety of lossy and noisy channels.
  arXiv  Detail & Related papers  (2022-03-20T14:41:14Z)
• 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)
• Geometry of Banach spaces: a new route towards Position Based Cryptography [65.51757376525798]
  We study Position Based Quantum Cryptography (PBQC) from the perspective of geometric functional analysis and its connections with quantum games. The main question we are interested in asks for the optimal amount of entanglement that a coalition of attackers have to share in order to compromise the security of any PBQC protocol. We show that the understanding of the type properties of some more involved Banach spaces would allow to drop out the assumptions and lead to unconditional lower bounds on the resources used to attack our protocol.
  arXiv  Detail & Related papers  (2021-03-30T13:55:11Z)
• Round-robin differential phase-time-shifting protocol for quantum key distribution: theory and experiment [58.03659958248968]
  Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties. Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments. We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario. Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
  arXiv  Detail & Related papers  (2021-03-15T15:20: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)
• Entanglement purification by counting and locating errors with entangling measurements [62.997667081978825]
  We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about number and positions of errors in the noisy ensemble.
  arXiv  Detail & Related papers  (2020-11-13T19:02:33Z)
• Lower bounds in multiple testing: A framework based on derandomized proxies [107.69746750639584]
  This paper introduces an analysis strategy based on derandomization, illustrated by applications to various concrete models. We provide numerical simulations of some of these lower bounds, and show a close relation to the actual performance of the Benjamini-Hochberg (BH) algorithm.
  arXiv  Detail & Related papers  (2020-05-07T19:59:51Z)
• Generalized Sliced Distances for Probability Distributions [47.543990188697734]
  We introduce a broad family of probability metrics, coined as Generalized Sliced Probability Metrics (GSPMs) GSPMs are rooted in the generalized Radon transform and come with a unique geometric interpretation. We consider GSPM-based gradient flows for generative modeling applications and show that under mild assumptions, the gradient flow converges to the global optimum.
  arXiv  Detail & Related papers  (2020-02-28T04:18:00Z)

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.