Equivalence of three classical algorithms with quantum side information: Privacy amplification, error correction, and data compression

Abstract

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.

16 pages, 5 figures. v2: Comparison with the previous literature added, presentation improved, typos corrected

References in corpus (8)

• Leftover Hashing Against Quantum Side Information
• Upper bounds of eavesdropper's performances in finite-length code with decoy method
• Physical Underpinnings of Privacy
• Duality of privacy amplification against quantum adversaries and data compression with quantum side information
• Non-Asymptotic Classical Data Compression with Quantum Side Information
• Leftover hashing from quantum error correction: Unifying the two approaches to the security proof of quantum key distribution
• Complementarity, distillable secret key, and distillable entanglement
• Duality between source coding with quantum side information and c-q channel coding