Papers
Topics
Authors
Recent
Search
2000 character limit reached

Relative entropy and squashed entanglement

Published 11 Oct 2012 in quant-ph, math-ph, and math.MP | (1210.3181v2)

Abstract: We are interested in the properties and relations of entanglement measures. Especially, we focus on the squashed entanglement and relative entropy of entanglement, as well as their analogues and variants. Our first result is a monogamy-like inequality involving the relative entropy of entanglement and its one-way LOCC variant. The proof is accomplished by exploring the properties of relative entropy in the context of hypothesis testing via one-way LOCC operations, and by making use of an argument resembling that by Piani on the faithfulness of regularized relative entropy of entanglement. Following this, we obtain a commensurate and faithful lower bound for squashed entanglement, in the form of one-way LOCC relative entropy of entanglement. This gives a strengthening to the strong subadditivity of von Neumann entropy. Our result improves the trace-distance-type bound derived in [Comm. Math. Phys., 306:805-830, 2011], where faithfulness of squashed entanglement was first proved. Applying Pinsker's inequality, we are able to recover the trace-distance-type bound, even with slightly better constant factor. However, the main improvement is that our new lower bound can be much larger than the old one and it is almost a genuine entanglement measure. We evaluate exactly the various relative entropy of entanglement under restricted measurement classes, for maximally entangled states. Then, by proving asymptotic continuity, we extend the exact evaluation to their regularized versions for all pure states. Finally, we consider comparisons and separations between some important entanglement measures and obtain several new results on these, too.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.