Composable security for practical quantum key distribution with two way classical communication

• URL: http://arxiv.org/abs/2102.00739v1
• Date: Mon, 1 Feb 2021 10:11:42 GMT
• Title: Composable security for practical quantum key distribution with two way classical communication
• Authors: Cong Jiang, Xiao-Long Hu, Zong-wen Yu and Xiang-bin Wang
• Abstract summary: We show that simply applying Chernoff bound in the calculation gives correct key rate, but the failure probability changes a little bit. We show that simply applying Chernoff bound in the calculation gives correct key rate, but the failure probability changes a little bit.
• Score: 0.9749560288448115
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present methods to strictly calculate the finite-key effects in quantum key distribution (QKD) with error rejection through two-way classical communication (TWCC) for the sending-or-not-sending twin-field protocol. Unlike the normal QKD without TWCC, here the probability of tagging or untagging for each two-bit random group is not independent. We rigorously solve this problem by imagining a virtual set of bits where every bit is independent and identical. We show the relationship between the outcome starting from this imagined set containing independent and identical bits and the outcome starting with the real set of non-independent bits. With explicit formulas, we show that simply applying Chernoff bound in the calculation gives correct key rate, but the failure probability changes a little bit.

Related papers

• Distributed Quantum Hypothesis Testing under Zero-rate Communication Constraints [14.29947046463964]
  We study a distributed binary hypothesis testing problem to infer a bipartite quantum state shared between two remote parties. We show that the Stein's exponent when one of the parties communicates classically at zero-rate is given by a multi-letter expression. As a key tool for proving the converse direction of our results, we develop a quantum version of the blowing-up lemma.
  arXiv  Detail & Related papers  (2024-10-11T16:03:10Z)
• Twin-field-based multi-party quantum key agreement [0.0]
  We study a method to extend the twin-field key distribution protocol to a scheme for multi-party quantum key agreement. We study our protocol's security using a minimum error discrimination analysis and derive the key rate based on the entanglement-based source-replacement scheme.
  arXiv  Detail & Related papers  (2024-09-06T11:51:10Z)
• Device-independent quantum key distribution with arbitrarily small nonlocality [0.8192907805418583]
  Device-independent quantum key distribution (DIQKD) allows two users to set up shared cryptographic key without the need to trust the quantum devices used. Here we show that no such bound exists, giving schemes that achieve key with correlations arbitrarily close to the local set. Some of our constructions achieve the maximum of 1 bit of key per pair of entangled qubits.
  arXiv  Detail & Related papers  (2023-09-18T10:34:56Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Heralded nonlocal quantum gates for distributed quantum computation in a decoherence-free subspace [4.513705164435675]
  We propose a heralded protocol for implementing nontrivial quantum gates on two stationary qubits coupled to spatially separated cavities. By dynamically controlling the evolution of the composite system, nonlocal two-qubit quantum gates can be achieved without real excitations of either cavity modes or atoms.
  arXiv  Detail & Related papers  (2023-05-01T03:19:07Z)
• A Quantum Algorithm for Computing All Diagnoses of a Switching Circuit [73.70667578066775]
  Faults are by nature while most man-made systems, and especially computers, work deterministically. This paper provides such a connecting via quantum information theory which is an intuitive approach as quantum physics obeys probability laws.
  arXiv  Detail & Related papers  (2022-09-08T17:55:30Z)
• Classical-quantum network coding: a story about tensor [0.0]
  We study the conditions to perform the distribution of a pure state on a quantum network using quantum operations. We develop a formalism which encompasses both types of distribution protocols.
  arXiv  Detail & Related papers  (2021-04-10T12:05:38Z)
• 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)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Quantum Communication Complexity of Distribution Testing [114.31181206328276]
  Two players each receive $t$ samples from one distribution over $[n]$. The goal is to decide whether their two distributions are equal, or are $epsilon$-far apart. We show that the quantum communication complexity of this problem is $tildeO$(tepsilon2))$ qubits when distributions have low $l$-norm.
  arXiv  Detail & Related papers  (2020-06-26T09:05:58Z)
• Distribution-free binary classification: prediction sets, confidence intervals and calibration [106.50279469344937]
  We study three notions of uncertainty quantification -- calibration, confidence intervals and prediction sets -- for binary classification in the distribution-free setting. We derive confidence intervals for binned probabilities for both fixed-width and uniform-mass binning. As a consequence of our 'tripod' theorems, these confidence intervals for binned probabilities lead to distribution-free calibration.
  arXiv  Detail & Related papers  (2020-06-18T14:17:29Z)

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.