Structure of states which satisfy strong subadditivity of quantum entropy with equality

We derive the strong subadditivity of the von Neumann entropy with a strict lower bound dependent on the distribution of quantum correlation in the system. We investigate the structure of states saturating the bounded subadditivity and explore its consequences for the quantum data processing inequality. The quantum data processing achieves a lower bound associated with the locally inaccessible information.

This paper presents self-contained proofs of the strong subadditivity inequality for quantum entropy and some related inequalities for the quantum relative entropy, most notably its convexity and its monotonicity under stochastic maps. Moreover, the approach presented here, which is based on Klein's inequality and one of Lieb's less well-known concave trace functions, allows one to obtain conditions for equality. Using the fact that the Holevo bound on the accessible informat...

The strong subadditivity inequality of von Neumann entropy relates the entropy of subsystems of a tripartite state $\rho_{ABC}$ to that of the composite system. Here, we define $\boldsymbol{T}^{(a)}(\rho_{ABC})$ as the extent to which $\rho_{ABC}$ fails to satisfy the strong subadditivity inequality $S(\rho_{B})+S(\rho_{C}) \le S(\rho_{AB})+S(\rho_{AC})$ with equality and investigate its properties. In particular, by introducing auxiliary subsystem $E$, we consider any purifi...

In this paper, we characterize the saturation of four universal inequalities in quantum information theory, including a variant version of strong subadditivity inequality for von Neumann entropy, the coherent information inequality, the Holevo quantity and average entropy inequalities. These results shed new light on quantum information inequalities.

Arguably the deepest fact known about the von Neumann entropy, the strong subadditivity inequality is a potent hammer in the quantum information theorist's toolkit. This short tutorial describes a simple proof of strong subadditivity due to Petz [Rep. on Math. Phys. 23 (1), 57--65 (1986)]. It assumes only knowledge of elementary linear algebra and quantum mechanics.

A short quantum Markov chain is a tripartite state $\rho_{ABC}$ such that system $A$ can be recovered perfectly by acting on system $C$ of the reduced state $\rho_{BC}$. Such states have conditional mutual information $I(A;B|C)$ equal to zero and are the only states with this property. A quantum channel $\mathcal{N}$ is sufficient for two states $\rho$ and $\sigma$ if there exists a recovery channel using which one can perfectly recover $\rho$ from $\mathcal{N}(\rho)$ and $\s...

Monotonicity under coarse-graining is a crucial property of the quantum relative entropy. The aim of this paper is to investigate the condition of equality in the monotonicity theorem and in its consequences such as the strong sub-additivity of the von Neumann entropy, the Golden-Thompson trace inequality and the monotonicity of the Holevo quantity.The relation to quantum Markovian states is briefly indicated.

Strong subadditivity of von Neumann entropy, proved in 1973 by Lieb and Ruskai, is a cornerstone of quantum coding theory. All other known inequalities for entropies of quantum systems may be derived from it. Here we prove a new inequality for the von Neumann entropy which we prove is independent of strong subadditivity: it is an inequality which is true for any four party quantum state, provided that it satisfies three linear relations (constraints) on the entropies of certa...

The challenge of equality in the strong subadditivity inequality of entropy is approached via a general additivity of correlation information in terms of nonoverlapping clusters of subsystems in multipartite states (density operators). A family of tripartite states satisfying equality is derived.

We exhibit infinitely many new, constrained inequalities for the von Neumann entropy, and show that they are independent of each other and the known inequalities obeyed by the von Neumann entropy (basically strong subadditivity). The new inequalities were proved originally by Makarychev et al. [Commun. Inf. Syst., 2(2):147-166, 2002] for the Shannon entropy, using properties of probability distributions. Our approach extends the proof of the inequalities to the quantum domain...