Computational Complexity of Continuous Variable Quantum Key Distribution

DOI10.1109/TIT.2008.921889zbMATH Open1328.94073arXivquant-ph/0602019MaRDI QIDQ3604530FDOQ3604530

Zheng-Fu Han, Guang-Can Guo, Yibo Zhao, You-Zhen Gui, Jinjian Chen

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/quant-ph/0602019

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Experimental work for problems pertaining to quantum theory (81-05)

This page was built for publication: Computational Complexity of Continuous Variable Quantum Key Distribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604530)