Operational meaning of quantum measures of recovery

Abstract

Several information measures have recently been defined which capture the notion of "recoverability." In particular, the fidelity of recovery quantifies how well one can recover a system $A$ of a tripartite quantum state, defined on systems $ABC$, by acting on system $C$ alone. The relative entropy of recovery is an associated measure in which the fidelity is replaced by relative entropy. In this paper, we provide concrete operational interpretations of the aforementioned recovery measures in terms of a computational decision problem and a hypothesis testing scenario. Specifically, we show that the fidelity of recovery is equal to the maximum probability with which a computationally unbounded quantum prover can convince a computationally bounded quantum verifier that a given quantum state is recoverable. The quantum interactive proof system giving this operational meaning requires four messages exchanged between the prover and verifier, but by forcing the prover to perform his actions in superposition, we construct a different proof system that requires only two messages. The result is that the associated decision problem is in QIP(2) and another argument establishes it as hard for QSZK (both classes contain problems believed to be difficult to solve for a quantum computer). We finally prove that the regularized relative entropy of recovery is equal to the optimal Type II error exponent when trying to distinguish many copies of a tripartite state from a recovered version of this state, such that the Type I error is constrained to be no larger than a constant.

v3: 10 pages, 2 figures, minor changes, to appear in Physical Review A

References in corpus (10)

• Structure of states which satisfy strong subadditivity of quantum entropy with equality
• Recoverability in quantum information theory
• Renyi generalizations of the conditional quantum mutual information
• Strengthened Monotonicity of Relative Entropy via Pinched Petz Recovery Map
• Universal recovery map for approximate Markov chains
• The Fidelity of Recovery is Multiplicative
• Quantum Proofs
• Quantum Markov chains, sufficiency of quantum channels, and Renyi information measures
• Swiveled Rényi entropies
• How not to Rényi generalize the Quantum Conditional Mutual Information

Cited by in corpus (14)

• On Variational Expressions for Quantum Relative Entropies
• The Fidelity of Recovery is Multiplicative
• On Composite Quantum Hypothesis Testing
• Estimating distinguishability measures on quantum computers
• Disentanglement Cost of Quantum States
• From log-determinant inequalities to Gaussian entanglement via recoverability theory
• Conditional Decoupling of Quantum Information
• Non-classical correlations in quantum mechanics and beyond
• Testing symmetry on quantum computers
• Bounds on Information Combining With Quantum Side Information
• Quantum Network Discrimination
• Discrimination power of a quantum detector
• Certifying optimality for convex quantum channel optimization problems
• Operational Resource Theory of Non-Markovianity