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:2603.22448 · Physical Review A

Performance of BB84 without decoy states under varying announcement structures

Zhiyao Wang, Aodhán Corrigan, Norbert Lütkenhaus

quant-phSubmitted Mar 23, 2026• Announced Mar 25, 2026• 0 citations
arXivHTMLPDF

Abstract

In phase-randomized weak coherent pulse (WCP) implementations of Quantum Key Distribution (QKD) BB84 protocol, the decoy method is often used to compensate BB84's vulnerability against photon number splitting (PNS) attacks. However, this typically introduces extra complexities and requirements on experimental devices. In this paper, we are therefore interested in phase-randomized WCP implementations without the decoy method. We examine the performance of three QKD protocols with different classical announcement structures, namely BB84, SARG04, and No Public Announcement of Basis (NPAB) BB84, using numerical security proof techniques. We compare secure key rates of the three protocols in asymptotic and finite-size regimes for lossy and noisy channels. The three protocols show different relative advantages depending on the channel behaviour. Canonical BB84 shows robustness against errors and depolarization, SARG04 demonstrates resilience against high loss channels, and NPAB BB84 shows potential advantages against physical misalignment between QKD devices.

DOI
10.1103/ybl1-j3td

Related papers

Comparison of non-decoy single-photon source and decoy weak coherent pulse in quantum key distribution

Roberto G. Pousa, Daniel K. L. Oi, John Jeffers

Advancements in practical single-photon sources (SPS) exhibiting high brightness and low $g^{(2)}(0)$ have garnered significant interest for their application in quantum key distribution (QKD). To assess their QKD performance, it is essential to compare them with the widely employed weak coherent pulses (WCPs) in the decoy state method. In this work, we analyze the non-decoy efficient BB84 protocol for an SPS, partially characterising its photon statistics by its $g^{(2)}(0)$ and mean photon number. We compare it to the 2-decoy efficient BB84 with WCPs within the finite-key analysis framework while optimizing the parameters of both protocols. Our findings indicate that the non-decoy SPS with a mean photon number of $\langle n \rangle = 0.5$ and $g^{(2)}(0) = 3.6\%$ can enhance the secure key generation over the 2-decoy WCP for block sizes under $4.66 \cdot 10^9$ sent signals ($29$ seconds of acquisition time) at a channel loss of $10$ dB ($52.5$ km of optical fibre). Additionally, we demonstrate an increase in the maximum tolerable channel loss for SPSs with mean photon number $\langle n \rangle \geq 0.0142$ at block sizes below $10^8$ sent signals ($0.62$ seconds of acquisition time). These results suggest that SPSs hold potential for key rate enhancement in short-range QKD networks, though further research is required to evaluate their key generation capabilities when integrated into the decoy method.

arXiv:2405.19963•May 30, 2024•5 citations

Security of Quantum Key Distribution with Weak Coherent Pulses

駿 川上

Quantum key distribution (QKD) allows two distant parties to share a secret key and realizes a communication with information-theoretic security by combining it with one-time-pad encryption.Since the Bennett-Brassard 1984 (BB84) protocol was proposed, a large number of researches on QKD have been conducted from both aspects of theory and implementations.For implementations of QKD, weak coherent pulses (WCP) are heavily used as optical signals because they are easily generated by typical lasers and attenuators.The security for QKD with WCP has been also studied along the development of the implementations.In this thesis, the security analysis of the QKD with WCP is considered and further developed from two aspects.First, the security of the differential-quadrature-phase-shift (DQPS) protocol is proved.The DQPS protocol has essentially the same set up as the phase-encoding BB84 (PE-BB84) protocol, which is one of the most frequently demonstrated protocols.Since the known proof techniques for the BB84 protocol is not directly applicable, a modified approach is developed which is suitable for the DQPS protocol.As a result, the advantage of the DQPS protocol in the key generation rate over the PE-BB84 protocol is shown in the asymptotic limit where the size of communication data is assumed to be infinite.Second, a new method for security analysis with finite-key size is proposed as a suitable method for QKD protocols using WCP.Differently from the current method based on simple random sampling, the proposed method relies on Bernoulli sampling, which is associated with binomial distribution.The security of the BB84 protocol is proved by using the Bernoulli-sampling method, enabling a simpler analysis with a smaller number of parameters to be estimated compared to the method with simple random sampling.The required number of detected signals to generate a secret key is shown to be smaller than 10 4 , which is drastic improvement from the number ∼ 10 7 obtained in the previous result.The proposed method is also applied to the DQPS protocol, and its advantage over the PE-BB84 protocol is certified even in the finite-key regime.i

