Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2602.05870

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

Rutvij Bhavsar, Junguk Moon, Joonwoo Bae

quant-phSubmitted Feb 5, 2026• Announced Feb 6, 2026• 0 citations• Revised Oct 29, 2026 (v2)
v1 · Feb 5, 2026v2 · Oct 29, 2026
arXivHTMLPDF

Abstract

Quantum key distribution (QKD) achieves information-theoretic security for a shared secret key, using distributed quantum states. To establish secret bits, two honest parties apply key distillation protocols to the resulting measurement outcomes. 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, via an integral representation of the conditional entropy in terms of the error probabilities of binary state discrimination. This connection significantly improves bounds on key rates at finite blocklengths relative to existing fidelity-based bounds. Moreover, in an important special case, it closes the gap between the known sufficient and conjectured necessary conditions for key generation in the large-blocklength limit. More generally, it establishes a matching asymptotic necessary condition, leaving the corresponding finite-blocklength result open. More broadly, our work shows how results in quantum hypothesis testing can directly sharpen the security analysis of QKD.

Comments
27 pages, 2 Figures. Comments are welcome

Related papers

Fidelity bounds for device-independent advantage distillation

Thomas A. Hahn, Ernest Y.-Z. Tan

Abstract It is known that advantage distillation (that is, information reconciliation using two-way communication) improves noise tolerances for quantum key distribution (QKD) setups. Two-way communication is hence also of interest in the device-independent case, where noise tolerance bounds for one-way error correction are currently too low to be experimentally feasible. Existing security proofs for the device-independent repetition-code protocol (the most prominent form of advantage distillation) rely on fidelity-related security conditions, but previous bounds on the fidelity were not tight. We improve on those results by developing an algorithm that returns arbitrarily tight lower bounds on the fidelity. Our results give insight on how strong the fidelity-related security conditions are, and could also be used to compute some lower bounds on one-way protocol keyrates. Finally, we conjecture a necessary security condition for the protocol studied in this work, that naturally complements the existing sufficient conditions.

arXiv:2105.03213•npj Quantum Information•Dec 15, 2022•3 citations

Enhancing distillability of secret keys with entanglement distillation and classical advantage distillation

Shin Sun, Kenneth Goodenough, Daniel Bhatti +2 more

Realizing secure communication between distant parties is one of the main goals of quantum technology. Although quantum key distribution (QKD) promises information-theoretic security for sharing a secret key, the key rate heavily depends on the level of noise in the quantum channel. To overcome the noise, both quantum and classical techniques exist, i.e., entanglement distillation and classical advantage distillation. So far, these techniques have only been used separately from each other. Herein, we present a two-stage distillation scheme concatenating entanglement distillation with classical advantage distillation. For the advantage distillation, we utilize a fixed protocol, specifically, the repetition code; in the case of entanglement distillation, we employ an enumeration algorithm to find an optimal protocol. We test our scheme for noisy entangled states and demonstrate its quantitative advantage: Our two-stage distillation scheme achieves finite key rates even in a high-noise regime where entanglement distillation or advantage distillation alone cannot afford key sharing. We also calculate the security bounds for relevant QKD protocols with our key-distillation scheme and show that they exceed the previous security bounds on the critical quantum bit error rates with only advantage distillation. Since the advantage distillation part does not introduce further requirements for quantum resources other than those required for entanglement distillation, the proposed scheme is well suited for quantum key distribution tasks with entanglement distribution networks.

arXiv:2410.19334•Physical Review A•Sep 11, 2025•3 citations

Numerical evidence for bound secrecy from two-way postprocessing in quantum key distribution

Sumeet Khatri, Norbert Lütkenhaus

