Remarks on the Equivalence of Full Additivity and Monotonicity for the Entanglement Cost

Abstract

We analyse the relationship between the full additivity of the entanglement cost and its full monotonicity under local operations and classical communication. We show that the two properties are equivalent for the entanglement cost. The proof works for the regularization of any convex, subadditive, and asymptotically continuous entanglement monotone, and hence also applies to the asymptotic relative entropy of entanglement.

Additional details