•Mar 23, 2017•1 citation

Analytical Bounds for Decoy-State Quantum Key Distribution With Discrete Phase Randomization

Zhaohui Liu, Ahmed Q. Lawey, Mohsen Razavi

We analyze the performance of quantum key distribution (QKD) protocols that rely on discrete phase randomization (DPR). For many QKD protocols that rely on weak coherent pulses (WCPs), continuous phase randomization is assumed, which simplifies the security proofs for such protocols. However, it is challenging to achieve such a perfect phase randomization in practice. As an alternative, we can select a discrete set of global phase values for WCPs, but we need to redo the security analysis for such a source. While security proofs incorporating DPR have been established for several QKD protocols, they often rely on computationally intensive numerical optimizations. To address this issue, in this study, we derive analytical bounds on the secret key generation rate of BB84 and measurement-device-independent QKD protocols in the DPR setting. Our analytical bounds closely match the results obtained from more cumbersome numerical methods in the regions of interest.

arXiv:2508.14664•IEEE Journal on Selected Areas in Communications•Jan 1, 2026•3 citations

Optimization of SKR in BB84 with Biased Bases, Decoy States, and Finite-Key Security

Shruti R. S. Parmar, Naman Garg, Ankur Kumar

Quantum Key Distribution (QKD) offers security that is independent of computational assumptions, based on the principle of quantum mechanics, with the BB84 protocol serving as the most foundational and widely employed scheme. Despite its theoretical strength, practical performance is limited by basis mismatch, channel loss, multi-photon emissions, and finite-size statistical fluctuations. This work presents a comprehensive optimisation framework for the BB84 protocol incorporating biased-basis selection, three-intensity weak-coherent decoy states, and finite-key security analysis using conservative Hoeffding bounds. A complete Qiskit-based simulation model is developed to analyse the Secret Key Rate (SKR) as a function of fibre distance, biased basis probabilities, and total number of emitted pulses. Simulation results show that biased-basis selection increases SKR by up to 63.8%, while the combined decoy + biased approach achieves a maximum SKR of 1.099 bits/pulse, representing a 3.07 times improvement over standard BB84. Furthermore, Finite-key simulations demonstrate SKR convergence to asymptotic values for block sizes above 107pulses. Overall, the proposed unified model offers a realistic, practical and reproducible benchmark for analysing the QKD performance in practical fibre-based networks.

International Conference on Secure Cyber Computing and Communications (ICSCCC)•May 29, 2026•0 citations

Photon-Number-Splitting-attack resistant Quantum Key Distribution Protocols without sifting

Fabio Grazioso, Frédéric Grosshans

We propose a family of sifting-less quantum-key-distribution protocols which use reverse-reconciliation, and are based on weak coherent pulses (WCPs) polarized along m different directions. When m=4, the physical part of the protocol is identical to most experimental implementations of BB84 and SARG04 protocols and they differ only in classical communications and data processing. We compute their total keyrate as function of the channel transmission T, using general information theoretical arguments and we show that they have a higher keyrate than the more standard protocols, both for fixed and optimized average photon number of the WCPs. When no decoy-state protocols (DSPs) are applied, the scaling of the keyrate with transmission is improved from T2 for BB84 to T^(1+1/(m-2)). If a DSP is applied, we show how the keyrates scale linearly with T, with an improvement of the prefactor by 75.96 % for m=4. High values of $ m $ allow to asymptotically approach the keyrate obtained with ideal single photon pulses. The fact that the keyrates of these sifting-less protocols are higher compared to those of the aforementioned more standard protocols show that the latter are not optimal, since they do not extract all the available secret key from the experimental correlations.

arXiv:1306.6061•Jun 25, 2013•3 citations

Performance of two quantum-key-distribution protocols

Chi‐Hang Fred Fung, Kiyoshi Tamaki, Hoi‐Kwong Lo

We compare the performance of Bennett-Brassard 1984 (BB84) and Scarani-Acin-Ribordy-Gisin 2004 (SARG04) protocols, the latter of which was proposed by V. Scarani et al. [Phys. Rev. Lett. 92, 057901 (2004)]. Specifically, in this paper, we investigate the SARG04 protocol with two-way classical communications and the SARG04 protocol with decoy states. In the first part of the paper, we show that the SARG04 scheme with two-way communications can tolerate a higher bit error rate (19.4% for a one-photon source and 6.56% for a two-photon source) than the SARG04 one with one-way communications (10.95% for a one-photon source and 2.71% for a two-photon source). Also, the upper bounds on the bit error rate for the SARG04 protocol with two-way communications are computed in a closed form by considering an individual attack based on a general measurement. In the second part of the paper, we propose employing the idea of decoy states in the SARG04 scheme to obtain unconditional security even when realistic devices are used. We compare the performance of the SARG04 protocol with decoy states and the BB84 one with decoy states. We find that the optimal mean-photon number for the SARG04 scheme is higher than that of the BB84 one when the bit error rate is small. Also, we observe that the SARG04 protocol does not achieve a longer secure distance and a higher key generation rate than the BB84 one, assuming a typical experimental parameter set.

arXiv:quant-ph/0510025•Physical Review A•Jan 25, 2006•112 citations
In phase-randomized weak coherent pulse (WCP) implementations of Quantum Key Distribution (QKD) BB84 protocol, the decoy method is often used to compensate BB84's vulnerability against photon number splitting (PNS) attacks. However, this typically introduces extra complexities and requirements on experimental devices. In this paper, we are therefore interested in phase-randomized WCP implementations without the decoy method. We examine the performance of three QKD protocols with different classical announcement structures, namely BB84, SARG04, and No Public Announcement of Basis (NPAB) BB84, using numerical security proof techniques. We compare secure key rates of the three protocols in asymptotic and finite-size regimes for lossy and noisy channels. The three protocols show different relative advantages depending on the channel behaviour. Canonical BB84 shows robustness against errors and depolarization, SARG04 demonstrates resilience against high loss channels, and NPAB BB84 shows potential advantages against physical misalignment between QKD devices.
Advancements in practical single-photon sources (SPS) exhibiting high brightness and low g(2)(0)g^{(2)}(0)g(2)(0) have garnered significant interest for their application in quantum key distribution (QKD). To assess their QKD performance, it is essential to compare them with the widely employed weak coherent pulses (WCPs) in the decoy state method. In this work, we analyze the non-decoy efficient BB84 protocol for an SPS, partially characterising its photon statistics by its g(2)(0)g^{(2)}(0)g(2)(0) and mean photon number. We compare it to the 2-decoy efficient BB84 with WCPs within the finite-key analysis framework while optimizing the parameters of both protocols. Our findings indicate that the non-decoy SPS with a mean photon number of ⟨n⟩=0.5\langle n \rangle = 0.5⟨n⟩=0.5 and g(2)(0)=3.6%g^{(2)}(0) = 3.6\%g(2)(0)=3.6% can enhance the secure key generation over the 2-decoy WCP for block sizes under 4.66⋅1094.66 \cdot 10^94.66⋅109 sent signals (292929 seconds of acquisition time) at a channel loss of 101010 dB (52.552.552.5 km of optical fibre). Additionally, we demonstrate an increase in the maximum tolerable channel loss for SPSs with mean photon number ⟨n⟩≥0.0142\langle n \rangle \geq 0.0142⟨n⟩≥0.0142 at block sizes below 10810^8108 sent signals (0.620.620.62 seconds of acquisition time). These results suggest that SPSs hold potential for key rate enhancement in short-range QKD networks, though further research is required to evaluate their key generation capabilities when integrated into the decoy method.
Quantum key distribution (QKD) allows two distant parties to share a secret key and realizes a communication with information-theoretic security by combining it with one-time-pad encryption.Since the Bennett-Brassard 1984 (BB84) protocol was proposed, a large number of researches on QKD have been conducted from both aspects of theory and implementations.For implementations of QKD, weak coherent pulses (WCP) are heavily used as optical signals because they are easily generated by typical lasers and attenuators.The security for QKD with WCP has been also studied along the development of the implementations.In this thesis, the security analysis of the QKD with WCP is considered and further developed from two aspects.First, the security of the differential-quadrature-phase-shift (DQPS) protocol is proved.The DQPS protocol has essentially the same set up as the phase-encoding BB84 (PE-BB84) protocol, which is one of the most frequently demonstrated protocols.Since the known proof techniques for the BB84 protocol is not directly applicable, a modified approach is developed which is suitable for the DQPS protocol.As a result, the advantage of the DQPS protocol in the key generation rate over the PE-BB84 protocol is shown in the asymptotic limit where the size of communication data is assumed to be infinite.Second, a new method for security analysis with finite-key size is proposed as a suitable method for QKD protocols using WCP.Differently from the current method based on simple random sampling, the proposed method relies on Bernoulli sampling, which is associated with binomial distribution.The security of the BB84 protocol is proved by using the Bernoulli-sampling method, enabling a simpler analysis with a smaller number of parameters to be estimated compared to the method with simple random sampling.The required number of detected signals to generate a secret key is shown to be smaller than 10 4 , which is drastic improvement from the number ∼ 10 7 obtained in the previous result.The proposed method is also applied to the DQPS protocol, and its advantage over the PE-BB84 protocol is certified even in the finite-key regime.i
We analyze the performance of quantum key distribution (QKD) protocols that rely on discrete phase randomization (DPR). For many QKD protocols that rely on weak coherent pulses (WCPs), continuous phase randomization is assumed, which simplifies the security proofs for such protocols. However, it is challenging to achieve such a perfect phase randomization in practice. As an alternative, we can select a discrete set of global phase values for WCPs, but we need to redo the security analysis for such a source. While security proofs incorporating DPR have been established for several QKD protocols, they often rely on computationally intensive numerical optimizations. To address this issue, in this study, we derive analytical bounds on the secret key generation rate of BB84 and measurement-device-independent QKD protocols in the DPR setting. Our analytical bounds closely match the results obtained from more cumbersome numerical methods in the regions of interest.
Quantum Key Distribution (QKD) offers security that is independent of computational assumptions, based on the principle of quantum mechanics, with the BB84 protocol serving as the most foundational and widely employed scheme. Despite its theoretical strength, practical performance is limited by basis mismatch, channel loss, multi-photon emissions, and finite-size statistical fluctuations. This work presents a comprehensive optimisation framework for the BB84 protocol incorporating biased-basis selection, three-intensity weak-coherent decoy states, and finite-key security analysis using conservative Hoeffding bounds. A complete Qiskit-based simulation model is developed to analyse the Secret Key Rate (SKR) as a function of fibre distance, biased basis probabilities, and total number of emitted pulses. Simulation results show that biased-basis selection increases SKR by up to 63.8%, while the combined decoy + biased approach achieves a maximum SKR of 1.099 bits/pulse, representing a 3.07 times improvement over standard BB84. Furthermore, Finite-key simulations demonstrate SKR convergence to asymptotic values for block sizes above 107pulses. Overall, the proposed unified model offers a realistic, practical and reproducible benchmark for analysing the QKD performance in practical fibre-based networks.
We propose a family of sifting-less quantum-key-distribution protocols which use reverse-reconciliation, and are based on weak coherent pulses (WCPs) polarized along m different directions. When m=4, the physical part of the protocol is identical to most experimental implementations of BB84 and SARG04 protocols and they differ only in classical communications and data processing. We compute their total keyrate as function of the channel transmission T, using general information theoretical arguments and we show that they have a higher keyrate than the more standard protocols, both for fixed and optimized average photon number of the WCPs. When no decoy-state protocols (DSPs) are applied, the scaling of the keyrate with transmission is improved from T2 for BB84 to T^(1+1/(m-2)). If a DSP is applied, we show how the keyrates scale linearly with T, with an improvement of the prefactor by 75.96 % for m=4. High values of $ m $ allow to asymptotically approach the keyrate obtained with ideal single photon pulses. The fact that the keyrates of these sifting-less protocols are higher compared to those of the aforementioned more standard protocols show that the latter are not optimal, since they do not extract all the available secret key from the experimental correlations.
We compare the performance of Bennett-Brassard 1984 (BB84) and Scarani-Acin-Ribordy-Gisin 2004 (SARG04) protocols, the latter of which was proposed by V. Scarani et al. [Phys. Rev. Lett. 92, 057901 (2004)]. Specifically, in this paper, we investigate the SARG04 protocol with two-way classical communications and the SARG04 protocol with decoy states. In the first part of the paper, we show that the SARG04 scheme with two-way communications can tolerate a higher bit error rate (19.4% for a one-photon source and 6.56% for a two-photon source) than the SARG04 one with one-way communications (10.95% for a one-photon source and 2.71% for a two-photon source). Also, the upper bounds on the bit error rate for the SARG04 protocol with two-way communications are computed in a closed form by considering an individual attack based on a general measurement. In the second part of the paper, we propose employing the idea of decoy states in the SARG04 scheme to obtain unconditional security even when realistic devices are used. We compare the performance of the SARG04 protocol with decoy states and the BB84 one with decoy states. We find that the optimal mean-photon number for the SARG04 scheme is higher than that of the BB84 one when the bit error rate is small. Also, we observe that the SARG04 protocol does not achieve a longer secure distance and a higher key generation rate than the BB84 one, assuming a typical experimental parameter set.