Bounds for Entanglement via an Extension of Strong Subadditivity of Entropy
classification
🪐 quant-ph
math-phmath.MPmath.OA
keywords
boundsentanglementbipartiteentropyproveclasscomputedconditional
read the original abstract
We prove lower bounds for the entanglement of formation and the squashed entanglement for any a bipartite density matrix in terms of the conditional entropy of the bipartite state with respect to either of its partial traces, and prove that these bounds are sharp by constructing a new class of states whose entanglements can be computed, and for which the bounds are saturated.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.