Dynamical decoupling (DD) is often assumed to improve quantum key distribution performance, but its benefit depends critically on the temporal correlation structure of the dephasing noise it is meant to suppress. This paper develops a Stim-based stochastic simulator for the BB84 protocol that isolates this dependence under a controlled, reproducible pipeline. The simulator maps fiber attenuation, distance-dependent depolarization, detector dark counts, and memory dephasing into stabilizer-compatible Pauli error channels, using Stim’s Clifford backend for efficient large-scale Monte Carlo sampling. Under a phenomenological residual-time model of quasi-static dephasing, CPMG-inspired pulse sequences reduce QBER from 4.32% to 2.41% at 49 km and increase the asymptotic secret fraction from 0.489 to 0.676 bits per sifted bit. Under an independent-increment Markovian limit, the same pulse sequences leave QBER and secret fraction statistically unchanged, because reversing pulse signs does not reduce the accumulated phase variance. Detector dark counts are modeled separately as a Bernoulli noise floor that memory control cannot mitigate. All results are reported as means with standard errors over K = 50 independent Monte Carlo repetitions. The reported secret fractions represent idealized asymptotic performance benchmarks under an honest-channel noise model and do not constitute complete composable security guarantees; the study does not model an active eavesdropper or decoy states. Its contribution is a reproducible simulation framework showing, with concrete numbers, that DD effectiveness in BB84 is conditional on noise correlation assumptions rather than an intrinsic property of the pulse sequence.
Dynamical decoupling (DD) is often assumed to improve quantum key distribution performance, but its benefit depends critically on the temporal correlation structure of the dephasing noise it is meant to suppress. This paper develops a Stim-based stochastic simulator for the BB84 protocol that isolates this dependence under a controlled, reproducible pipeline. The simulator maps fiber attenuation, distance-dependent depolarization, detector dark counts, and memory dephasing into stabilizer-compatible Pauli error channels, using Stim’s Clifford backend for efficient large-scale Monte Carlo sampling. Under a phenomenological residual-time model of quasi-static dephasing, CPMG-inspired pulse sequences reduce QBER from 4.32% to 2.41% at 49 km and increase the asymptotic secret fraction from 0.489 to 0.676 bits per sifted bit. Under an independent-increment Markovian limit, the same pulse sequences leave QBER and secret fraction statistically unchanged, because reversing pulse signs does not reduce the accumulated phase variance. Detector dark counts are modeled separately as a Bernoulli noise floor that memory control cannot mitigate. All results are reported as means with standard errors over K = 50 independent Monte Carlo repetitions. The reported secret fractions represent idealized asymptotic performance benchmarks under an honest-channel noise model and do not constitute complete composable security guarantees; the study does not model an active eavesdropper or decoy states. Its contribution is a reproducible simulation framework showing, with concrete numbers, that DD effectiveness in BB84 is conditional on noise correlation assumptions rather than an intrinsic property of the pulse sequence.
Decoherence is a primary barrier to practical quantum computation, causing quantum states to degrade through phase randomization and irreversible energy relaxation. This study presents a simulation-based evaluation of echo-based dynamical decoupling (DD) pulse sequences as a software-level mitigation strategy in single-qubit systems. Using the Qiskit Aer density matrix simulator, four strategies—baseline, Hahn Echo, Carr-Purcell-Meiboom-Gill (CPMG), and Mixed Synchronization—were evaluated across low-frequency phase noise, high-frequency phase noise, and combined T₁ + T₂ noise regimes. Hahn Echo restored mean fidelity to 100.00% under low-frequency noise (baseline: 57.90%), while CPMG achieved 97.62% under high-frequency noise (baseline: 2.45%). Under combined noise, all strategies showed limited improvement, with Mixed-Sync reaching 65.34% versus 60.95%. Coefficient of variation (CV) analysis across 500 Monte Carlo trials showed that CPMG reduced purity-decay variance threefold under high-frequency noise, with bootstrap confidence intervals confirming statistical significance. Time-resolved analysis showed that CPMG suppressed variance growth throughout evolution, reducing variance growth from +267% (baseline) to +89%, while baseline and Hahn Echo exhibited progressive amplification of variance. These results show that dynamical decoupling influences the temporal structure of noise, not just mean fidelity. In T₂-dominated regimes, pulse sequences constrain variability; in mixed regimes, they partially shape it; and in T₁-dominated regimes, both mean performance and variability converge to hardware-limited behavior. DD effectively corrects reversible phase errors but cannot overcome irreversible T₁ loss, with implications for NISQ circuit design.
This study establishes a statistically rigorous and fully reproducible Monte Carlo bench- mark for the BB84 quantum key distribution (QKD) protocol under symmetric depolarizing channel noise. We implement a transparent, parameterized simulator to conduct extensive noise sweeps from p = 0% to p = 26% depolarizing probability. Through large-scale trials, each processing 104 signals with 10 independent repetitions, we generate statistically robust mean Quantum Bit Error Rate (QBER) and Shor-Preskill secure key rates, complete with 95% confidence intervals. Our results validate the fundamental Q p/2 relationship with a maximum deviation from theory of 0.27% and quantify the sharp security threshold collapse. At p = 10% (QBER ≈ 5%), we achieve an ideal asymptotic key rate of RQKD ≈ 0.427 per sifted bit, while the secure fraction becomes negligible beyond p = 22% (QBER ≈ 11%). The empirically determined threshold, where the secure key rate vanishes at pth 0.22, aligns closely with theoretical predictions. This work’s primary contribution is a validated computational framework that serves as an essential benchmark and a computational null hypothesis against which to quantify performance deviations in practical QKD systems aris- ing from reconciliation inefficiency, finite-key effects, and device imperfections, thus bridging a critical gap between asymptotic security theory and the engineering of real-world quantum networks.
Abstract Dynamical decoupling (DD) is a quantum error-mitigation technique based on applying sequences of control pulses to suppress decoherence. Here we perform a numerical study to compare different DD protocols, namely Carr-Purcell-Meiboom-Gill (CPMG), Periodic Dynamical Decoupling (PDD), Concatenated Dynamical Decoupling (CDD) and Uhrig Dynamical Decoupling (UDD) applied to three commonly used noise power spectral densities: (i) white, (ii) 1/f, (iii) 1/f 2 and their hybrid combinations. By ignoring qubit relaxation, we simulate these protocols focusing purely on dephasing noise. We then consider independent multi-axial noise with uniaxial control pulses. The effective coherence times T2,eff are extracted for each case and compared with the baseline free induction decay T ∗ 2 [6]. In all these simulations, the time-domain decoherence profiles follow a stretched exponential form ∼ exp −(t/T2,eff) β with the effective coherence times dependent on the noise spectrum considered, the strength of the noise, and the DD sequence employed. An exception is observed for the UDD under specific noise conditions where it cannot be described by a simple stretched exponential decay form.
Dynamical decoupling (DD) refers to a well-established family of methods for error mitigation, comprising pulse sequences aimed at averaging away slowly evolving noise in quantum systems. Here we revisit the question of its efficacy in the presence of noisy pulses in scenarios important for quantum devices today: pulses with gate control errors, and the computational setting where DD is used to reduce noise in every computational gate. We focus on the well-known schemes of periodic (or universal) DD and its extension, concatenated DD, for scaling up its power. The qualitative conclusions from our analysis of these two schemes nevertheless apply to other DD approaches. In the presence of noisy pulses, DD does not always mitigate errors. It does so only when the added noise from the imperfect DD pulses does not outweigh the increased ability in averaging away the original background noise. We present break-even conditions that delineate when DD is useful, and further find that there is a limit in the performance of concatenated DD, specifically in how far one can concatenate the DD pulse sequences before the added noise no longer offers any further benefit in error mitigation.
Decoy-state BB84 security proofs often assume fully phase-randomized coherent pulses, yet gain-switched semiconductor lasers exhibit parameter-dependent phase diffusion that leaves inter-pulse correlations. We present a unified source–channel model that maps measurable linewidth, pulse spacing, and intensity modulation to effective photon-number statistics and state overlaps, and integrate it into a finite-size, composable security analysis against general attacks. The resulting key-rate bounds depend explicitly on phase-noise parameters, revealing how residual phase memory tightens decoy estimates and increases privacy amplification. Simulations with 0.2 dB/km fiber loss, InGaAs APDs (10% efficiency, 6×10^−7 dark counts/gate), misalignment 5×10^−3, and 10^8–10^12 pulses show reach reductions of tens of km, while MHz linewidths enable secure 100–130 km operation at total security ≈10^−15.
Quantum error correction/detection (QEC/QED) and dynamical decoupling (DD) are tools for protecting quantum information. A natural goal is to combine them to outperform either approach alone. Such a benefit is not automatic: physical DD can conflict with encoded subspace, and QEC performance is governed by the errors that survive decoding, not just those DD suppresses. We analyze a hybrid memory cycle where DD is implemented logically (LDD) using normalizer elements of an [[n,k,d]] stabilizer code, followed by a round of syndrome measurement and recovery (or, in the detection setting, postselection on a trivial syndrome). In an effective Pauli model with physical error probability p, LDD suppression factor pDD, and recovery imperfection rate pQEC (or pQED), we derive closed-form entanglement-fidelity expressions for QEC-only, QED-only, LDD-only, physical DD, and the hybrid LDD+QEC protocol. The formulas are expressed via a small set of code-dependent weight enumerator polynomials, making the role of the decoder and the LDD group explicit. For ideal recovery LDD+QEC outperforms QEC-only iff the conditional fraction of uncorrectable Pauli errors is larger in the LDD-suppressed sector than in the unsuppressed sector. In the low-noise regime, a sufficient design rule guaranteeing hybrid advantage is that LDD suppresses at least one minimum-weight uncorrectable Pauli error for the chosen recovery map. We show how stabilizer-equivalent choices of LDD generators can enforce this condition. We supplement our analysis with numerical results for the [[7,1,3]] Steane code and a [[13,1,3]] code, mapping regions of hybrid-protocol advantage in parameter space beyond the small-p regime. Our work illustrates the need for co-design of the code, decoder, and logical decoupling group, and clarifies the conditions under which the hybrid LDD+QEC protocol is advantageous.