Phase error estimation for passive detection setups with imperfections and memory effects

• URL: http://arxiv.org/abs/2508.21486v1
• Date: Fri, 29 Aug 2025 10:11:06 GMT
• Title: Phase error estimation for passive detection setups with imperfections and memory effects
• Authors: Zhiyao Wang, Devashish Tupkary, Shlok Nahar,
• Abstract summary: We develop a generic framework to bound the phase error rate for quantum key distribution protocols.<n>This framework can be used in proof techniques based on the entropic uncertainty relation or phase error correction.
• Score: 0.8793721044482612
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop a generic framework to bound the phase error rate for quantum key distribution protocols using passive detection setups with imperfections and memory effects. This framework can be used in proof techniques based on the entropic uncertainty relation or phase error correction, to prove security in the finite-size regime against coherent attacks. Our framework can incorporate on-the-fly announcements of click/no-click outcomes on Bob's side. In the case of imperfections without memory effects, it can be combined with proofs addressing source imperfections in a modular manner. We apply our framework to compute key rates for the decoy-state BB84 protocol, when the beam splitting ratio, the detection efficiency, and dark counts of the detectors are only known to be within some ranges. We also compute key rates in the presence of memory effects in the detectors. In this case, our results allow for protocols to be run at higher repetition rates, resulting in a significant improvement in the secure key generation rate.

Related papers

• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• Loss-tolerant quantum key distribution with detection efficiency mismatch [39.58317527488534]
  We establish a security proof for the loss-tolerant P&M QKD protocol that incorporates imperfections in both the source and the detectors.<n>Specifically, we demonstrate the security of this scheme when the emitted states deviate from the ideal ones.
  arXiv  Detail & Related papers  (2024-12-12T19:01:56Z)
• Phase error rate estimation in QKD with imperfect detectors [0.0]
  We present a finite-size security proof of the decoy-state BB84 QKD protocol against coherent attacks.<n>We apply this result to the case of detectors with imperfectly characterized basis-efficiency mismatch.
  arXiv  Detail & Related papers  (2024-08-30T15:23:21Z)
• Differential-phase-shift QKD with practical Mach-Zehnder interferometer [0.0]
  We enhance the implementation security of the DPS protocol by incorporating a major imperfection in the measurement unit. Our numerical simulations demonstrate that even with fluctuations of $pm0.5%$ in the transmittance from the ideal value, the key rate degrades only by a factor of 0.57.
  arXiv  Detail & Related papers  (2024-05-20T03:38:02Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• 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)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Bandit Quickest Changepoint Detection [55.855465482260165]
  Continuous monitoring of every sensor can be expensive due to resource constraints. We derive an information-theoretic lower bound on the detection delay for a general class of finitely parameterized probability distributions. We propose a computationally efficient online sensing scheme, which seamlessly balances the need for exploration of different sensing options with exploitation of querying informative actions.
  arXiv  Detail & Related papers  (2021-07-22T07:25:35Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Probabilistic Ranking-Aware Ensembles for Enhanced Object Detections [50.096540945099704]
  We propose a novel ensemble called the Probabilistic Ranking Aware Ensemble (PRAE) that refines the confidence of bounding boxes from detectors. We also introduce a bandit approach to address the confidence imbalance problem caused by the need to deal with different numbers of boxes.
  arXiv  Detail & Related papers  (2021-05-07T09:37:06Z)
• Security proof of practical quantum key distribution with detection-efficiency mismatch [3.1988884923120313]
  We develop a method that allows to provide security proofs without the usual assumption. Our method can take the detection-efficiency mismatch into account without having to restrict the attack strategy of the adversary. Our method also shows that in the absence of efficiency mismatch in our detector model, the key rate increases if the loss due to detection inefficiency is assumed to be outside of the adversary's control.
  arXiv  Detail & Related papers  (2020-04-09T06:49: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.