The fidelity of recovery is multiplicative

Berta, M; Tomamichel, M

The fidelity of recovery is multiplicative

Berta, M Tomamichel, M

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Information Theory, 2016, 62 (4), pp. 1758 - 1763
Issue Date:: 2016-04-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted ManuscriptAdobe PDF (427.19 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Berta, M	en_US
dc.contributor.author	Tomamichel, M https://orcid.org/0000-0001-5410-3329	en_US
dc.date.issued	2016-04-01	en_US
dc.identifier.citation	IEEE Transactions on Information Theory, 2016, 62 (4), pp. 1758 - 1763	en_US
dc.identifier.issn	0018-9448	en_US
dc.identifier.uri	http://hdl.handle.net/10453/90493
dc.description.abstract	© 1963-2012 IEEE. Fawzi and Renner recently established a lower bound on the conditional quantum mutual information (CQMI) of tripartite quantum states $ABC$ in terms of the fidelity of recovery (FoR), i.e., the maximal fidelity of the state $ABC$ with a state reconstructed from its marginal $BC$ by acting only on the $C$ system. The FoR measures quantum correlations by the local recoverability of global states and has many properties similar to the CQMI. Here, we generalize the FoR and show that the resulting measure is multiplicative by utilizing semi-definite programming duality. This allows us to simplify an operational proof by Brandão et al. of the above-mentioned lower bound that is based on quantum state redistribution. In particular, in contrast to the previous approaches, our proof does not rely on de Finetti reductions.	en_US
dc.relation.ispartof	IEEE Transactions on Information Theory	en_US
dc.relation.isbasedon	10.1109/TIT.2016.2527683	en_US
dc.subject.classification	Networking & Telecommunications	en_US
dc.title	The fidelity of recovery is multiplicative	en_US
dc.type	Journal Article
utslib.citation.volume	4	en_US
utslib.citation.volume	62	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	1005 Communications Technologies	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	open_access
pubs.issue	4	en_US
pubs.publication-status	Published	en_US
pubs.volume	62	en_US

Abstract:

© 1963-2012 IEEE. Fawzi and Renner recently established a lower bound on the conditional quantum mutual information (CQMI) of tripartite quantum states $ABC$ in terms of the fidelity of recovery (FoR), i.e., the maximal fidelity of the state $ABC$ with a state reconstructed from its marginal $BC$ by acting only on the $C$ system. The FoR measures quantum correlations by the local recoverability of global states and has many properties similar to the CQMI. Here, we generalize the FoR and show that the resulting measure is multiplicative by utilizing semi-definite programming duality. This allows us to simplify an operational proof by Brandão et al. of the above-mentioned lower bound that is based on quantum state redistribution. In particular, in contrast to the previous approaches, our proof does not rely on de Finetti reductions.

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

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