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:2608.09674

Phase-error estimation for quantum key distribution with leaky receivers

Álvaro Navarrete, Margarida Pereira, Guillermo Currás-Lorenzo, Akihiro Mizutani, Marcos Curty, Kiyoshi Tamaki

quant-phSubmitted Aug 10, 2026• Announced Aug 11, 2026• 0 citations
arXivHTMLPDF

Abstract

Practical quantum key distribution (QKD) receivers may leak information about their measurement outcomes and settings to the channel (e.g., through detector backflashes or back-reflected Trojan-horse light) that could compromise the protocol's security. Here we present a simple finite-key security proof based on phase-error estimation for prepare-and-measure QKD in the presence of either a priori information leakage about the basis choices and/or a posteriori information leakage about the measurement outcomes. The proof requires only a bound on the distinguishability of the side-channel states. Furthermore, the analysis is modular and compatible with existing security proofs that address detector and source imperfections, making it applicable to a wide range of practical QKD implementations.

Comments
12 pages, 2 figures

Related papers

Security of quantum key distribution with source and detector imperfections through phase-error estimation

Guillermo Currás-Lorenzo, Margarida Pereira, Shlok Nahar +1 more

Quantum key distribution promises information-theoretic security, but practical implementations face vulnerabilities due to device imperfections. Existing security proofs typically address source and detector imperfections separately and cannot be directly combined, while the few attempts to handle both simultaneously have assumed idealized scenarios with infinitely many protocol rounds, which is insufficient to certify the security of real-world systems. Here, we close this gap by introducing a modular lifting theorem that extends any (present or future) phase-error-based security proof for active-basis-choice BB84-type protocols to incorporate detector efficiency mismatches. By applying this theorem to a state-of-the-art analysis for source imperfections, we obtain the first finite-key security proof against general coherent attacks that simultaneously addresses both source and detector imperfections.

arXiv:2507.03549•npj Quantum Information•May 18, 2026•3 citations

Finite-key security analysis of decoy-state QKD with source and detector imperfections

Xoel Sixto, Guillermo Currás-Lorenzo, Margarida Pereira +3 more

Decoy-state quantum key distribution (QKD) is the most widely adopted approach for overcoming the limitations of imperfect single-photon sources. However, existing security proofs typically either neglect important device imperfections or rely on assumptions that are difficult to justify in realistic high-speed implementations, such as the independent and identically distributed nature of the emitted signals. In this work, we combine and extend several recent theoretical advances to provide a comprehensive analytical finite-key security proof for decoy-state QKD that simultaneously incorporates multiple practically relevant transmitter and receiver imperfections, including state-preparation flaws, bit and basis side-channel leakage and correlations, setting-independent intensity fluctuations, and detection-efficiency mismatches.

quant-pharXiv:2606.29943•Jun 30, 2026•0 citations

Finite-key security analysis for quantum key distribution with leaky sources

Weilong Wang, Kiyoshi Tamaki, Marcos Curty

Security proofs of quantum key distribution (QKD) typically assume that the devices of the legitimate users are perfectly shielded from the eavesdropper. This assumption is, however, very hard to meet in practice, and thus the security of current QKD implementations is not guaranteed. Here, we fill this gap by providing a finite-key security analysis for QKD which is valid against arbitrary information leakage from the state preparation process of the legitimate users. For this, we extend the techniques introduced by Tamaki et al (2016 New J. Phys. 18 065008) to the finite-key regime, and we evaluate the security of a leaky decoy-state BB84 protocol with biased basis choice, which is one of the most implemented QKD schemes today. Our simulation results demonstrate the practicability of QKD over long distances and within a reasonable time frame given that the legitimate users' devices are sufficiently isolated.

arXiv:1803.09508•New Journal of Physics•Aug 6, 2018•50 citations

The practical issues of side-channel-secure quantum key distribution

Cong Jiang, Hu, Xiao-Long, Zong‐Wen Yu +2 more

Quantum Key Distribution (QKD) leverages the principles of quantum mechanics to provide theoretically unconditional security for cryptographic key sharing. However, practical implementations remain vulnerable due to non-ideal devices and potential security loopholes at both the source and detection sides of QKD systems. The side-channel-secure (SCS) protocol addresses these challenges by encoding bits in vacuum and non-vacuum states and introducing a third-party measurement node, thereby repelling attacks targeting the detection side as well as external lab attacks on the source side. In this work, we consider the state-dependent correlated errors and Trojan-horse attack while preserving the SCS protocol's key advantage-specifically, requiring only upper bounds on intensities characterization without needing a full description of quantum states in infinite dimensions. Numerical results demonstrate that when the reflected light intensity from Trojan-horse attacks falls below $10^{-6}$, Eve can scarcely extract additional key information from the reflections. This work makes the SCS protocol more practical.

arXiv:2508.15197•Aug 21, 2025•0 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

Finite-key security analysis of the decoy-state BB84 QKD with passive measurement

Akihiro Mizutani, Shun Kawakami, Go Kato

