Pith. sign in

REVIEW 3 cited by

Proving security of BB84 under source correlations

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.12346 v2 pith:PGEAPMJB submitted 2024-02-12 quant-ph

Ashutosh Marwah , Frédéric Dupuis This is my paper · ORCID
classification quant-ph
keywords sourcecorrelationssecurityalmostbb84perfectprotocolproven
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Device imperfections and memory effects can result in undesired correlations among the states generated by a realistic quantum source. These correlations are called source correlations. Proving the security of quantum key distribution (QKD) protocols in the presence of these correlations has been a persistent challenge. We present a simple and general method to reduce the security proof of the BB84 protocol with source correlations to one with an almost perfect source, for which security can be proven using previously known techniques. For this purpose, we introduce a simple source test, which randomly tests the output of the QKD source and provides a bound on the source correlations. We then use the recently proven entropic triangle inequality for the smooth min-entropy to carry out the reduction to the protocol with the almost perfect source.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Universal chain rules from entropic triangle inequalities

    quant-ph 2024-12 conditional novelty 8.0 of 10

    A universal chain rule for the smooth min-entropy and an unstructured approximate entropy accumulation theorem are proven.

  2. Tighter Asymptotic Key Rates for Intensity-Correlated Decoy-State QKD via Nonlinear Programming

    quant-ph 2026-02 conditional novelty 6.0 of 10

    Using IPOPT solutions of the full nonlinear CS-constrained problems as linearization points yields tighter, still-valid asymptotic key-rate bounds for decoy-state QKD with intensity correlations.

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

    quant-ph 2025-07 conditional novelty 6.0 of 10

    A modular proof technique extends phase-error-estimation security bounds from basis-independent to mismatched detector efficiencies, enabling finite-key QKD security with simultaneous source and detector imperfections.

Pith tools