2015/04/27 by Naresh Sharma, Sharma, Naresh
Computer Science · Physics and Astronomy · #FOS: Computer and information sciences #FOS: Physical sciences #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.1504.07075
openalex publication_date 2015/04/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A missing piece in quantum information theory, with very few exceptions, has been to provide the random coding exponents for quantum information-processing protocols. We remedy the situation by providing these exponents for a variety of protocols including those at the top of the family tree of protocols. Our line of attack is to provide an exponential bound on the decoupling error for a restricted class of completely positive maps where a key term in the exponent is in terms of a Rényi α-information-theoretic quantity for any α∈ (1,2]. Among the protocols covered are fully quantum Slepian-Wolf, quantum state merging, quantum state redistribution, quantum/classical communication across channels with side information at the transmitter with or without entanglement assistance, and quantum communication across broadcast channels.