2017
DOI: 10.1088/1367-2630/aa54d7
|View full text |Cite
|
Sign up to set email alerts
|

On the problem of non-zero word error rates for fixed-rate error correction codes in continuous variable quantum key distribution

Abstract: The maximum operational range of continuous variable quantum key distribution protocols has shown to be improved by employing high-efficiency forward error correction codes. Typically, the secret key rate model for such protocols is modified to account for the non-zero word error rate of such codes. In this paper, we demonstrate that this model is incorrect: firstly, we show by example that fixed-rate error correction codes, as currently defined, can exhibit efficiencies greater than unity. Secondly, we show t… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 30 publications
0
2
0
Order By: Relevance
“…In the remainder of this review, we will restrict our analysis to the case of reverse reconciliation. Equation is valid for an ideal system; however, if we take into account that information reconciliation does not operate at the (asymptotic) Shannon limit, that a fraction of blocks (frames) will fail to reconcile, and that a fraction of the symbols is used for error estimation we obtain the asymptotic secure‐key fraction of a practical CV‐QKD system: truerightr coll asympt (1FER)(1ν)(βIABχEB)Here, FER[0,1] and β[0,1] represent the frame‐error rate and the efficiency of information reconciliation, respectively, and ν[0,1] is the fraction of the symbols which has to be disclosed in order to estimate the entries of the covariance matrix. The efficiency β measures how closely an information reconciliation method approaches the theoretical limit.…”
Section: Notions Of Security and Secure‐key Ratementioning
confidence: 99%
“…In the remainder of this review, we will restrict our analysis to the case of reverse reconciliation. Equation is valid for an ideal system; however, if we take into account that information reconciliation does not operate at the (asymptotic) Shannon limit, that a fraction of blocks (frames) will fail to reconcile, and that a fraction of the symbols is used for error estimation we obtain the asymptotic secure‐key fraction of a practical CV‐QKD system: truerightr coll asympt (1FER)(1ν)(βIABχEB)Here, FER[0,1] and β[0,1] represent the frame‐error rate and the efficiency of information reconciliation, respectively, and ν[0,1] is the fraction of the symbols which has to be disclosed in order to estimate the entries of the covariance matrix. The efficiency β measures how closely an information reconciliation method approaches the theoretical limit.…”
Section: Notions Of Security and Secure‐key Ratementioning
confidence: 99%
“…The unavoidable high level of channel excess noise is common in practical application of the CVQKD protocol [33], and its fluctuation will further lower the reconciliation efficiency. Moreover, a recent report [34] shows that the frame error rate [28,35,36] of the ECC may further restrict the real reconciliation efficiency.…”
Section: Introductionmentioning
confidence: 99%