Pith. sign in

REVIEW 1 cited by

Finite-key analysis on the 1-decoy state QKD protocol

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 1801.03443 v2 pith:TYYAAWY5 submitted 2018-01-10 quant-ph

Davide Rusca , Alberto Boaron , Fadri Grünenfelder , Anthony Martin , Hugo Zbinden This is my paper · ORCID
classification quant-ph
keywords decoyprotocolstateanalysisfinite-keypracticalachievesalmost
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

It has been shown that in the asymptotic case of infinite-key length the 2-decoy state QKD protocol outperforms the 1-decoy state protocol. Here, we present a finite-key analysis of the 1-decoy method. Interestingly, we find that for practical block sizes of up to $10^8$ bits, the 1-decoy protocol achieves for almost all experimental settings higher secret key rates than the 2-decoy protocol. Since using only one decoy is also easier to implement, we conclude that it is the best choice for practical QKD.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Security proofs for practical QKD: variations, techniques, gaps, and limitations

    quant-ph 2025-02 accept novelty 6.0 of 10

    A critical review of decoy-state BB84 security proofs identifies common gaps and shows that no current proof meets the full standard of completeness, modularity, and verifiability.

Pith tools