论文标题
具有量子侧信息的三种经典算法的等效性：隐私放大，错误校正和数据压缩
Equivalence of three classical algorithms with quantum side information: Privacy amplification, error correction, and data compression
论文作者
论文摘要
隐私放大（PA）是经典和量子密码学中必不可少的组成部分。在经典和量子信息理论中，误差校正（EC）和数据压缩（DC）算法也是必不可少的。在这里，我们在这里研究了这三种算法（PA，EC和DC），在量子侧信息的存在下，并证明它们在一次性场景中都变得相等。作为此等价的应用，我们采用了PA的先前已知的安全范围，并将其转化为EC和DC的编码定理，这些定理先前尚未获得。此外，我们将这些结果应用于简化和改善我们先前的结果，即两种普遍的量子键分布证明（QKD）的方法是等效的。我们还提出了一种简化QKD安全证明的新方法。
Privacy amplification (PA) is an indispensable component in classical and quantum cryptography. Error correction (EC) and data compression (DC) algorithms are also indispensable in classical and quantum information theory. We here study these three algorithms (PA, EC, and DC) in the presence of quantum side information, and show that they all become equivalent in the one-shot scenario. As an application of this equivalence, we take previously known security bounds of PA, and translate them into coding theorems for EC and DC which have not been obtained previously. Further, we apply these results to simplify and improve our previous result that the two prevalent approaches to the security proof of quantum key distribution (QKD) are equivalent. We also propose a new method to simplify the security proof of QKD.
