Entanglement quantification made easy: polynomial measures invariant under convex decomposition

Quantifying entanglement in composite systems is a fundamental challenge, yet exact results are only available in few special cases. This is because hard optimization problems are routinely involved, such as finding the convex decomposition of a mixed state with the minimal average pure-state entang...

Full description

Bibliographic Details
Main Authors: Regula, Bartosz, Adesso, Gerardo
Format: Article
Published: American Physical Society 2016
Online Access:https://eprints.nottingham.ac.uk/40794/