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

Allerton Conference on Communication, Control, and Computing

Quantum Key Distribution with State Replacement

Michael Graifer, Yuval Kochman, Ofer Shayevitz

Published Sep 26, 2023• 2 citations
Publisher

Abstract

Quantum key distribution protocols have been studied for almost four decades, and have already seen real world applications. Such implementations often operate in naturally noisy environments (e.g., sensor thermal noise, sun radiation, etc.) with known or measurable noise levels. However, existing security proofs implicitly attribute any channel noise to a possible eavesdropper, an overly pessimistic assumption that can adversely effect the guaranteed protocol key-rate. In this paper, we analyze general prepare-and-measure QKD schemes, and show how to improve the bounds on the key-rate under the assumption of an independent state replacement noise at the receiver. Taking BB84 as a concrete example, our results theoretically guarantee a higher key-rate, as a function of the minimal possible replacement probability. In practice, for some parameter-regimes, this guarantees a higher tolerable QBER.

DOI
10.1109/allerton58177.2023.10313395

Related papers

Noise Resilience of Quantum Key Distribution Protocols Secured Against Independent Attacks With One-Way Communication

Adam Bílek, Ryszard Kukulski, Paulina Lewandowska +2 more

We investigate the resilience to noise of single-qubit quantum key distribution (QKD) protocols in the scenario of security against independent eavesdropping attacks and key distillation based on one-way classical communication. To this end, we introduce a noise-based metric that quantifies the efficiency of QKD protocols. Within this framework, we analyze the maximal noise levels that allow Alice and Bob to asymptotically establish a secure secret key. Using this assumption, we compare the noise tolerance of general single-qubit QKD protocols, in particular the BB84, B92, E91, and six-state protocols. Our main result determines the noise level threshold for QKD allowing one to distill an asymptotically secure secret key. Additionally, we demonstrate that the six-state protocol achieves the greatest resistance to noise while simultaneously yielding a higher post-selection efficiency than the other analyzed single-qubit protocols, confirming its robustness within the considered security model. Finally, we perform an analysis of the proposed noise-based metric and the conventional quantum bit error rate (QBER) metric.

quant-pharXiv:2607.11857•Jul 14, 2026•0 citations

Prepare-and-measure quantum key distribution from a bound on information leakage

Abhishek Mishra, Michele Masini, Maria Balanzó-Juandó +2 more

Every quantum key distribution (QKD) protocol must limit the information available outside the users' laboratories. In device-independent QKD this is essentially the only assumption made on the devices. In a prepare-and-measure setting it cannot be imposed strictly, since the sender's device must emit a signal that depends on her private input. The natural replacement, and a minimal one, is a leakage bound: a bound on how much information about the input leaves the sender's laboratory, through the intended signal or through any side channel. We ask how far this unavoidable requirement can replace a detailed model of the source. We show that this single bound, quantified by the probability of guessing the input from everything the source emits, suffices to prove security against collective attacks. In our analysis, nothing is assumed about the precise form of the emitted states, their dimension, energy or purity, nor about the receiver's measurement device, beyond the standard requirement that it does not leak Bob's data. The standard B92 and BB84 protocols do not certify any key under this minimal leakage bound assumption. But closely related protocols can and, in the ideal limit, achieve one secret bit per key round. For noisy implementations, we compute key rates using semidefinite programming relaxations. Our best protocols tolerate visibilities down to 0.84, corresponding to an 8% quantum bit error rate, compared with the 11% threshold of standard device-dependent BB84.

quant-pharXiv:2610.37296•Oct 28, 2026•0 citations

Concise security bounds for practical decoy-state quantum key distribution

Charles Ci Wen Lim, Marcos Curty, Nino Walenta +2 more

Due to its ability to tolerate high channel loss, decoy-state quantum key distribution (QKD) has been one of the main focuses within the QKD community. Notably, several experimental groups have demonstrated that it is secure and feasible under real-world conditions. Crucially, however, the security and feasibility claims made by most of these experiments were obtained under the assumption that the eavesdropper is restricted to particular types of attacks or that the finite-key effects are neglected. Unfortunately, such assumptions are not possible to guarantee in practice. In this work, we provide concise and tight finite-key security bounds for practical decoy-state QKD that are valid against general attacks.

arXiv:1311.7129•Physical Review A•Feb 10, 2014•405 citations

Quantum key distribution with imperfectly isolated devices

Xoel Sixto, Álvaro Navarrete, Margarida Pereira +3 more

