Beyond the standard entropic inequalities: stronger scalar separability criteria and their applications
Remigiusz Augusiak, Julia Stasi\'nska, Pawel Horodecki

TL;DR
This paper develops stronger scalar inequalities based on extended reduction criteria that outperform traditional entropic inequalities in detecting entanglement, including bound entanglement, with potential for experimental realization.
Contribution
It introduces new scalar inequalities derived from extended reduction criteria that are more effective than entropic inequalities in identifying various forms of entanglement.
Findings
Inequalities detect entanglement where entropic criteria fail.
Effective in identifying bound entanglement in specific states.
Potential for experimental implementation of entanglement witnesses.
Abstract
Recently it was shown that if a given state fulfils the reduction criterion it must also satisfy the known entropic inequalities. Now the questions arises whether on the assumption that stronger criteria based on positive but not completely positive maps are satisfied, it is possible to derive some scalar inequalities stronger than the entropic ones. In this paper we show that under some assumptions the extended reduction criterion [H.-P. Breuer, Phys. Rev. Lett 97, 080501 (2006); W. Hall, J. Phys. A 40, 6183 (2007)] leads to some entropic--like inequalities which are much stronger than their entropic counterparts. The comparison of the derived inequalities with other separability criteria shows that such approach might lead to strong scalar criteria detecting both distillable and bound entanglement. In particular, in the case of SO(3)-invariant states it is shown that the present…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
