pith. sign in

arxiv: quant-ph/0602019 · v5 · pith:MRZUVJBLnew · submitted 2006-02-01 · 🪐 quant-ph

Computational Complexity of Continuous Variable Quantum Key Distribution

classification 🪐 quant-ph
keywords secretcontinuoushighratevariablecomplexitycomputationaldistribution
0
0 comments X
read the original abstract

The continuous variable quantum key distribution has been considered to have the potential to provide high secret key rate. However, in present experimental demonstrations, the secret key can be distilled only under very small loss rates. Here, by calculating explicitly the computational complexity with the channel transmission, we show that under high loss rate it is hard to distill the secret key in present continuous variable scheme and one of its advantages, the potential of providing high secret key rate, may therefore be limited.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.