Second-Order Characterizations via Partial Smoothing

Anshu, A; Berta, M; Jain, R; Tomamichel, M

Second-Order Characterizations via Partial Smoothing

Anshu, A Berta, M Jain, R Tomamichel, M

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE International Symposium on Information Theory - Proceedings, 2019, 2019-July pp. 937 - 941
Issue Date:: 2019-07-01

Closed Access

	Filename	Description	Size
	Second-Order Characterizations via Partial Smoothing.pdf	Published version	271.09 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Anshu, A	en_US
dc.contributor.author	Berta, M	en_US
dc.contributor.author	Jain, R	en_US
dc.contributor.author	Tomamichel, M https://orcid.org/0000-0001-5410-3329	en_US
dc.date.issued	2019-07-01	en_US
dc.identifier.citation	IEEE International Symposium on Information Theory - Proceedings, 2019, 2019-July pp. 937 - 941	en_US
dc.identifier.isbn	9781538692912	en_US
dc.identifier.issn	2157-8095	en_US
dc.identifier.uri	http://hdl.handle.net/10453/138723
dc.description.abstract	© 2019 IEEE. 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.	en_US
dc.relation.ispartof	IEEE International Symposium on Information Theory - Proceedings	en_US
dc.relation.isbasedon	10.1109/ISIT.2019.8849622	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Second-Order Characterizations via Partial Smoothing	en_US
dc.type	Conference Proceeding
utslib.citation.volume	2019-July	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	closed_access	*
pubs.publication-status	Published	en_US
pubs.volume	2019-July	en_US

Abstract:

© 2019 IEEE. 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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/138723