Equivalence of three classical algorithms with quantum side information: Privacy amplification, error correction, and data compression
arXiv:2009.08823 · doi:10.1109/TIT.2021.3126160
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.
arXiv comment16 pages, 5 figures. v2: Comparison with the previous literature added, presentation improved, typos corrected
References in corpus (24)
- Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
- Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances
- The operational meaning of min- and max-entropy
- Tight Finite-Key Analysis for Quantum Cryptography
- The Uncertainty Relation for Smooth Entropies
- Quantum random number generation
- Leftover Hashing Against Quantum Side Information
- Uncertainty relations from simple entropic properties
- Upper bounds of eavesdropper's performances in finite-length code with decoy method
- Classical data compression with quantum side information
- Concise and Tight Security Analysis of the Bennett-Brassard 1984 Protocol with Finite Key Lengths
- Relating different quantum generalizations of the conditional Renyi entropy
- More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function
- One-Shot Classical Data Compression with Quantum Side Information and the Distillation of Common Randomness or Secret Keys
- Physical Underpinnings of Privacy
- Privacy Amplification, Private States, and the Uncertainty Principle
- Dual universality of hash functions and its applications to quantum cryptography
- 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 of channels and codes
- On privacy amplification, lossy compression, and their duality to channel coding
- Duality between source coding with quantum side information and c-q channel coding