Second-order characterizations via partial smoothing
File(s)
Accepted version
Author(s)
Anshu, Anurag
Berta, Mario
Jain, Rahul
Tomamichel, Marco
Type
Conference Paper
Abstract
Smooth entropies are a tool for quantifying resource trade-offs in information theory and cryptography. However, in typical multi-partite problems 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. As a consequence, we can derive 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.
Date Issued
2019-09-26
Date Acceptance
2019-04-01
Citation
2019 IEEE International Symposium on Information Theory (ISIT), 2019, pp.937-941
Publisher
IEEE
Start Page
937
End Page
941
Journal / Book Title
2019 IEEE International Symposium on Information Theory (ISIT)
Copyright Statement
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Identifier
https://ieeexplore.ieee.org/document/8849622
Source
2019 IEEE International Symposium on Information Theory (ISIT)
Publication Status
Published
Start Date
2019-07-07
Finish Date
2019-07-12
Coverage Spatial
Paris, France
Date Publish Online
2019-09-26