The decoy-state Bennett-Brassard 1984 (BB84) quantum key distribution (QKD) protocol is widely regarded as the de facto standard for practical implementations. On the receiver side, passive basis choice is attractive because it significantly reduces the need for random number generators and eliminates the need for optical modulators. Despite these advantages, a finite-key analytical security proof for the decoy-state BB84 protocol, where the basis is chosen passively with a biased probability, has been lacking. In this work, we present a simple analytical finite-key security proof for this setting, yielding a closed-form secret-key rate formula that can be directly evaluated using experimentally accessible parameters. Numerical simulations show that the key rates of passiveand active-measurement implementations are nearly identical, indicating that passive measurement does not compromise key-generation efficiency in practical QKD systems.

quant-pharXiv:2511.21253•Quantum Science and Technology•Nov 27, 2025•2 citations
Practical quantum key distribution (QKD) receivers may leak information about their measurement outcomes and settings to the channel (e.g., through detector backflashes or back-reflected Trojan-horse light) that could compromise the protocol's security. Here we present a simple finite-key security proof based on phase-error estimation for prepare-and-measure QKD in the presence of either a priori information leakage about the basis choices and/or a posteriori information leakage about the measurement outcomes. The proof requires only a bound on the distinguishability of the side-channel states. Furthermore, the analysis is modular and compatible with existing security proofs that address detector and source imperfections, making it applicable to a wide range of practical QKD implementations.
Quantum key distribution promises information-theoretic security, but practical implementations face vulnerabilities due to device imperfections. Existing security proofs typically address source and detector imperfections separately and cannot be directly combined, while the few attempts to handle both simultaneously have assumed idealized scenarios with infinitely many protocol rounds, which is insufficient to certify the security of real-world systems. Here, we close this gap by introducing a modular lifting theorem that extends any (present or future) phase-error-based security proof for active-basis-choice BB84-type protocols to incorporate detector efficiency mismatches. By applying this theorem to a state-of-the-art analysis for source imperfections, we obtain the first finite-key security proof against general coherent attacks that simultaneously addresses both source and detector imperfections.
Decoy-state quantum key distribution (QKD) is the most widely adopted approach for overcoming the limitations of imperfect single-photon sources. However, existing security proofs typically either neglect important device imperfections or rely on assumptions that are difficult to justify in realistic high-speed implementations, such as the independent and identically distributed nature of the emitted signals. In this work, we combine and extend several recent theoretical advances to provide a comprehensive analytical finite-key security proof for decoy-state QKD that simultaneously incorporates multiple practically relevant transmitter and receiver imperfections, including state-preparation flaws, bit and basis side-channel leakage and correlations, setting-independent intensity fluctuations, and detection-efficiency mismatches.
Security proofs of quantum key distribution (QKD) typically assume that the devices of the legitimate users are perfectly shielded from the eavesdropper. This assumption is, however, very hard to meet in practice, and thus the security of current QKD implementations is not guaranteed. Here, we fill this gap by providing a finite-key security analysis for QKD which is valid against arbitrary information leakage from the state preparation process of the legitimate users. For this, we extend the techniques introduced by Tamaki et al (2016 New J. Phys. 18 065008) to the finite-key regime, and we evaluate the security of a leaky decoy-state BB84 protocol with biased basis choice, which is one of the most implemented QKD schemes today. Our simulation results demonstrate the practicability of QKD over long distances and within a reasonable time frame given that the legitimate users' devices are sufficiently isolated.
Quantum Key Distribution (QKD) leverages the principles of quantum mechanics to provide theoretically unconditional security for cryptographic key sharing. However, practical implementations remain vulnerable due to non-ideal devices and potential security loopholes at both the source and detection sides of QKD systems. The side-channel-secure (SCS) protocol addresses these challenges by encoding bits in vacuum and non-vacuum states and introducing a third-party measurement node, thereby repelling attacks targeting the detection side as well as external lab attacks on the source side. In this work, we consider the state-dependent correlated errors and Trojan-horse attack while preserving the SCS protocol's key advantage-specifically, requiring only upper bounds on intensities characterization without needing a full description of quantum states in infinite dimensions. Numerical results demonstrate that when the reflected light intensity from Trojan-horse attacks falls below 10−610^{-6}10−6, Eve can scarcely extract additional key information from the reflections. This work makes the SCS protocol more practical.
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.
The decoy-state Bennett-Brassard 1984 (BB84) quantum key distribution (QKD) protocol is widely regarded as the de facto standard for practical implementations. On the receiver side, passive basis choice is attractive because it significantly reduces the need for random number generators and eliminates the need for optical modulators. Despite these advantages, a finite-key analytical security proof for the decoy-state BB84 protocol, where the basis is chosen passively with a biased probability, has been lacking. In this work, we present a simple analytical finite-key security proof for this setting, yielding a closed-form secret-key rate formula that can be directly evaluated using experimentally accessible parameters. Numerical simulations show that the key rates of passiveand active-measurement implementations are nearly identical, indicating that passive measurement does not compromise key-generation efficiency in practical QKD systems.