Entanglement detection beyond the cross-norm or realignment criterion

Abstract

Separability problem, to decide whether a given state is entangled or not, is a fundamental problem in quantum information theory. We propose a powerful and computationally simple separability criterion, which allows us to detect the entanglement of many bound entangled states. The criterion is strictly stronger than the dV criterion, the computable cross-norm or realignment criterion and its optimal nonlinear entanglement witnesses. Furthermore, this criterion can be generalized to an analogue of permutation separability criteria in the even-partite systems.

5 pages, 1 figure; Theorem 2 added; a new proposition added; a note added

References in corpus (10)

• Detecting Genuine Multipartite Entanglement with Two Local Measurements
• Concurrence of arbitrary dimensional bipartite quantum states
• Covariance matrices and the separability problem
• Lower bounds on concurrence and separability conditions
• Optimal entanglement witnesses based on local orthogonal observables
• Entanglement criteria based on local uncertainty relations are strictly stronger than the computable cross norm criterion
• Separability criteria and bounds for entanglement measures
• Further results on entanglement detection and quantification from the correlation matrix criterion
• Multipartite quantum correlation and entanglement in four-qubit pure states
• Information-Theoretic Measure of Genuine Multi-Qubit Entanglement

Cited by in corpus (6)

• Entanglement detection
• Entanglement and permutational symmetry
• Unifying several separability conditions using the covariance matrix criterion
• Bipartite quantum systems: on the realignment criterion and beyond
• On the relation between Schmidt coefficients and entanglement
• Positive maps, majorization, entropic inequalities, and detection of entanglement