Paper ID | Q.6.3 | ||
Paper Title | Strong Converse Bounds in Quantum Network Information Theory | ||
Authors | Hao-Chung Cheng, Nilanjana Datta, University of Cambridge, United Kingdom; Cambyse Rouzé, Technische Universität München, Germany | ||
Session | Q.6: Quantum Networks | ||
Presentation | Lecture | ||
Track | Quantum Systems, Codes, and Information | ||
Manuscript | Click here to download the manuscript | ||
Virtual Presentation | Click here to watch in the Virtual Symposium | ||
Abstract | In this paper, we develop the first method for finding strong converse bounds in quantum network information theory. The general scheme relies on a recently obtained result in the field of non-commutative functional inequalities, namely the tensorization property of quantum reverse hypercontractivity for the quantum depolarizing semigroup, and properties of the projectively measured R\'enyi relative entropies. We develop a novel technique to employ this result to find both finite blocklength and exponential strong converse bounds for the tasks of distributed quantum hypothesis testing with communication constraints for a classical-quantum state, quantum source coding with compressed classical side information, and classical-quantum degraded broadcast channel coding. |
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia