Abstract
AbstractThe rates of quantum cryptographic protocols are usually expressed in terms of a conditional entropy minimized over a certain set of quantum states. In particular, in the device-independent setting, the minimization is over all the quantum states jointly held by the adversary and the parties that are consistent with the statistics that are seen by the parties. Here, we introduce a method to approximate such entropic quantities. Applied to the setting of device-independent randomness generation and quantum key distribution, we obtain improvements on protocol rates in various settings. In particular, we find new upper bounds on the minimal global detection efficiency required to perform device-independent quantum key distribution without additional preprocessing. Furthermore, we show that our construction can be readily combined with the entropy accumulation theorem in order to establish full finite-key security proofs for these protocols.
Funder
Agence Nationale de la Recherche
Publisher
Springer Science and Business Media LLC
Subject
General Physics and Astronomy,General Biochemistry, Genetics and Molecular Biology,General Chemistry
Reference52 articles.
1. Bennett, C. H. & Brassard, G. Quantum cryptography: public key distribution and coin tossing. in Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing 175–179 (IEEE, New York, 1984).
2. Lydersen, L. et al. Hacking commercial quantum cryptography systems by tailored bright illumination. Nature Photonics 4, 686–689 (2010).
3. Mayers, D. & Yao, A. Quantum cryptography with imperfect apparatus. in Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS-98) 503–509 (IEEE Computer Society, Los Alamitos, CA, 1998).
4. Bell, J. S. On the Einstein-Podolsky-Rosen paradox. Physics 1, 195 (1964).
5. Masanes, L., Acín, A. & Gisin, N. General properties of nonsignaling theories. Phys. Rev. A 73, 012112 (2006).
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献