Asymptotically tight security analysis of quantum key distribution based on universal source compression

Abstract

Practical quantum key distribution (QKD) protocols require a finite-size security proof. The phase error correction (PEC) approach is one of the general strategies for security analyses that has successfully proved finite-size security for many protocols. However, the asymptotically optimal key rate cannot in general be achieved with the conventional PEC approach due to the reduction to the estimation problem of the classical quantity, the phase error rate. In this work, we propose a new PEC-type strategy that can provably achieve the asymptotically optimal key rate. The key piece for this is a virtual protocol based on the universal source compression with quantum side information, which is of independent interest. Combined with the reduction method to collective attacks, this enables us to directly estimate the phase error pattern rather than the estimation via the phase error rate, and thus leads to asymptotically tight analyses. As a result, the security of any permutation-symmetrizable QKD protocol gets reduced to the estimation problem of the single conditional R\'enyi entropy, which can be efficiently solved by a convex optimization.