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.
We give two strengthenings of an inequality for the quantum conditional mutual information of a tripartite quantum state recently proved by Fawzi and Renner, connecting it with the ability to reconstruct the state from its bipartite reductions. Namely, we show that the conditional mutual information is an upper bound on the regularized relative entropy distance between the quantum state and its reconstructed version. It is also an upper bound for the measured relative entropy distance of the state to its reconstructed version. The main ingredient of the proof is the fact that the conditional mutual information is the optimal quantum communication rate in the task of state redistribution.
This paper defines the fidelity of recovery of a tripartite quantum state on systems
A,B, and
C as a measure of how well one can recover the full state on all three systems if system
A is lost and a recovery operation is performed on system
C alone. The surprisal of the fidelity of recovery (its negative logarithm) is an information quantity which obeys nearly all of the properties of the conditional quantum mutual information
I(A;B∣C), including non-negativity, monotonicity with respect to local operations, duality, invariance with respect to local isometries, a dimension bound, and continuity. We then define a (pseudo) entanglement measure based on this quantity, which we call the ``geometric squashed entanglement.'' We prove that the geometric squashed entanglement is a 1-LOCC monotone (i.e., monotone nonincreasing with respect to local operations and classical communication from Bob to Alice), that it vanishes if and only if the state on which it is evaluated is unentangled, and that it reduces to the geometric measure of entanglement if the state is pure. We also show that it is invariant with respect to local isometries, subadditive, continuous, and normalized on maximally entangled states. We next define the surprisal of measurement recoverability, which is an information quantity in the spirit of quantum discord, characterizing how well one can recover a share of a bipartite state if it is measured. We prove that this discordlike quantity satisfies several properties, including non-negativity, faithfulness on classical-quantum states, invariance with respect to local isometries, a dimension bound, and normalization on maximally entangled states. This quantity, combined with a recent breakthrough of Fawzi and Renner, makes it possible to characterize states with discord nearly equal to zero as being approximate fixed points of entanglement-breaking channels (equivalently, they are recoverable from the state of a measuring apparatus). Finally, we discuss a multipartite fidelity of recovery and several of its properties.
A central question in quantum information theory is to determine how well lost information can be reconstructed. Crucially, the corresponding recovery operation should perform well without knowing the information to be reconstructed. In this work, we show that the quantum conditional mutual information measures the performance of such recovery operations. More precisely, we prove that the conditional mutual information I ( A : C | B ) of a tripartite quantum state ρ ABC can be bounded from below by its distance to the closest recovered state R B → B C ( ρ A B ) , where the C -part is reconstructed from the B -part only and the recovery map R B → B C merely depends on ρ BC . One particular application of this result implies the equivalence between two different approaches to define topological order in quantum systems.
Several important measures of quantum correlations of a state of a finite-dimensional composite system are defined as linear combinations of marginal entropies of this state. This paper is devoted to the infinite-dimensional generalizations of such quantities and to the analysis of their properties. We introduce the notion of faithful extension of a linear combination of marginal entropies and consider several concrete examples starting with the quantum mutual information and the quantum conditional entropy. Then we show that the conditional mutual information can be uniquely defined as a lower semicontinuous function on the set of all states of a tripartite infinite-dimensional system possessing all the basic properties valid in finite dimensions. Infinite-dimensional generalizations of some other measures of quantum correlations in multipartite quantum systems are also considered. It is shown that almost all of these generalized measures are globally lower semicontinuous and possess local continuity properties which essentially simplify their use in analysis of quantum systems. In the second part of the paper we consider applications of the general results of its first part, in particular, to the theory of infinite-dimensional quantum channels and their capacities. We also show the existence of the Fawzi-Renner recovery channel reproducing marginal states for all tripartite states (including states with infinite marginal entropies) starting with the corresponding finite-dimensional result.
Quantum conditional mutual information (QCMI) is a fundamental measure of conditional independence, with central applications throughout quantum information theory and many-body physics. Despite its importance, finding a fully quantum Rényi generalization that satisfies all desirable structural properties has remained an open question. In this work, we introduce a quantum Rényi conditional mutual information possessing these desirable properties: it is monotone under local quantum channels, additive under tensor products, monotone in the Rényi parameter, and converges to the QCMI in the limit
α→1. We establish bounds on this quantity in terms of relative entropies to the Petz-recovered state, showing that it provides a distinct measure of approximate conditional independence. As a consequence, we derive recovery-based upper and lower bounds on the QCMI in terms of quantum generalizations of the Kullback-Leibler divergence, improving upon the best known results in certain regimes. Finally, we establish bounds in terms of relative entropies to the sets of Markov and separable states and derive Rényi chain rules, which appear to be novel even in the classical setting.
Several information measures have recently been defined that 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 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.