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

Learnt Attacks on Quantum Key Distribution under Channel Noise and Device Drift

Marcel Mordarski, Benjamin Gras, Abdelrahman Shehata, Daniel Budina, Roberto Bondesan

quant-phcs.CRcs.ITcs.LGSubmitted Oct 1, 2026• Announced Oct 2, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum key distribution (QKD) links are provisioned from security analyses of stationary channels, whereas the devices that determine the channel drift between recalibrations. Whether an eavesdropper who cannot alter the channel's own noise gains by following that drift has not been quantified. Adaptive eavesdropping is posed here as a constrained Markov decision process in which the attacker selects one circuit per round while the noise level follows an Ornstein--Uhlenbeck process and the abort condition is a budget over each block of rounds. The value of adaptation is bounded by the best fixed circuit and a dynamic-programming upper bound. The actions are learnt attacks. Whereas Decker et al. trained a parametrised circuit on a fixed gate template against a fixed channel, here the gate structure and rotation angles are searched jointly. This yields circuits compact enough to form a discrete action set, extending the construction to noise models lacking a known template, including the amplitude damping channel. On device-independent E91 under bilateral depolarising noise, a reinforcement-learning attacker raises her Holevo information from $0.135$ for the best fixed circuit to $0.348$ at zero detection, $98\%$ of the upper bound. On BB84 under a drifting bit-flip channel, she exceeds a conservative noise-indexed rule by $0.024$ in fidelity, reaching $99\%$ of the upper bound. Under stationary noise, the attacker's gain from basis asymmetry changes sign between an averaged and a per-basis error-rate constraint. The search, started from random gate sequences, recovers the analytical cloners and the collective-attack key rate, and meets the lower bound of the Winick--Lütkenhaus--Coles objective from above.

AI Summary

The paper asks how much an eavesdropper gains by adapting to channel drift when the channel noise is trusted and cannot be controlled by the attacker. This concerns restricted-attacker provisioning margins, not a failure of security proofs that attribute all observed noise to Eve and accommodate adaptive attacks. An evolutionary search jointly optimises circuit topology and rotation angles, producing attack libraries for BB84 and CHSH-based E91. Circuit selection is formulated as a constrained sequential decision problem: noise follows a clipped Ornstein–Uhlenbeck process, and abort statistics are averaged over 50-round episodes. Reinforcement-learning policies are compared with fixed circuits, greedy selection and dynamic programming over the library. For E91 with bilateral depolarising noise, the adaptive policy achieves Holevo information $0.3484$ versus $0.135$ for the best fixed circuit, with no detections observed in evaluation; the library dynamic-programming value is approximately $0.356\pm0.001$. Greedy selection reaches $0.3507$. For BB84, adaptation raises recovery fidelity from $0.7197$ for a conservative noise-indexed rule to $0.7434$, matching greedy selection, against a dynamic-programming value of $0.7527$. Stationary tests recover known cloning trade-offs and collective-attack rates, and show that the sign of the basis-asymmetry advantage depends on averaged versus per-basis monitoring. The stated limitations include asymptotic detection statistics, perfect knowledge of current noise, bounded quantum memories and finite circuit libraries. BB84 drift tests use basis-averaged monitoring and a different noise placement from the stationary tests. Constructed attacks provide lower bounds on attacker capability, not security certificates; finite-sample statistics, delayed noise inference and per-basis drift monitoring remain untested.

Likely largely AI-generatedOverclaimsIncrementalStrong assumptionsPossible error