Bound secret information is classical information that contains secrecy but from which secrecy cannot be extracted. The existence of bound secrecy has been conjectured but is currently unproven, and in this work we provide analytical and numerical evidence for its existence. Specifically, we consider two-way postprocessing protocols in prepare-and-measure quantum key distribution based on the well-known six-state signal states. In terms of the quantum bit-error rate $Q$ of the classical data, such protocols currently exist for $Q<\frac{5\ensuremath{-}\sqrt{5}}{10}\ensuremath{\approx}27.6%$. On the other hand, for $Q\ensuremath{\ge}\frac{1}{3}$ no such protocol can exist as the observed data are compatible with an intercept-resend attack. This leaves the interesting question of whether successful protocols exist in the interval $\frac{5\ensuremath{-}\sqrt{5}}{10}\ensuremath{\le}Q<\frac{1}{3}$. Previous work has shown that a necessary condition for the existence of two-way postprocessing protocols for distilling secret keys is breaking the symmetric extendability of the underlying quantum state shared by Alice and Bob. Using this result, it has been proven that symmetric extendability can be broken up to the $27.6%$ lower bound using the advantage distillation protocol. In this work, we first show that to break symmetric extendability it is sufficient to consider a generalized form of advantage distillation consisting of one round of postselection by Bob on a block of his data. We then provide evidence that such generalized protocols cannot break symmetric extendability beyond $27.6%$. We thus have evidence to believe that $27.6%$ is an upper bound on two-way postprocessing and that the interval $\frac{5\ensuremath{-}\sqrt{5}}{10}\ensuremath{\le}Q<\frac{1}{3}$ is a domain of bound secrecy.

arXiv:1612.07734•Physical Review A•Apr 14, 2017•17 citations

Quantum Chernoff divergence in advantage distillation for quantum key distribution and device-independent quantum key distribution

Mikka Stasiuk, Norbert Lütkenhaus, Ernest Y.-Z. Tan

Device-independent quantum key distribution (DIQKD) aims to mitigate adversarial exploitation of imperfections in quantum devices by providing an approach for secret key distillation with modest security assumptions. Advantage distillation, a two-way communication procedure in error correction, has proven effective in raising noise tolerances in both device-dependent and device-independent QKD. Previously, device-independent security proofs against independent and identically distributed (IID) collective attacks were developed for an advantage distillation protocol known as the repetition-code protocol, based on security conditions involving the fidelity between some states in the protocol. However, there exists a gap between the sufficient and necessary security conditions, which hinders the calculation of tight noise-tolerance bounds based on the fidelity. We close this gap by presenting an alternative proof structure that replaces the fidelity with the quantum Chernoff divergence, a distinguishability measure that arises in symmetric hypothesis testing. Working in the IID collective attacks model, we derive matching sufficient and necessary conditions for the repetition-code protocol to be secure (up to a natural conjecture regarding the latter case) in terms of the quantum Chernoff divergence, hence indicating that this serves as the relevant quantity of interest for this protocol. Furthermore, using this security condition we obtain some improvements over previous results on the noise tolerance thresholds for DIQKD. Our results provide insight into a fundamental question in quantum information theory regarding the circumstances under which DIQKD is possible.

arXiv:2212.06975•Physical Review A•Feb 27, 2025•2 citations

One-way quantum key distribution: Simple upper bound on the secret key rate

Tobias Moroder, Marcos Curty, Norbert Lütkenhaus

We present a simple method to obtain an upper bound on the achievable secret key rate in quantum key distribution (QKD) protocols that use only unidirectional classical communication during the public-discussion phase. This method is based on a necessary precondition for one-way secret key distillation; the legitimate users need to prove that there exists no quantum state having a symmetric extension that is compatible with the available measurements results. The main advantage of the obtained upper bound is that it can be formulated as a semidefinite program, which can be efficiently solved. We illustrate our results by analyzing two well-known qubit-based QKD protocols: the four-state protocol and the six-state protocol.

arXiv:quant-ph/0603270•Physical Review A•Nov 1, 2006•28 citations

Towards a Finite Size Analysis of Decoy-State Quantum Key Distribution with Advantage Distillation

Kleinpaß, Philipp, Treplin, Jonas, Orsucci, Davide

