2019
DOI: 10.1002/dac.4152
|View full text |Cite
|
Sign up to set email alerts
|

Secret key rates of free‐space optical continuous‐variable quantum key distribution

Abstract: Summary In this letter, we derive the maximal achievable secret key rates for continuous‐variable quantum key distribution (CVQKD) over free‐space optical (FSO) quantum channels. We provide a channel decomposition for FSO‐CVQKD quantum channels and study the SNR (signal‐to‐noise ratio) characteristics. The analytical derivations focus particularly on the low‐SNR scenarios. The results are convenient for wireless quantum key distribution and for the quantum Internet.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
2

Relationship

4
3

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 46 publications
(197 reference statements)
0
4
0
Order By: Relevance
“…We denote the total number of non-zero entries in an LDPC matrix as G, and adopt the well-known Belief Propagation (BP) decoder [40] for error correction. We define the total number of arithmetic operations of SR as m−1 j=0 E j D j , where, for each S j , E j is the number of arithmetic operations executed within a decoding iteration, 9 and D j is the number of decoding iterations [41]. We note, in our GPU-based SR, E j and D j are different for the m slices of each block since m LDPC matrices are used to reconcile the m slices.…”
Section: Analysing the Computational Complexity Of Srmentioning
confidence: 99%
See 2 more Smart Citations
“…We denote the total number of non-zero entries in an LDPC matrix as G, and adopt the well-known Belief Propagation (BP) decoder [40] for error correction. We define the total number of arithmetic operations of SR as m−1 j=0 E j D j , where, for each S j , E j is the number of arithmetic operations executed within a decoding iteration, 9 and D j is the number of decoding iterations [41]. We note, in our GPU-based SR, E j and D j are different for the m slices of each block since m LDPC matrices are used to reconcile the m slices.…”
Section: Analysing the Computational Complexity Of Srmentioning
confidence: 99%
“…Note, for N R larger than approximately 10 5 , D j is independent of N R (a result we will adopt later). Assuming the Gaussian approximation within the Density Evolution Algorithm, D j is given by [42] 9 In a BP decoder, a decoding iteration is one pass through the decoding algorithm.…”
Section: Analysing the Computational Complexity Of Srmentioning
confidence: 99%
See 1 more Smart Citation
“…Although free-space CVQKD provides greater flexibility in transmission through atmospheric channels, its practical implementation is affected by the uncertainty of the atmospheric channel, and there are many outstanding issues to be addressed [4] The elliptical beam model is a commonly used model for analyzing the transmission performance of freespace CVQKD. During transmission, CVQKD signals are affected by atmospheric effects including atmospheric attenuation, turbulence, and other constraints, which can introduce additional noise to the signal.…”
Section: Introductionmentioning
confidence: 99%