COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Partially smoothed information measures
Partially smoothed information measuresAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact INI IT. MQIW05 - Beyond I.I.D. in information theory Smooth entropies are a tool for quantifying resource trade-offs in (quantum) information theory and cryptography. In typical bi- and multi-partite problems, however, some of the sub-systems are often left unchanged and this is not reflected by the standard smoothing of information measures over a ball of close states. We propose to smooth instead only over a ball of close states which also have some of the reduced states on the relevant sub-systems fixed. This partial smoothing of information measures naturally allows to give more refined characterizations of various information-theoretic problems in the one-shot setting. In particular, we immediately get asymptotic second-order characterizations for tasks such as privacy amplification against classical side information or classical state splitting. For quantum problems like state merging the general resource trade-off is tightly characterized by partially smoothed information measures as well. However, for quantum systems we can so far only give the asymptotic first-order expansion of these quantities. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsM&EM: The Medieval & Early Modern Workshop Skewness, Heavy Tails, Market Crashes, and Dynamics Winton Programme for the Physics of SustainabilityOther talks39th Cambridge Epigenetics Seminar Parallel Reality Displays Babraham Distinguished Lecture - Endoplasmic reticulum turnover via selective autophagy A characterisation of the Gaussian free field Random walk on random planar maps III |