Central claim may not hold: The reported zero-detection results are finite-sample observations and do not establish the abstract's claim of unchanged detection risk. The E91 dynamic-programming rounding bracket does not control the error introduced by discretising the continuous noise process, so it is not a certified upper bound for the stated continuous-noise model. Proposition 1 incorrectly claims that every zero-detection policy outperforms the best fixed circuit, whereas this follows only for the optimal adaptive policy. The BB84 noise process permits positive-probability trajectories on which even the best recovery cannot meet the abort threshold, making its exact zero-detection optimisation infeasible and invalidating the claimed finite optimum under that constraint.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
Presented as submission 202 at QCrypt 2026 qcrypt.net/2026/technical/accepted-papers/. A parallel work exploring the machine-learning aspects of this approach, titled "Sparsity for Free: A Budget-Induced Equilibrium in Joint Topology-Parameter Search'', has been accepted for NeurIPS 2026

Related papers

Six-State Quantum Key Distribution Eavesdropping Attacks as a Quantum Machine Learning Task

Sotel-Jackson, Jacob

Many modern classical encryption schemes, based on computational complexity, are threatened by quantum computers. Quantum Key Distribution (QKD) aims to address this threat, with security enforced by quantum-mechanical principles. The security of QKD protocols, like the six-state protocol (6QKD), relies on understanding all possible eavesdropping attacks. The optimal known individual eavesdropping attack on 6QKD in a noiseless channel is the Universal Quantum Cloning Machine (UQCM). However, the utility of quantum machine learning (QML) for QKD eavesdropping analysis is largely unexplored. The recent work by Decker et al. (2025) used QML to find new attacks on the four-state BB84 protocol, but this methodology has not yet been generalized to the more complex 6QKD protocol. This thesis generalizes the quantum circuit (QCL) learning framework to analyze individual eavesdropping attacks on 6QKD. We designed a parameterized quantum circuit (ansatz) appropriate for 6QKD, notably adapting our circuit to two ancilla, and expanding the measurement strategy to three bases. We used QCL to find the optimal attack parameters in a simulated noiseless, asymmetric (bit-flip, phase-flip), and symmetric (depolarizing) noise channels. In the noiseless quantum channel, the QCL successfully converges to and reproduces the theoretical performance of the UQCM, validating the adapted methodology. In the asymmetric bit-flip and phase-flip noise channels, the QCL discovers a novel "imbalanced cloner" attack that outperforms the standard UQCM in average fidelity. The model learns to exploit the noise asymmetry by sacrificing the fidelity in the degraded bases and gaining higher fidelity in the unaffected basis. In a symmetric depolarizing noise channel, the QCL performance converges exactly to the UQCM, demonstrating it finds no exploitable noise asymmetry. This work provides the first QCL-based security analysis of the 6QKD protocol. We demonstrate that the QCL is a generalizable tool for quantum security analysis. Furthermore, we present the first (to our knowledge) evidence of a 6QKD "imbalanced cloner" that outperforms UQCM in asymmetric noisy environments.

•Dec 5, 2025•0 citations

Adversarial Reinforcement Learning for Adaptive Eavesdropping in BB84 Quantum Key Distribution

Ramon Jose C. Bagunu

BB84 quantum key distribution derives its security from a physical guarantee that any eavesdropper disturbs the channel in a statistically detectable way. Prior work evaluates this by assuming Eve attacks at a fixed, analytically optimized rate. We examine what happens when Eve is modeled instead as a learning agent. Classical reinforcement learning is used, specifically tabular Q-Learning, SARSA, and Double Q-Learning, to adaptive BB84 eavesdropping. This formulates the attacker's decision as a Markov Decision Process where the agent observes Quantum Bit Error Rate (QBER) feedback and decides, qubit by qubit, whether to intercept or pass. Experiments span three channel noise levels ($μ_{ch}\in\{1\%,3\%,5\%\}$) and are validated across five independent random seeds (45 training runs per condition, 10,000 episodes each). Against the best non-adaptive analytical baseline, Q-Learning reduces detection from $99.4\%$ to $0.28\%\pm0.27\%$ at $μ_{ch}=1\%$ while extracting approximately 10.5 correct bits per episode. This is a 355-fold reduction that is statistically significant ($p=0.020$, Mann-Whitney $U$ test). We also report the spontaneous emergence of an end-game burst, where agents independently learn to surge their attack rate at the final block. This exploit vanishes under randomized checkpoint intervals while stealth performance remains statistically indistinguishable. These results motivate the inclusion of adaptive adversary baselines in quantum cryptographic security evaluations.

