Apply current exponential de Finetti theorem to realistic quantum key distribution

Abstract

In the realistic quantum key distribution (QKD), Alice and Bob respectively get a quantum state from an unknown channel, whose dimension may be unknown. However, while discussing the security, sometime we need to know exact dimension, since current exponential de Finetti theorem, crucial to the information-theoretical security proof, is deeply related with the dimension and can only be applied to finite dimensional case. Here we address this problem in detail. We show that if POVM elements corresponding to Alice and Bob's measured results can be well described in a finite dimensional subspace with sufficiently small error, then dimensions of Alice and Bob's states can be almost regarded as finite. Since the security is well defined by the smooth entropy, which is continuous with the density matrix, the small error of state actually means small change of security. Then the security of unknown-dimensional system can be solved. Finally we prove that for heterodyne detection continuous variable QKD and differential phase shift QKD, the collective attack is optimal under the infinite key size case.

11 pages, 2 figures, detailed version, applications added

References in corpus (10)

• Unconditional optimality of Gaussian attacks against continuous-variable QKD
• Quantum cryptography with finite resources: unconditional security bound for discrete-variable protocols with one-way post-processing
• Symmetry implies independence
• One-and-a-half quantum de Finetti theorems
• Squashing Models for Optical Measurements in Quantum Communication
• Security of Binary Modulated Continuous Variable Quantum Key Distribution under Collective Attacks
• Security proof for QKD systems with threshold detectors
• A Finite de Finetti Theorem for Infinite-Dimensional Systems
• Computational Complexity of Continuous Variable Quantum Key Distribution
• Security proof of differential phase shift quantum key distribution in the noiseless case

Cited by in corpus (5)

• A quantum network stack and protocols for reliable entanglement-based networks
• Machine learning for long-distance quantum communication
• Modular architectures for quantum networks
• Entanglement generation secure against general attacks
• Simple proof of confidentiality for private quantum channels in noisy environments