2023/09/20 by Yuchen Shen, Gao Li, Shen, Yu-Chen +3
Computer Science · Engineering · Mathematics · #Computer science #Converse #Cryptography and Data Security #Discrete mathematics #Equivalence (formal languages) #Exponent #FOS: Physical sciences #Independent and identically distributed random variables #Mathematics #Physics #Quantum #Quantum Physics (quant-ph) #Quantum mechanics #Random variable #Statistics #Stochastic Gradient Optimization Techniques #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.2309.11073
published in arXiv (Cornell University) (Cornell University)
openalex publication_date 2023/09/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider privacy amplification against quantum side information by using regular random binning as an effective extractor. For constant-type sources, we obtain error exponent and strong converse bounds in terms of the so-called quantum Augustin information. Via type decomposition, we then recover the error exponent for independent and identically distributed sources proved by Dupuis [arXiv:2105.05342]. As an application, we obtain an achievable secrecy exponent for classical-quantum wiretap channel coding in terms of the Augustin information, which solves an open problem in [IEEE Trans.~Inf.~Theory, 65(12):7985, 2019]. Our approach is to establish an operational equivalence between privacy amplification and quantum soft covering; this may be of independent interest.