quant-pharXiv:2606.22962•Quantum Information Processing•Jun 23, 2026•4 citations

No Convergence in Learned Eavesdropping-Detection Dynamics for BB84 Quantum Key Distribution

Ramon Jose C. Bagunu

In prior work we showed that a reinforcement-learning eavesdropper can intercept BB84 quantum key distribution while holding the quantum bit error rate below the abort threshold and keeping a usable distillable key. In this paper we ask whether an equally adaptive learning detector can close this stealth window. We cast the interaction as an alternating best-response game between a tabular eavesdropper and a tabular threshold-adapting detector. We measure exploitability, which is the detection rate and distillable key fraction achieved by a fresh attacker best-responding to the final detector. Across three learning rules (Q-Learning, SARSA, Double Q-Learning), three channel-noise levels, and a uniform false-alarm discipline, the dynamics do not settle out to twenty rounds. The exploitability does not approach a fixed point, and its round-to-round swings do not decay. Two controls, one retraining the attacker against a frozen defender and one retraining the defender against a frozen attacker, show that the swings on each side match the variance of the best-response procedure itself. The dynamics fluctuate at the scale of best-response variance rather than converging, with neither player settling to a fixed response. The behavior is noise-dependent, and the stealth window stays open at the low noise where practical QKD operates. The defender contains the attacker on average at intermediate noise without the contest settling, and at high noise the channel rather than the learned policy suppresses the attack. As a candidate mechanism we examine a last-mover information asymmetry, supported by significant anti-persistence at intermediate noise and consistent with best-response noise at low noise. The results suggest that a learned detector cannot be certified from any single round, and that closing the window calls for breaking the information structure rather than out-adapting the attacker.

arXiv:2611.16372•Nov 12, 2026•0 citations

Noise adaptive two-way secure deterministic quantum key distribution

Abinash Kar, Ayan Patra, Aditi Sen De +1 more

We introduce noise-adaptive quantum key distribution (QKD) protocols, in which the honest parties optimize the encoding (state preparation) and decoding (measurement basis) operations according to the noise models affecting the honest subsystems induced by an eavesdropper. This extends conventional QKD schemes that employ fixed encoding and decoding strategies independent of the noise characteristics of the communication channel. We investigate three representative protocols: entanglement-based secure dense coding (SDC), the entanglement-free Lucamarini and Mancini (LM05), and a two-way prepare-and-measure Bennett Brassard (BB84) protocols. Using entropic uncertainty relations, we derive the corresponding secret key rates for both adaptive and conventional non-adaptive scenarios under collective attacks. For independent but identical noise acting on the forward and backward transmission channels, as well as for correlated and non-Markovian environments, we identify classes of channels for which adaptive schemes yield enhanced secret key rates for the considered protocols. In contrast, we also determine Pauli channels, including depolarizing and bit flip channels, for which adaptive strategies provide no benefit. We further show that these optimal sets are generally non-unique and can differ substantially from the unitaries that maximize dense-coding capacity in the absence of security constraints. Our results establish noise-adaptive encoding and decoding as a powerful framework for improving secure communication over realistic noisy quantum channels.

quant-pharXiv:2605.27902•May 28, 2026•0 citations

Impact of Channel Noise and Intercept—Resend Eavesdropping Attack on BB84 Quantum Key Distribution

Nitesh Kumar Rijwani, Brijesh Kumar Chaurasia

