The Fidelity of Recovery is Multiplicative

Abstract

Fawzi and Renner [Commun. Math. Phys. 340(2):575, 2015] 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 Brandao et al. [Phys. Rev. Lett. 115(5):050501, 2015] 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.

v2: 9 pages, published version

References in corpus (11)

• Recoverability in quantum information theory
• Renyi generalizations of the conditional quantum mutual information
• On Variational Expressions for Quantum Relative Entropies
• Strengthened Monotonicity of Relative Entropy via Pinched Petz Recovery Map
• Universal recovery map for approximate Markov chains
• Reconstructing quantum states from local data
• Multipartite quantum correlations and local recoverability
• Operational meaning of quantum measures of recovery
• Quantum Information Complexity and Amortized Communication
• On the informational completeness of local observables
• Hierarchy of efficiently computable and faithful lower bounds to quantum discord

Cited by in corpus (30)

• Quantum Information Processing with Finite Resources -- Mathematical Foundations
• Recoverability in quantum information theory
• Multivariate Trace Inequalities
• Clustering of conditional mutual information for quantum Gibbs states above a threshold temperature
• On Variational Expressions for Quantum Relative Entropies
• Strengthened Monotonicity of Relative Entropy via Pinched Petz Recovery Map
• Semidefinite programming strong converse bounds for classical capacity
• On Composite Quantum Hypothesis Testing
• Amortization does not enhance the max-Rains information of a quantum channel
• Deconstruction and conditional erasure of quantum correlations
• Multipartite quantum correlations and local recoverability
• Conditional Decoupling of Quantum Information
• Approximate quantum Markov chains
• Operational meaning of quantum measures of recovery
• The Near-optimal Performance of Quantum Error Correction Codes
• Hierarchy of efficiently computable and faithful lower bounds to quantum discord
• Recovery and the Data Processing Inequality for quasi-entropies
• Quasi inversion of qubit channels
• Variational Quantum Algorithms for Trace Distance and Fidelity Estimation
• Necessary criterion for approximate recoverability
• Entanglement monogamy via multivariate trace inequalities
• Quasi-inversion of quantum and classical channels in finite dimensions
• Multivariate Trace Inequalities, p-Fidelity, and Universal Recovery Beyond Tracial Settings
• On quantum quasi-relative entropy
• Approximate broadcasting of quantum correlations
• Quantifying the unextendibility of entanglement
• Certifying optimality for convex quantum channel optimization problems
• Squashed quantum non-Markovianity: a measure of genuine quantum non-Markovianity in states
• Virtual Quantum Markov Chains
• Sample optimal tomography of quantum Markov chains