Universal approach to sending-or-not-sending twin field quantum key distribution

• URL: http://arxiv.org/abs/2204.12890v2
• Date: Thu, 5 May 2022 07:36:34 GMT
• Title: Universal approach to sending-or-not-sending twin field quantum key distribution
• Authors: Xiao-Long Hu, Cong Jiang, Zong-Wen Yu, and Xiang-Bin Wang
• Abstract summary: We present the method of decoy-state analysis after bit-flip error correction. We then construct a universal approach to sending-or-not-sending protocol of twin-field quantum key distribution.
• Score: 0.8924669503280335
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present the method of decoy-state analysis after bit-flip error correction and using confidential observed numbers. Taking this tool we then construct a universal approach to sending-or-not-sending (SNS) protocol of twin-field quantum key distribution. In this improved protocol, the code bits are not limited to heralded events in time windows participated by pulses of intensity $\mu_z$ and vacuum. All kinds of heralded events can be used for code bits to distill the final keys. The number of intensities (3 or 4) and the kinds of heralded events for code bits are automatically chosen by the key rate optimization itself. Numerical simulation shows that the key rate rises drastically in typical settings, up to 80\% improvement compared with the prior results. Also, larger intensity value can be used for decoy pulses. This makes the protocol more robust in practical experiments.

Related papers

• Bayesian Optimization for Repeater Protocols [0.0]
  "First-generation" quantum repeater chains distribute entanglement by executing protocols composed of probabilistic entanglement generation, swapping and distillation operations. We show that calculating the secretkey rate for a given protocol is non-trivial due to experimental imperfections and the probabilistic nature of the operations. We use our framework to extract insight on how to maximize the efficiency of repeater protocols across varying node configurations and hardware conditions.
  arXiv  Detail & Related papers  (2025-02-04T10:46:12Z)
• 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)
• Enhancing Dispersive Readout of Superconducting Qubits Through Dynamic Control of the Dispersive Shift: Experiment and Theory [47.00474212574662]
  A superconducting qubit is coupled to a large-bandwidth readout resonator. We show a beyond-state-of-the-art two-state-readout error of only 0.25,%$ in 100 ns integration time. The presented results are expected to further boost the performance of new and existing algorithms and protocols.
  arXiv  Detail & Related papers  (2023-07-15T10:30:10Z)
• Dead-time optimization to increase secure distance range in prepare and measure quantum key distribution protocols [0.0]
  We introduce an effective analytic model, including dead-time and afterpulsing corrections. This model is useful to evaluate the performance of prepare and measure quantum key distribution protocols.
  arXiv  Detail & Related papers  (2023-03-24T01:50:24Z)
• Pulse-controlled qubit in semiconductor double quantum dots [57.916342809977785]
  We present a numerically-optimized multipulse framework for the quantum control of a single-electron charge qubit. A novel control scheme manipulates the qubit adiabatically, while also retaining high speed and ability to perform a general single-qubit rotation.
  arXiv  Detail & Related papers  (2023-03-08T19:00:02Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• 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)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Neural network-based prediction of the secret-key rate of quantum key distribution [6.040436695129137]
  We construct a neural network that can quickly predict the secure key rate based on the experimental parameters and experimental results. This allows the secure key rate of discrete-modulated CV-QKD to be extracted in real time on a low-power platform.
  arXiv  Detail & Related papers  (2021-08-05T12:34:56Z)
• 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)
• Bayesian Bits: Unifying Quantization and Pruning [73.27732135853243]
  We introduce Bayesian Bits, a practical method for joint mixed precision quantization and pruning through gradient based optimization. We experimentally validate our proposed method on several benchmark datasets and show that we can learn pruned, mixed precision networks.
  arXiv  Detail & Related papers  (2020-05-14T16:00:34Z)
• Tight security bounds for decoy-state quantum key distribution [1.1563829079760959]
  The BB84 quantum key distribution (QKD) combined with decoy-state method is currently the most practical protocol. Here, we provide the rigorous and optimal analytic formula to solve the above tasks. Our results can be widely applied to deal with statistical fluctuation in quantum cryptography protocols.
  arXiv  Detail & Related papers  (2020-02-16T07:48:25Z)

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.