An Efficient Error Estimation Method in Quantum Key Distribution

• URL: http://arxiv.org/abs/2411.07160v1
• Date: Mon, 11 Nov 2024 17:37:20 GMT
• Title: An Efficient Error Estimation Method in Quantum Key Distribution
• Abstract summary: We propose a hybrid approach to preserve the entire sifted key after error estimation. Although accessible to an eavesdropper, the modified and extended sifted key ensures that the number of attempts to crack it remains the same.
• Score: 5.433638656301075
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Error estimation is an important step for error correction in quantum key distribution. Traditional error estimation methods require sacrificing a part of the sifted key, forcing a trade-off between the accuracy of error estimation and the size of the partial sifted key to be used and discarded. In this paper, we propose a hybrid approach that aims to preserve the entire sifted key after error estimation while preventing Eve from gaining any advantage. The entire sifted key, modified and extended by our proposed method, is sent for error estimation in a public channel. Although accessible to an eavesdropper, the modified and extended sifted key ensures that the number of attempts to crack it remains the same as when no information is leaked. The entire sifted key is preserved for subsequent procedures, indicating the efficient utilization of quantum resources.

Related papers

• The finite key effect of side-channel-secure quantum key distribution beyond post-selection technique [1.8768434577064823]
  We introduce a security-proof method for variable-length side-channel-secure (SCS) quantum key distribution (QKD) against coherent attacks.<n>It yields tight key rates for the SCS protocol and reduces pulse requirements by over two orders of magnitude compared to prior works.
  arXiv  Detail & Related papers  (2026-07-20T01:31:35Z)
• The Manipulate-and-Observe Attack on Quantum Key Distribution [0.0]
  Post-processing reveals vulnerabilities that an eavesdropper could target.<n> reconciliation protocols correct errors by comparing the parities of subsets between both parties.<n>There is no holistic threat model that addresses how parity-leakage during reconciliation might be actively manipulated.
  arXiv  Detail & Related papers  (2026-03-31T12:27:37Z)
• Security loophole in error verification in quantum key distribution [6.554326244334867]
  We show that even if verification's outcome is leaked to Eve, the security can still be guaranteed by increasing the number of bits reduced in privacy amplification by just one bit.<n>This result is expected to play an important role in future standardization and formal certification of quantum key distribution protocols.
  arXiv  Detail & Related papers  (2025-07-29T00:50:27Z)
• 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)
• Quantize What Counts: More for Keys, Less for Values [63.51476878610841]
  Large Language Models (LLMs) suffer inference-time memory bottlenecks dominated by the attention Key-Value ( KV) cache.<n>This paper proposes two theorems that anchor mixed-precision KV quantization in the intrinsic geometry of Transformer models.
  arXiv  Detail & Related papers  (2025-02-20T22:24:27Z)
• Bones Can't Be Triangles: Accurate and Efficient Vertebrae Keypoint Estimation through Collaborative Error Revision [39.347666307218006]
  KeyBot is designed to identify and correct significant and typical errors in existing models, akin to user revision. By characterizing typical error types and using simulated errors for training, KeyBot effectively corrects these errors and significantly reduces user workload.
  arXiv  Detail & Related papers  (2024-09-05T06:03:52Z)
• Symmetric Q-learning: Reducing Skewness of Bellman Error in Online Reinforcement Learning [55.75959755058356]
  In deep reinforcement learning, estimating the value function is essential to evaluate the quality of states and actions. A recent study suggested that the error distribution for training the value function is often skewed because of the properties of the Bellman operator. We proposed a method called Symmetric Q-learning, in which the synthetic noise generated from a zero-mean distribution is added to the target values to generate a Gaussian error distribution.
  arXiv  Detail & Related papers  (2024-03-12T14:49:19Z)
• Continuous-Variable Quantum Key Distribution with key rates far above the PLOB bound [0.7918886297003017]
  We provide an analysis of the secret key rate for the case of Gaussian collective attacks. We obtain secret key rates far above the Devetak-Winter value $I(X;Y) - I(E;Y)$, which is the upper bound in the case of one-way error correction.
  arXiv  Detail & Related papers  (2024-02-07T11:40:18Z)
• 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)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• Upper bounds on key rates in device-independent quantum key distribution based on convex-combination attacks [1.118478900782898]
  We present the convex-combination attack as an efficient, easy-to-use technique for upper-bounding DIQKD key rates. It allows verifying the accuracy of lower bounds on key rates for state-of-the-art protocols.
  arXiv  Detail & Related papers  (2022-06-13T15:27:48Z)
• Error-based Knockoffs Inference for Controlled Feature Selection [49.99321384855201]
  We propose an error-based knockoff inference method by integrating the knockoff features, the error-based feature importance statistics, and the stepdown procedure together. The proposed inference procedure does not require specifying a regression model and can handle feature selection with theoretical guarantees.
  arXiv  Detail & Related papers  (2022-03-09T01:55:59Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• 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)
• 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)
• Noiseless attack and counterfactual security of quantum key distribution [0.0]
  We show that the efficiency of counterfactual QKD protocols can be enhanced by including non-counterfactual bits. We show how this problem can be resolved in a simple way, whereby the non-counterfactual key bits are indicated to be secure. This method of enhancing the key rate is shown to be applicable to various existing quantum counterfactual key distribution protocols.
  arXiv  Detail & Related papers  (2020-12-09T16:48:43Z)
• Deterministic correction of qubit loss [48.43720700248091]
  Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors. We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
  arXiv  Detail & Related papers  (2020-02-21T19:48:53Z)

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.