CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◌ Quantum Computing Mar 25, 2026

Performance of BB84 without decoy states under varying announcement structures

arXiv Quantum Archived Mar 25, 2026 ✓ Full text saved

arXiv:2603.22448v1 Announce Type: new 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 performa

Full text archived locally
✦ AI Summary · Claude Sonnet


    Quantum Physics [Submitted on 23 Mar 2026] Performance of BB84 without decoy states under varying announcement structures Zhiyao Wang, Aodhán Corrigan, Norbert Lütkenhaus 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. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2603.22448 [quant-ph]   (or arXiv:2603.22448v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2603.22448 Focus to learn more Submission history From: Zhiyao Wang [view email] [v1] Mon, 23 Mar 2026 18:17:53 UTC (973 KB) Access Paper: HTML (experimental) view license Current browse context: quant-ph < prev   |   next > new | recent | 2026-03 References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
    💬 Team Notes
    Article Info
    Source
    arXiv Quantum
    Category
    ◌ Quantum Computing
    Published
    Mar 25, 2026
    Archived
    Mar 25, 2026
    Full Text
    ✓ Saved locally
    Open Original ↗