A general scheme for construction of scalar separability criteria from positive maps

Abstract

We present a general scheme that allows for construction of scalar separability criteria from positive but not completely positive maps. The concept is based on a decomposition of every positive map $\Lambda$ into a difference of two completely positive maps ${\Lambda }_1$, ${\Lambda }_2$, i.e., $\Lambda ={\Lambda }_1-{\Lambda }_2$. The scheme may be also treated as a generalization of the known entropic inequalities, which are obtained from the reduction map. An analysis performed on few classes of states shows that the new scalar criteria are stronger than the entropic inequalities and furthermore, when derived from indecomposable maps allow for detection of bound entanglement.

RevTex, 5 pages, 2 figures, the revised version

References in corpus (5)

• Optimal entanglement criterion for mixed quantum states
• Entanglement in SO(3)-invariant bipartite quantum systems
• Entanglement in SU(2)-invariant quantum systems: The positive partial transpose criterion and others
• State space structure and entanglement of rotationally invariant spin systems
• Binding energies of semirelativistic N-boson systems

Cited by in corpus (4)

• Entanglement detection
• Structural approximations to positive maps and entanglement breaking channels
• A characterization of positive linear maps and criteria of entanglement for quantum states
• Positive maps, majorization, entropic inequalities, and detection of entanglement