QKD parameter estimation by two-universal hashing

• URL: http://arxiv.org/abs/2109.06709v4
• Date: Wed, 11 Jan 2023 16:54:57 GMT
• Title: QKD parameter estimation by two-universal hashing
• Authors: Dimiter Ostrev
• Abstract summary: This paper proposes and proves security of a QKD protocol which uses two-universal hashing instead of random sampling. This protocol dramatically outperforms previous QKD protocols for small block sizes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper proposes and proves security of a QKD protocol which uses two-universal hashing instead of random sampling to estimate the number of bit flip and phase flip errors. This protocol dramatically outperforms previous QKD protocols for small block sizes. More generally, for the two-universal hashing QKD protocol, the difference between asymptotic and finite key rate decreases with the number $n$ of qubits as $cn^{-1}$, where $c$ depends on the security parameter. For comparison, the same difference decreases no faster than $c'n^{-1/3}$ for an optimized protocol that uses random sampling and has the same asymptotic rate, where $c'$ depends on the security parameter and the error rate.

Related papers

• Tight scaling of key rate for differential-phase-shift quantum key distribution [7.366405857677226]
  We consider a type of DPS protocol in which the phase of each emitted block comprises $n$ pulses is randomized. We reveal that the key rate is proportional to $eta1+frac1n-2$ and this rate is tight. Our result suggests that the DPS protocol can achieve a combination of both advantages of ease of implementation and a high key generation rate.
  arXiv  Detail & Related papers  (2024-05-16T12:15:18Z)
• Bit-flipping Decoder Failure Rate Estimation for (v,w)-regular Codes [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder. We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40:24Z)
• Generalized Hybrid Search and Applications to Blockchain and Hash Function Security [50.16790546184646]
  We first examine the hardness of solving various search problems by hybrid quantum-classical strategies. We then construct a hybrid quantum-classical search algorithm and analyze its success probability.
  arXiv  Detail & Related papers  (2023-11-07T04:59:02Z)
• Tokenization and the Noiseless Channel [71.25796813073399]
  Good tokenizers lead to emphefficient channel usage, where the channel is the means by which some input is conveyed to the model. In machine translation, we find that across multiple tokenizers, the R'enyi entropy with $alpha = 2.5$ has a very strong correlation with textscBleu: $0.78$ in comparison to just $-0.32$ for compressed length.
  arXiv  Detail & Related papers  (2023-06-29T10:32:09Z)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• Efficient Certifiable Randomness from a Single Quantum Device [6.531546527140474]
  We use the leakage resilience properties of the Learning With problem to address the rate of generation of randomness. Our new protocol can certify $Omega(n)$ fresh bits of randomness in constant rounds.
  arXiv  Detail & Related papers  (2022-04-24T20:32:17Z)
• Scalable implementation of $(d+1)$ mutually unbiased bases for $d$-dimensional quantum key distribution [0.0]
  A high-dimensional quantum key distribution (QKD) can improve error rate tolerance and the secret key rate. Many $d$-dimensional QKDs have used two mutually unbiased bases (MUBs) We propose a scalable and general implementation of $(d+1)$ MUBs using $log_p d$ interferometers in prime power dimensions.
  arXiv  Detail & Related papers  (2022-04-06T09:39:55Z)
• Numerical Method for Finite-size Security Analysis of Quantum Key Distribution [1.2891210250935146]
  We develop a finite-size security analysis against general attacks for general QKD protocols. Our result shows that the finite-size key rate can surpass the linear key-rate bound in a realistic communication time.
  arXiv  Detail & Related papers  (2021-11-16T09:10:56Z)
• Asymptotically Optimal prepare-measure Quantum Key Distribution Protocol [0.0]
  In nearly four decades, although substantial QKD protocols are developed, the BB84 protocol and its variants are still the most researched ones. We present an abstraction of prepare-measure QKD protocols and investigate two special cases which are optimal among all protocols coding by the same states. Our analysis demonstrates that the optimal QBER bounds coding by qubits are about 27.28$%$ for both memory C-NOT attacks and memoryless C-NOT attacks.
  arXiv  Detail & Related papers  (2021-10-05T12:13:37Z)
• 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)
• 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)

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.