Quantum key distribution (QKD) offers information-theoretic security grounded in the laws of quantum mechanics, with the BB84 protocol serving as the canonical reference due to its operational simplicity and provable security. However, practical deployments face two concurrent — threats channel decoherence and active eavesdropping whose combined impact on protocol viability has been characterized only in isolation by prior literature. This paper presents a joint circuitlevel analysis of BB84 under composite channel noise and partial intercept-resend attacks, implemented on the Qiskit Aer simulator across five qubit configurations (9, 12, 16, 20, and 50 qubits) with 1024 measurement shots per experiment. A composite noise model combining depolarizing noise, amplitude damping, and readout errors is coupled with a probabilistic eavesdropper whose interception fraction ($\alpha$) is systematically varied. We derive a closed-form joint QBER expression, whose non-additive coupling term quantifies how channel corruption partially masks eavesdropping signatures, and we analytically recover the 11% security threshold from the Devetak–Winter bound. Parameter sweeps across noise strength and interception fraction reveal that even modest eavesdropping under realistic noise breaches the threshold. At$\alpha=0. 2 5$and$50$qubits, the observed QBER reaches 19.05%, producing a negative secure key rate and Cascade reconciliation failure. These findings establish concrete design constraints on channel quality, transmission scale, and post-processing primitives for practical BB84 deployments.

International Conference on Computational Intelligence and Communication Networks (CICN)•Jun 12, 2026•0 citations

Security of Bennett–Brassard 1984 Quantum-Key Distribution under a Collective-Rotation Noise Channel

Mhlambululi Mafu, Comfort Sekga, Makhamisa Senekane

The security analysis of the Ekert 1991 (E91), Bennett 1992 (B92), six-state protocol, Scarani–Acín–Ribordy–Gisin 2004 (SARG04) quantum key distribution (QKD) protocols, and their variants have been studied in the presence of collective-rotation noise channels. However, besides the Bennett–Brassard 1984 (BB84) being the first proposed, extensively studied, and essential protocol, its security proof under collective-rotation noise is still missing. Thus, we aim to close this gap in the literature. Consequently, we investigate how collective-rotation noise channels affect the security of the BB84 protocol. Mainly, we study scenarios where the eavesdropper, Eve, conducts an intercept-resend attack on the transmitted photons sent via a quantum communication channel shared by Alice and Bob. Notably, we distinguish the impact of collective-rotation noise and that of the eavesdropper. To achieve this, we provide rigorous, yet straightforward numerical calculations. First, we derive a model for the collective-rotation noise for the BB84 protocol and parametrize the mutual information shared between Alice and Eve. This is followed by deriving the quantum bit error rate (QBER) for two intercept-resend attack scenarios. In particular, we demonstrate that, for small rotation angles, one can extract a secure secret key under a collective-rotation noise channel when there is no eavesdropping. We observe that noise induced by rotation of 0.35 radians of the prepared quantum state results in a QBER of 11%, which corresponds to the lower bound on the tolerable error rate for the BB84 QKD protocol against general attacks. Moreover, a rotational angle of 0.53 radians yields a 25% QBER, which corresponds to the error rate bound due to the intercept-resend attack. Finally, we conclude that the BB84 protocol is robust against intercept-resend attacks on collective-rotation noise channels when the rotation angle is varied arbitrarily within particular bounds.