Quantum Key Distribution (QKD) allows two legitimate parties, Alice and Bob, to share a secret key with information-theoretic security, ensuring that an eavesdropper, Eve, cannot obtain any information about the key. A QKD protocol is provably secure only when the Quantum Bit Error Rate (QBER) is below a certain threshold and, therefore, the presence of noise inherently limits the maximum transmission distance. Advantage Distillation (AD) is a classical post-processing technique that enhances QKD protocols by increasing the maximum acceptable QBER and, thus, allows extending the communication range. AD operates by post-selecting blocks of bits and extracting fewer but highly correlated bits between Alice and Bob, which exhibit a reduced QBER, thus lowering the amount of information that has to be disclosed during the information reconciliation step. In this study, we present a new analytical expression for the secure key rate. This will enable a finite-size secure key length analysis of the decoy state version of the BB84 protocol including AD post-processing.

•Sep 1, 2024•0 citations
Quantum key distribution (QKD) achieves information-theoretic security for a shared secret key, using distributed quantum states. To establish secret bits, two honest parties apply key distillation protocols to the resulting measurement outcomes. 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, via an integral representation of the conditional entropy in terms of the error probabilities of binary state discrimination. This connection significantly improves bounds on key rates at finite blocklengths relative to existing fidelity-based bounds. Moreover, in an important special case, it closes the gap between the known sufficient and conjectured necessary conditions for key generation in the large-blocklength limit. More generally, it establishes a matching asymptotic necessary condition, leaving the corresponding finite-blocklength result open. More broadly, our work shows how results in quantum hypothesis testing can directly sharpen the security analysis of QKD.
Abstract It is known that advantage distillation (that is, information reconciliation using two-way communication) improves noise tolerances for quantum key distribution (QKD) setups. Two-way communication is hence also of interest in the device-independent case, where noise tolerance bounds for one-way error correction are currently too low to be experimentally feasible. Existing security proofs for the device-independent repetition-code protocol (the most prominent form of advantage distillation) rely on fidelity-related security conditions, but previous bounds on the fidelity were not tight. We improve on those results by developing an algorithm that returns arbitrarily tight lower bounds on the fidelity. Our results give insight on how strong the fidelity-related security conditions are, and could also be used to compute some lower bounds on one-way protocol keyrates. Finally, we conjecture a necessary security condition for the protocol studied in this work, that naturally complements the existing sufficient conditions.
Realizing secure communication between distant parties is one of the main goals of quantum technology. Although quantum key distribution (QKD) promises information-theoretic security for sharing a secret key, the key rate heavily depends on the level of noise in the quantum channel. To overcome the noise, both quantum and classical techniques exist, i.e., entanglement distillation and classical advantage distillation. So far, these techniques have only been used separately from each other. Herein, we present a two-stage distillation scheme concatenating entanglement distillation with classical advantage distillation. For the advantage distillation, we utilize a fixed protocol, specifically, the repetition code; in the case of entanglement distillation, we employ an enumeration algorithm to find an optimal protocol. We test our scheme for noisy entangled states and demonstrate its quantitative advantage: Our two-stage distillation scheme achieves finite key rates even in a high-noise regime where entanglement distillation or advantage distillation alone cannot afford key sharing. We also calculate the security bounds for relevant QKD protocols with our key-distillation scheme and show that they exceed the previous security bounds on the critical quantum bit error rates with only advantage distillation. Since the advantage distillation part does not introduce further requirements for quantum resources other than those required for entanglement distillation, the proposed scheme is well suited for quantum key distribution tasks with entanglement distribution networks.
Bound secret information is classical information that contains secrecy but from which secrecy cannot be extracted. The existence of bound secrecy has been conjectured but is currently unproven, and in this work we provide analytical and numerical evidence for its existence. Specifically, we consider two-way postprocessing protocols in prepare-and-measure quantum key distribution based on the well-known six-state signal states. In terms of the quantum bit-error rate QQQ of the classical data, such protocols currently exist for $Q<\frac{5\ensuremath{-}\sqrt{5}}{10}\ensuremath{\approx}27.6%$. On the other hand, for $Q\ensuremath{\ge}\frac{1}{3}$ no such protocol can exist as the observed data are compatible with an intercept-resend attack. This leaves the interesting question of whether successful protocols exist in the interval $\frac{5\ensuremath{-}\sqrt{5}}{10}\ensuremath{\le}Q<\frac{1}{3}$. Previous work has shown that a necessary condition for the existence of two-way postprocessing protocols for distilling secret keys is breaking the symmetric extendability of the underlying quantum state shared by Alice and Bob. Using this result, it has been proven that symmetric extendability can be broken up to the 27.627.6%27.6 lower bound using the advantage distillation protocol. In this work, we first show that to break symmetric extendability it is sufficient to consider a generalized form of advantage distillation consisting of one round of postselection by Bob on a block of his data. We then provide evidence that such generalized protocols cannot break symmetric extendability beyond 27.627.6%27.6. We thus have evidence to believe that 27.627.6%27.6 is an upper bound on two-way postprocessing and that the interval $\frac{5\ensuremath{-}\sqrt{5}}{10}\ensuremath{\le}Q<\frac{1}{3}$ is a domain of bound secrecy.
Device-independent quantum key distribution (DIQKD) aims to mitigate adversarial exploitation of imperfections in quantum devices by providing an approach for secret key distillation with modest security assumptions. Advantage distillation, a two-way communication procedure in error correction, has proven effective in raising noise tolerances in both device-dependent and device-independent QKD. Previously, device-independent security proofs against independent and identically distributed (IID) collective attacks were developed for an advantage distillation protocol known as the repetition-code protocol, based on security conditions involving the fidelity between some states in the protocol. However, there exists a gap between the sufficient and necessary security conditions, which hinders the calculation of tight noise-tolerance bounds based on the fidelity. We close this gap by presenting an alternative proof structure that replaces the fidelity with the quantum Chernoff divergence, a distinguishability measure that arises in symmetric hypothesis testing. Working in the IID collective attacks model, we derive matching sufficient and necessary conditions for the repetition-code protocol to be secure (up to a natural conjecture regarding the latter case) in terms of the quantum Chernoff divergence, hence indicating that this serves as the relevant quantity of interest for this protocol. Furthermore, using this security condition we obtain some improvements over previous results on the noise tolerance thresholds for DIQKD. Our results provide insight into a fundamental question in quantum information theory regarding the circumstances under which DIQKD is possible.
We present a simple method to obtain an upper bound on the achievable secret key rate in quantum key distribution (QKD) protocols that use only unidirectional classical communication during the public-discussion phase. This method is based on a necessary precondition for one-way secret key distillation; the legitimate users need to prove that there exists no quantum state having a symmetric extension that is compatible with the available measurements results. The main advantage of the obtained upper bound is that it can be formulated as a semidefinite program, which can be efficiently solved. We illustrate our results by analyzing two well-known qubit-based QKD protocols: the four-state protocol and the six-state protocol.
Quantum Key Distribution (QKD) allows two legitimate parties, Alice and Bob, to share a secret key with information-theoretic security, ensuring that an eavesdropper, Eve, cannot obtain any information about the key. A QKD protocol is provably secure only when the Quantum Bit Error Rate (QBER) is below a certain threshold and, therefore, the presence of noise inherently limits the maximum transmission distance. Advantage Distillation (AD) is a classical post-processing technique that enhances QKD protocols by increasing the maximum acceptable QBER and, thus, allows extending the communication range. AD operates by post-selecting blocks of bits and extracting fewer but highly correlated bits between Alice and Bob, which exhibit a reduced QBER, thus lowering the amount of information that has to be disclosed during the information reconciliation step. In this study, we present a new analytical expression for the secure key rate. This will enable a finite-size secure key length analysis of the decoy state version of the BB84 protocol including AD post-processing.