Computational Complexity of Continuous Variable Quantum Key Distribution
arXiv:quant-ph/0602019 · doi:10.1109/TIT.2008.921889
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.
References in corpus (17)
- Continuous variable quantum cryptography using coherent states
- Quantum key distribution using gaussian-modulated coherent states
- Quantum Cryptography without Switching
- Quantum cryptography with squeezed states
- Continuous Variable Quantum Cryptography - beating the 3 dB loss limit
- Secure quantum key distribution using squeezed states
- No-Switching Quantum Key Distribution using Broadband Modulated Coherent Light
- Reconciliation of a Quantum-Distributed Gaussian Key
- Intrinsic-Stabilization Uni-Directional Quantum Key Distribution Between Beijing and Tianjin
- Quantum cryptography with a predetermined key, using continuous variable Einstein-Podolsky-Rosen correlations
- Quantum key distribution with bright entangled beams
- Quantum cryptography using balanced homodyne detection
- Controlling excess noise in fiber optics continuous variables quantum key distribution
- Efficiency of coherent state quantum cryptography in the presence of loss: Influence of realistic error correction
- A practical limitation for continuous-variable quantum cryptography using coherent states
- Reverse reconciliation protocols for quantum cryptography with continuous variables
- Security of Quantum Key Distribution with Coherent States and Homodyne Detection