Abstract Most security proofs of quantum key distribution (QKD) assume that there is no unwanted information leakage about the state preparation process. However, this assumption is impossible to guarantee in practice, as QKD systems can leak information to the channel due to device imperfections or the active action of an eavesdropper. Here, we solve this pressing issue by introducing a security proof in the presence of information leakage from all state preparation settings for arguably the most popular QKD scheme, namely the decoy-state BB84 protocol. The proof requires minimal experimental characterization, as only a single parameter related to the isolation of the source needs to be determined, thus providing a clear path for bridging the gap between theory and practice. Moreover, if information about the state of the side channels is available, this can be readily incorporated into the analysis to further improve the resulting performance.

arXiv:2411.13948•Quantum Science and Technology•May 21, 2025•12 citations

Improved source-correlated quantum key distribution

Siying LI, ZHU Shun, Feifei Hu +5 more

Based on the basic principles of quantum mechanics, quantum key distribution (QKD) provides unconditional security for long-distance communication. However, existing QKD with relevant source protocols have limited tolerance for source correlation, which greatly reduces the key generation rate and limits the secure transmission distance, thereby limiting their practical deployment. In this work, we propose an improved QKD with correlated source protocol to overcome these limitations by discarding the traditional loss-tolerant security frameworks. Our approach adopts the standard BB84 protocol for the security analysis, under the assumption that the source correlation has a bounded range and characterized inner product of the states. We theoretically analyze the performance of the improved protocol at different levels of source correlation and channel loss. Numerical simulations show that our protocol achieves a much higher secret key rate and longer transmission distance than traditional schemes. In the case of typical parameters and 0 dB loss, our protocol achieves about 1.5–3 times improvement in secret key rate. Additionally, the maximum tolerable loss is enhanced by about 2–6 dB. This highlights a promising direction for enhancing the robustness and practicality of QKD with correlated sources systems, paving the way for their deployment in real-world quantum communication networks.

Acta Physica Sinica•Jan 1, 2025•0 citations

Asymptotically Optimal Quantum Key Distribution Protocols.

Hao Shu

Quantum key distribution(QKD) could be the most significant application of quantum information theory. In nearly four decades, although substantial QKD protocols are developed, the BB84 protocol and its variants are still the most researched ones. It is well-known that the secure bound of qubit error rate(QBER) of BB84 protocol is about 11$\%$ while it can be increased to 12.6$\%$ by six-state protocol. It would not be surprising that employing more basis could increase the bound. However, what is the optimal one? In this paper, investigations of asymptotically optimal QKD protocols are proposed. Precisely, We present an abstraction of prepare-measure QKD protocols and investigate two special cases which are optimal among all protocols coding by the same states. Our analyses demonstrate that the asymptotically optimal QBER bounds coding by orthogonal qubits are about 22.17$\%$ for both general and memoryless attacks while the bounds coding by non-orthogonal states in two mutually unbiased basis are about 25.30$\%$ for general attacks and 27.00$\%$ for memoryless attacks. The significant improvement indicates the huge space for previous protocols to improve their security while the optimality of our protocols demonstrates the ultimate potential of their security.

