Equivalence of Three Classical Algorithms With Quantum Side Information: Privacy Amplification, Error Correction, and Data Compression

DOI10.1109/TIT.2021.3126160zbMATH Open1489.81022OpenAlexW3214095954WikidataQ114628637 ScholiaQ114628637MaRDI QIDQ5030342FDOQ5030342

Authors Toyohiro Tsurumaru

Publication date 17 February 2022

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2009.08823

zbMATH Keywords

algorithmsdata compression (DC)error correction (EC)privacy amplification (PA)security proof of quantum key distribution

Mathematics Subject Classification ID

Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)

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.

Cited in

(1)

• Duality of privacy amplification against quantum adversaries and data compression with quantum side information

This page was built for publication: Equivalence of Three Classical Algorithms With Quantum Side Information: Privacy Amplification, Error Correction, and Data Compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5030342)