Entropy Bounds via Hypothesis Testing and Its Applications to Two-Way Key Distillation in Quantum Cryptography

• URL: http://arxiv.org/abs/2602.05870v1
• Date: Thu, 05 Feb 2026 16:48:03 GMT
• Title: Entropy Bounds via Hypothesis Testing and Its Applications to Two-Way Key Distillation in Quantum Cryptography
• Authors: Rutvij Bhavsar, Junguk Moon, Joonwoo Bae,
• Abstract summary: Quantum key distribution (QKD) information-theoretic security, without relying on computational assumptions, by distributing quantum states.<n>In this work, we establish a rigorous connection between the key rate achievable by applying two-way key distillation, such as advantage distillation, and quantum hypothesis testing.<n>Our work shows how advances in quantum multiple hypothesis testing can directly sharpen the security analyses of QKD.
• Score: 0.38233569758620045
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum key distribution (QKD) achieves information-theoretic security, without relying on computational assumptions, by distributing quantum states. To establish secret bits, two honest parties exploit key distillation protocols over measurement outcomes resulting after the the distribution of quantum states. In this work, we establish a rigorous connection between the key rate achievable by applying two-way key distillation, such as advantage distillation, and quantum asymptotic hypothesis testing, via an integral representation of the relative entropy. This connection improves key rates at small to intermediate blocklengths relative to existing fidelity-based bounds and enables the computation of entropy bounds for intermediate to large blocklengths. Moreover, this connection allows one to close the gap between known sufficient and conjectured necessary conditions for key generation in the asymptotic regime, while the precise finite blocklegth conditions remain open. More broadly, our work shows how advances in quantum multiple hypothesis testing can directly sharpen the security analyses of QKD.

Related papers

• Quantum Blackwell's Ordering and Differential Privacy [42.694152897125726]
  We develop a framework for quantum differential privacy (QDP) based on quantum hypothesis testing and Blackwell's ordering.<n>This approach characterizes $(eps,delta)$-QDP via hypothesis testing divergences and identifies the most informative quantum state pairs under privacy constraints.
  arXiv  Detail & Related papers  (2025-11-03T11:24:52Z)
• Quartic quantum speedups for community detection [84.14713515477784]
  We develop a quantum algorithm for hypergraph community detection that achieves a quartic quantum speedup.<n>Our algorithm is based on the Kikuchi method, which we extend beyond previously considered problems such as PCA and $p$XORSAT.
  arXiv  Detail & Related papers  (2025-10-09T17:35:17Z)
• Optimising the relative entropy under semidefinite constraints [0.0]
  Finding the minimal relative entropy of two quantum states under semidefinite constraints is a pivotal problem in quantum information theory.<n>We build on a recently introduced integral representation of quantum relative entropy by [Frenkel, Quantum 7, 1102 (2023) and provide reliable bounds as a sequence of semidefinite programs (SDPs)<n>Our approach ensures provable sublinear convergence in the discretization, while also maintaining resource efficiency in terms of SDP matrix dimensions.
  arXiv  Detail & Related papers  (2024-04-25T20:19:47Z)
• Fundamental Limitations within the Selected Cryptographic Scenarios and Supra-Quantum Theories [0.0]
  We study the fundamental limitations within the selected quantum and supra-quantum cryptographic scenarios. We investigate various security paradigms, bipartite and multipartite settings. We propose a novel type of rerouting attack on the quantum Internet.
  arXiv  Detail & Related papers  (2023-11-14T14:48:57Z)
• Harnessing high-dimensional temporal entanglement using limited interferometric setups [41.94295877935867]
  We develop the first complete analysis of high-dimensional entanglement in the polarization-time-domain. We show how to efficiently certify relevant density matrix elements and security parameters for Quantum Key Distribution. We propose a novel setup that can further enhance the noise resistance of free-space quantum communication.
  arXiv  Detail & Related papers  (2023-08-08T17:44:43Z)
• Phase-Matching Quantum Key Distribution without Intensity Modulation [25.004151934190965]
  We propose a phase-matching quantum key distribution protocol without intensity modulation. Simulation results show that the transmission distance of our protocol could reach 305 km in telecommunication fiber. Our protocol provides a promising solution for constructing quantum networks.
  arXiv  Detail & Related papers  (2023-03-21T04:32:01Z)
• Quantum key distribution rates from semidefinite programming [0.0]
  We introduce an efficient algorithm for computing the key rate in quantum key distribution protocols. The resulting algorithm is easy to implement and easy to use. We use it to reanalyse experimental data to demonstrate how higher key rates can be achieved.
  arXiv  Detail & Related papers  (2022-11-10T17:47:37Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification [56.61325554836984]
  The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
  arXiv  Detail & Related papers  (2021-11-01T16:35:41Z)
• Simple and practical DIQKD security analysis via BB84-type uncertainty relations and Pauli correlation constraints [0.0]
  In this work, we describe how the conditional entropy can be bounded in the 2-input/2-output setting. We illustrate the approach on a variant of the device-independent CHSH QKD protocol where both bases are used to generate the key.
  arXiv  Detail & Related papers  (2021-07-19T14:08:43Z)
• Tight finite-key analysis for generalized high-dimensional quantum key distribution [23.578892457164933]
  We propose a tight finite-key analysis suitable for generalized high-dimensional quantum key distribution protocols. Benefitting from our theory, high-dimensional quantum key distribution protocols with finite resources become experimentally feasible.
  arXiv  Detail & Related papers  (2020-08-08T12:33:53Z)
• Finite-key analysis for twin-field quantum key distribution based on generalized operator dominance condition [23.004519226886444]
  Quantum key distribution (QKD) can help two distant peers to share secret key bits, whose security is guaranteed by the law of physics. Recently, twin-field (TF) QKD has been proposed and intensively studied, since it can beat the rate-distance limit. We propose an improved finite-key analysis of TF-QKD through new operator dominance condition.
  arXiv  Detail & Related papers  (2020-07-17T09:41:06Z)

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.