Photonics•Dec 6, 2022•13 citations
Quantum key distribution (QKD) links are provisioned from security analyses of stationary channels, whereas the devices that determine the channel drift between recalibrations. Whether an eavesdropper who cannot alter the channel's own noise gains by following that drift has not been quantified. Adaptive eavesdropping is posed here as a constrained Markov decision process in which the attacker selects one circuit per round while the noise level follows an Ornstein--Uhlenbeck process and the abort condition is a budget over each block of rounds. The value of adaptation is bounded by the best fixed circuit and a dynamic-programming upper bound. The actions are learnt attacks. Whereas Decker et al. trained a parametrised circuit on a fixed gate template against a fixed channel, here the gate structure and rotation angles are searched jointly. This yields circuits compact enough to form a discrete action set, extending the construction to noise models lacking a known template, including the amplitude damping channel. On device-independent E91 under bilateral depolarising noise, a reinforcement-learning attacker raises her Holevo information from 0.1350.1350.135 for the best fixed circuit to 0.3480.3480.348 at zero detection, 98%98\%98% of the upper bound. On BB84 under a drifting bit-flip channel, she exceeds a conservative noise-indexed rule by 0.0240.0240.024 in fidelity, reaching 99%99\%99% of the upper bound. Under stationary noise, the attacker's gain from basis asymmetry changes sign between an averaged and a per-basis error-rate constraint. The search, started from random gate sequences, recovers the analytical cloners and the collective-attack key rate, and meets the lower bound of the Winick--Lütkenhaus--Coles objective from above.
The paper asks how much an eavesdropper gains by adapting to channel drift when the channel noise is trusted and cannot be controlled by the attacker. This concerns restricted-attacker provisioning margins, not a failure of security proofs that attribute all observed noise to Eve and accommodate adaptive attacks.
An evolutionary search jointly optimises circuit topology and rotation angles, producing attack libraries for BB84 and CHSH-based E91. Circuit selection is formulated as a constrained sequential decision problem: noise follows a clipped Ornstein–Uhlenbeck process, and abort statistics are averaged over 50-round episodes. Reinforcement-learning policies are compared with fixed circuits, greedy selection and dynamic programming over the library.
For E91 with bilateral depolarising noise, the adaptive policy achieves Holevo information 0.34840.34840.3484 versus 0.1350.1350.135 for the best fixed circuit, with no detections observed in evaluation; the library dynamic-programming value is approximately 0.356±0.0010.356\pm0.0010.356±0.001. Greedy selection reaches 0.35070.35070.3507. For BB84, adaptation raises recovery fidelity from 0.71970.71970.7197 for a conservative noise-indexed rule to 0.74340.74340.7434, matching greedy selection, against a dynamic-programming value of 0.75270.75270.7527. Stationary tests recover known cloning trade-offs and collective-attack rates, and show that the sign of the basis-asymmetry advantage depends on averaged versus per-basis monitoring.
The stated limitations include asymptotic detection statistics, perfect knowledge of current noise, bounded quantum memories and finite circuit libraries. BB84 drift tests use basis-averaged monitoring and a different noise placement from the stationary tests. Constructed attacks provide lower bounds on attacker capability, not security certificates; finite-sample statistics, delayed noise inference and per-basis drift monitoring remain untested.
Many modern classical encryption schemes, based on computational complexity, are threatened by quantum computers. Quantum Key Distribution (QKD) aims to address this threat, with security enforced by quantum-mechanical principles. The security of QKD protocols, like the six-state protocol (6QKD), relies on understanding all possible eavesdropping attacks. The optimal known individual eavesdropping attack on 6QKD in a noiseless channel is the Universal Quantum Cloning Machine (UQCM). However, the utility of quantum machine learning (QML) for QKD eavesdropping analysis is largely unexplored. The recent work by Decker et al. (2025) used QML to find new attacks on the four-state BB84 protocol, but this methodology has not yet been generalized to the more complex 6QKD protocol. This thesis generalizes the quantum circuit (QCL) learning framework to analyze individual eavesdropping attacks on 6QKD. We designed a parameterized quantum circuit (ansatz) appropriate for 6QKD, notably adapting our circuit to two ancilla, and expanding the measurement strategy to three bases. We used QCL to find the optimal attack parameters in a simulated noiseless, asymmetric (bit-flip, phase-flip), and symmetric (depolarizing) noise channels. In the noiseless quantum channel, the QCL successfully converges to and reproduces the theoretical performance of the UQCM, validating the adapted methodology. In the asymmetric bit-flip and phase-flip noise channels, the QCL discovers a novel "imbalanced cloner" attack that outperforms the standard UQCM in average fidelity. The model learns to exploit the noise asymmetry by sacrificing the fidelity in the degraded bases and gaining higher fidelity in the unaffected basis. In a symmetric depolarizing noise channel, the QCL performance converges exactly to the UQCM, demonstrating it finds no exploitable noise asymmetry. This work provides the first QCL-based security analysis of the 6QKD protocol. We demonstrate that the QCL is a generalizable tool for quantum security analysis. Furthermore, we present the first (to our knowledge) evidence of a 6QKD "imbalanced cloner" that outperforms UQCM in asymmetric noisy environments.
BB84 quantum key distribution derives its security from a physical guarantee that any eavesdropper disturbs the channel in a statistically detectable way. Prior work evaluates this by assuming Eve attacks at a fixed, analytically optimized rate. We examine what happens when Eve is modeled instead as a learning agent. Classical reinforcement learning is used, specifically tabular Q-Learning, SARSA, and Double Q-Learning, to adaptive BB84 eavesdropping. This formulates the attacker's decision as a Markov Decision Process where the agent observes Quantum Bit Error Rate (QBER) feedback and decides, qubit by qubit, whether to intercept or pass. Experiments span three channel noise levels (μch∈{1%,3%,5%}μ_{ch}\in\{1\%,3\%,5\%\}μch​∈{1%,3%,5%}) and are validated across five independent random seeds (45 training runs per condition, 10,000 episodes each). Against the best non-adaptive analytical baseline, Q-Learning reduces detection from 99.4%99.4\%99.4% to 0.28%±0.27%0.28\%\pm0.27\%0.28%±0.27% at μch=1%μ_{ch}=1\%μch​=1% while extracting approximately 10.5 correct bits per episode. This is a 355-fold reduction that is statistically significant (p=0.020p=0.020p=0.020, Mann-Whitney UUU test). We also report the spontaneous emergence of an end-game burst, where agents independently learn to surge their attack rate at the final block. This exploit vanishes under randomized checkpoint intervals while stealth performance remains statistically indistinguishable. These results motivate the inclusion of adaptive adversary baselines in quantum cryptographic security evaluations.
In prior work we showed that a reinforcement-learning eavesdropper can intercept BB84 quantum key distribution while holding the quantum bit error rate below the abort threshold and keeping a usable distillable key. In this paper we ask whether an equally adaptive learning detector can close this stealth window. We cast the interaction as an alternating best-response game between a tabular eavesdropper and a tabular threshold-adapting detector. We measure exploitability, which is the detection rate and distillable key fraction achieved by a fresh attacker best-responding to the final detector. Across three learning rules (Q-Learning, SARSA, Double Q-Learning), three channel-noise levels, and a uniform false-alarm discipline, the dynamics do not settle out to twenty rounds. The exploitability does not approach a fixed point, and its round-to-round swings do not decay. Two controls, one retraining the attacker against a frozen defender and one retraining the defender against a frozen attacker, show that the swings on each side match the variance of the best-response procedure itself. The dynamics fluctuate at the scale of best-response variance rather than converging, with neither player settling to a fixed response. The behavior is noise-dependent, and the stealth window stays open at the low noise where practical QKD operates. The defender contains the attacker on average at intermediate noise without the contest settling, and at high noise the channel rather than the learned policy suppresses the attack. As a candidate mechanism we examine a last-mover information asymmetry, supported by significant anti-persistence at intermediate noise and consistent with best-response noise at low noise. The results suggest that a learned detector cannot be certified from any single round, and that closing the window calls for breaking the information structure rather than out-adapting the attacker.
We introduce noise-adaptive quantum key distribution (QKD) protocols, in which the honest parties optimize the encoding (state preparation) and decoding (measurement basis) operations according to the noise models affecting the honest subsystems induced by an eavesdropper. This extends conventional QKD schemes that employ fixed encoding and decoding strategies independent of the noise characteristics of the communication channel. We investigate three representative protocols: entanglement-based secure dense coding (SDC), the entanglement-free Lucamarini and Mancini (LM05), and a two-way prepare-and-measure Bennett Brassard (BB84) protocols. Using entropic uncertainty relations, we derive the corresponding secret key rates for both adaptive and conventional non-adaptive scenarios under collective attacks. For independent but identical noise acting on the forward and backward transmission channels, as well as for correlated and non-Markovian environments, we identify classes of channels for which adaptive schemes yield enhanced secret key rates for the considered protocols. In contrast, we also determine Pauli channels, including depolarizing and bit flip channels, for which adaptive strategies provide no benefit. We further show that these optimal sets are generally non-unique and can differ substantially from the unitaries that maximize dense-coding capacity in the absence of security constraints. Our results establish noise-adaptive encoding and decoding as a powerful framework for improving secure communication over realistic noisy quantum channels.
Quantum key distribution (QKD) offers information-theoretic security grounded in the laws of quantum mechanics, with the BB84 protocol serving as the canonical reference due to its operational simplicity and provable security. However, practical deployments face two concurrent — threats channel decoherence and active eavesdropping whose combined impact on protocol viability has been characterized only in isolation by prior literature. This paper presents a joint circuitlevel analysis of BB84 under composite channel noise and partial intercept-resend attacks, implemented on the Qiskit Aer simulator across five qubit configurations (9, 12, 16, 20, and 50 qubits) with 1024 measurement shots per experiment. A composite noise model combining depolarizing noise, amplitude damping, and readout errors is coupled with a probabilistic eavesdropper whose interception fraction (α\alphaα) is systematically varied. We derive a closed-form joint QBER expression, whose non-additive coupling term quantifies how channel corruption partially masks eavesdropping signatures, and we analytically recover the 11% security threshold from the Devetak–Winter bound. Parameter sweeps across noise strength and interception fraction reveal that even modest eavesdropping under realistic noise breaches the threshold. Atα=0.25\alpha=0. 2 5α=0.25and505050qubits, the observed QBER reaches 19.05%, producing a negative secure key rate and Cascade reconciliation failure. These findings establish concrete design constraints on channel quality, transmission scale, and post-processing primitives for practical BB84 deployments.
The security analysis of the Ekert 1991 (E91), Bennett 1992 (B92), six-state protocol, Scarani–Acín–Ribordy–Gisin 2004 (SARG04) quantum key distribution (QKD) protocols, and their variants have been studied in the presence of collective-rotation noise channels. However, besides the Bennett–Brassard 1984 (BB84) being the first proposed, extensively studied, and essential protocol, its security proof under collective-rotation noise is still missing. Thus, we aim to close this gap in the literature. Consequently, we investigate how collective-rotation noise channels affect the security of the BB84 protocol. Mainly, we study scenarios where the eavesdropper, Eve, conducts an intercept-resend attack on the transmitted photons sent via a quantum communication channel shared by Alice and Bob. Notably, we distinguish the impact of collective-rotation noise and that of the eavesdropper. To achieve this, we provide rigorous, yet straightforward numerical calculations. First, we derive a model for the collective-rotation noise for the BB84 protocol and parametrize the mutual information shared between Alice and Eve. This is followed by deriving the quantum bit error rate (QBER) for two intercept-resend attack scenarios. In particular, we demonstrate that, for small rotation angles, one can extract a secure secret key under a collective-rotation noise channel when there is no eavesdropping. We observe that noise induced by rotation of 0.35 radians of the prepared quantum state results in a QBER of 11%, which corresponds to the lower bound on the tolerable error rate for the BB84 QKD protocol against general attacks. Moreover, a rotational angle of 0.53 radians yields a 25% QBER, which corresponds to the error rate bound due to the intercept-resend attack. Finally, we conclude that the BB84 protocol is robust against intercept-resend attacks on collective-rotation noise channels when the rotation angle is varied arbitrarily within particular bounds.