We present a way to construct indecomposable entanglement witnesses from any permutations pi with pi^2 not equal to id for any finite dimensional bipartite systems. Some new bounded entangled states are also found, which can be detected by such witnesses while cannot be distinguished by PPT criterion, realignment criterion, etc.
It is shown that every entangled state in an infinite-dimensional composite system has a simple entanglement witness of the form $\ensuremath{\alpha}I+T$ with $\ensuremath{\alpha}$ a non-negative number and T a finite rank self-adjoint operator. We also provide two methods of constructing an entanglement witness and apply them to obtain some entangled states that cannot be detected by the positive partial transpose criterion and the realignment criterion.
Let n≥2 and Φn,t,π:Mn(C)→Mn(C) be a linear map defined by Φn,t,π(A)=(n−t)∑i=1nEiiAEii+t∑i=1nEi,π(i)AEi,π(i)†−A, where 0≤t≤n, Eijs are the matrix units and π is a non-identity permutation of (1,2,⋯,n). Denote by {Fs:s=1,2…,k} the set of all minimal cycles of π and l(π)=max{#Fs:s=1,2,…,k} the length of π. It is shown that the Hermitian matrix Wn,t,π induced by Φn,t,π is an indecomposable entanglement witness if and only if π2=id (the identity permutation) and $0
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 criterion based on Bloch representations, the computable cross-norm or realignment criterion and its optimal nonlinear entanglement witnesses. Furthermore, this criterion can be generalized to an analog of permutation separability criteria in the even-partite systems.