•Oct 5, 2021•2 citations
Quantum key distribution protocols have been studied for almost four decades, and have already seen real world applications. Such implementations often operate in naturally noisy environments (e.g., sensor thermal noise, sun radiation, etc.) with known or measurable noise levels. However, existing security proofs implicitly attribute any channel noise to a possible eavesdropper, an overly pessimistic assumption that can adversely effect the guaranteed protocol key-rate. In this paper, we analyze general prepare-and-measure QKD schemes, and show how to improve the bounds on the key-rate under the assumption of an independent state replacement noise at the receiver. Taking BB84 as a concrete example, our results theoretically guarantee a higher key-rate, as a function of the minimal possible replacement probability. In practice, for some parameter-regimes, this guarantees a higher tolerable QBER.
We investigate the resilience to noise of single-qubit quantum key distribution (QKD) protocols in the scenario of security against independent eavesdropping attacks and key distillation based on one-way classical communication. To this end, we introduce a noise-based metric that quantifies the efficiency of QKD protocols. Within this framework, we analyze the maximal noise levels that allow Alice and Bob to asymptotically establish a secure secret key. Using this assumption, we compare the noise tolerance of general single-qubit QKD protocols, in particular the BB84, B92, E91, and six-state protocols. Our main result determines the noise level threshold for QKD allowing one to distill an asymptotically secure secret key. Additionally, we demonstrate that the six-state protocol achieves the greatest resistance to noise while simultaneously yielding a higher post-selection efficiency than the other analyzed single-qubit protocols, confirming its robustness within the considered security model. Finally, we perform an analysis of the proposed noise-based metric and the conventional quantum bit error rate (QBER) metric.
Every quantum key distribution (QKD) protocol must limit the information available outside the users' laboratories. In device-independent QKD this is essentially the only assumption made on the devices. In a prepare-and-measure setting it cannot be imposed strictly, since the sender's device must emit a signal that depends on her private input. The natural replacement, and a minimal one, is a leakage bound: a bound on how much information about the input leaves the sender's laboratory, through the intended signal or through any side channel. We ask how far this unavoidable requirement can replace a detailed model of the source. We show that this single bound, quantified by the probability of guessing the input from everything the source emits, suffices to prove security against collective attacks. In our analysis, nothing is assumed about the precise form of the emitted states, their dimension, energy or purity, nor about the receiver's measurement device, beyond the standard requirement that it does not leak Bob's data. The standard B92 and BB84 protocols do not certify any key under this minimal leakage bound assumption. But closely related protocols can and, in the ideal limit, achieve one secret bit per key round. For noisy implementations, we compute key rates using semidefinite programming relaxations. Our best protocols tolerate visibilities down to 0.84, corresponding to an 8% quantum bit error rate, compared with the 11% threshold of standard device-dependent BB84.
Due to its ability to tolerate high channel loss, decoy-state quantum key distribution (QKD) has been one of the main focuses within the QKD community. Notably, several experimental groups have demonstrated that it is secure and feasible under real-world conditions. Crucially, however, the security and feasibility claims made by most of these experiments were obtained under the assumption that the eavesdropper is restricted to particular types of attacks or that the finite-key effects are neglected. Unfortunately, such assumptions are not possible to guarantee in practice. In this work, we provide concise and tight finite-key security bounds for practical decoy-state QKD that are valid against general attacks.
Abstract Most security proofs of quantum key distribution (QKD) assume that there is no unwanted information leakage about the state preparation process. However, this assumption is impossible to guarantee in practice, as QKD systems can leak information to the channel due to device imperfections or the active action of an eavesdropper. Here, we solve this pressing issue by introducing a security proof in the presence of information leakage from all state preparation settings for arguably the most popular QKD scheme, namely the decoy-state BB84 protocol. The proof requires minimal experimental characterization, as only a single parameter related to the isolation of the source needs to be determined, thus providing a clear path for bridging the gap between theory and practice. Moreover, if information about the state of the side channels is available, this can be readily incorporated into the analysis to further improve the resulting performance.
Based on the basic principles of quantum mechanics, quantum key distribution (QKD) provides unconditional security for long-distance communication. However, existing QKD with relevant source protocols have limited tolerance for source correlation, which greatly reduces the key generation rate and limits the secure transmission distance, thereby limiting their practical deployment. In this work, we propose an improved QKD with correlated source protocol to overcome these limitations by discarding the traditional loss-tolerant security frameworks. Our approach adopts the standard BB84 protocol for the security analysis, under the assumption that the source correlation has a bounded range and characterized inner product of the states. We theoretically analyze the performance of the improved protocol at different levels of source correlation and channel loss. Numerical simulations show that our protocol achieves a much higher secret key rate and longer transmission distance than traditional schemes. In the case of typical parameters and 0 dB loss, our protocol achieves about 1.5–3 times improvement in secret key rate. Additionally, the maximum tolerable loss is enhanced by about 2–6 dB. This highlights a promising direction for enhancing the robustness and practicality of QKD with correlated sources systems, paving the way for their deployment in real-world quantum communication networks.
Quantum key distribution(QKD) could be the most significant application of quantum information theory. In nearly four decades, although substantial QKD protocols are developed, the BB84 protocol and its variants are still the most researched ones. It is well-known that the secure bound of qubit error rate(QBER) of BB84 protocol is about 11%\%% while it can be increased to 12.6%\%% by six-state protocol. It would not be surprising that employing more basis could increase the bound. However, what is the optimal one? In this paper, investigations of asymptotically optimal QKD protocols are proposed. Precisely, We present an abstraction of prepare-measure QKD protocols and investigate two special cases which are optimal among all protocols coding by the same states. Our analyses demonstrate that the asymptotically optimal QBER bounds coding by orthogonal qubits are about 22.17%\%% for both general and memoryless attacks while the bounds coding by non-orthogonal states in two mutually unbiased basis are about 25.30%\%% for general attacks and 27.00%\%% for memoryless attacks. The significant improvement indicates the huge space for previous protocols to improve their security while the optimality of our protocols demonstrates the ultimate potential of their security.