arXiv Analytics

Sign in

arXiv:1406.4954 [quant-ph]AbstractReferencesReviewsResources

Indecomposability of entanglement witnesses constructed from any permutations

Xiao-Fei Qi, Jin-Chuan Hou

Published 2014-06-19Version 1

Let $n\geq 2$ and $\Phi_{n,t,\pi}: M_n({\mathbb C}) \rightarrow M_n({\mathbb C})$ be a linear map defined by $\Phi_{n,t,\pi}(A)=(n-t)\sum_{i=1}^nE_{ii}AE_{ii}+t\sum_{i=1}^nE_{i,\pi(i)}AE_{i,\pi(i)}^\dag-A$, where $0\leq t\leq n$, $E_{ij}$s are the matrix units and $\pi$ is a non-identity permutation of $(1,2,\cdots,n)$. Denote by $\{{ F}_s: s=1,2\ldots, k\}$ the set of all minimal cycles of $\pi$ and $l(\pi)=\max\{\# { F}_s: s=1,2,\ldots,k\}$ the length of $\pi$. It is shown that the Hermitian matrix $W_{n,t,\pi}$ induced by $\Phi_{n,t,\pi}$ is an indecomposable entanglement witness if and only if $\pi^2\not={\rm id}$ (the identity permutation) and $0<t\leq\frac{n}{l(\pi)}$. Some new bounded entangled states are detected by such witnesses that cannot be distinguished by PPT criterion, realignment criterion, etc..

Related articles: Most relevant | Search more
arXiv:2104.14058 [quant-ph] (Published 2021-04-29)
On a class of $k$-entanglement witnesses
arXiv:1106.1114 [quant-ph] (Published 2011-06-06)
Entanglement Witnesses for Graph States: General Theory and Examples
arXiv:1001.5185 [quant-ph] (Published 2010-01-28, updated 2010-02-18)
Estimating Concurrence via Entanglement Witnesses