Pith. sign in

REVIEW 1 cited by

Security of discrete-modulated continuous-variable quantum key distribution

Not yet reviewed by Pith; the record is open.

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 2303.09255 v4 pith:PO7SR3QV submitted 2023-03-16 quant-ph

classification quant-ph
keywords securitycoherentdistributionfinite-sizequantumattackscontinuousdiscrete
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Continuous variable quantum key distribution with discrete modulation has the potential to provide information-theoretic security using widely available optical elements and existing telecom infrastructure. While their implementation is significantly simpler than that for protocols based on Gaussian modulation, proving their finite-size security against coherent attacks poses a challenge. In this work we prove finite-size security against coherent attacks for a discrete-modulated quantum key distribution protocol involving four coherent states and heterodyne detection. To do so, and contrary to most of the existing schemes, we first discretize all the continuous variables generated during the protocol. This allows us to use the entropy accumulation theorem, a tool that has previously been used in the setting of discrete variables, to construct the finite-size security proof. We then compute the corresponding finite-key rates through semi-definite programming and under a photon-number cutoff. Our analysis provides asymptotic rates in the range of $0.1-10^{-4}$ bits per round for distances up to hundred kilometres, while in the finite case and for realistic parameters, we get of the order of $10$ Gbits of secret key after $n\sim10^{11}$ rounds and distances of few tens of kilometres.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Finite-size quantum key distribution rates from R\'enyi entropies using conic optimization

    quant-ph 2025-11 unverdicted novelty 7.0 of 10

    A general conic optimization solver computes finite-size QKD rates from Rényi entropies more reliably than prior Frank-Wolfe methods.

Pith tools