We introduce a weak form of the realignment separability criterion which is particularly suited to detect continuous-variable entanglement and is physically implementable (it requires linear optics transformations and homodyne detection). Moreover, we define a family of states, called Schmidt-symmetric states, for which the weak realignment criterion reduces to the original formulation of the realignment criterion, making it even more valuable as it is easily computable especially in higher dimensions. Then, we focus in particular on Gaussian states and introduce a filtration procedure based on noiseless amplification or attenuation, which enhances the entanglement detection sensitivity. In some specific examples, it does even better than the original realignment criterion.
By combining a parameterized Hermitian matrix, the realignment matrix of the bipartite density matrix $ρ$ and the vectorization of its reduced density matrices, we present a family of separability criteria, which are stronger than the computable cross norm or realignment (CCNR) criterion. With linear contraction methods, the proposed criteria can be used to detect the multipartite entangled states that are biseparable under any bipartite partitions. Moreover, we show by examples that the presented multipartite separability criteria can be more efficient than the corresponding multipartite real…
Quantum entanglement is the core resource in quantum information processing and quantum computing. It is an significant challenge to effectively characterize the entanglement of quantum states. Recently, elegant separability criterion is presented in [Phys. Rev. Lett. 125, 200501 (2020)] by Elben et al. based on the first three partially transposed (PT) moments of density matrices. Then in [Phys. Rev. Lett. 127, 060504 (2021)] Yu \emph{et al.} proposed two general powerful criteria based on the PT moments. In this paper, based on the realignment operations of matrices we propose entanglement d…
The recent proposed realignment separability criterion for mixed is analyzed. We identify the essential part of this criterion is a swap operator followed by a partial transposition. Then we analyze the separability criterion of permutation indices of the density matrix for multipartite state which is a generalization of the realignment criterion. We give a method to solve the equivalence problem of the separability criterion of permutation indices of the density matrix. For tripartite state, we show the non-trivial separability criteria are either partial transposition criterion or realignmen…
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.
Inspired by the realignment or computable cross norm criterion, we present a new result about the characterization of quantum entanglement. Precisely, an interesting class of inequalities satisfied by all separable states of a bipartite quantum system is derived. These inequalities induce new separability criteria that generalize the realignment criterion.
For a quantum state in a bipartite system represented as a density matrix, researchers used the realignment matrix and functions on its singular values to study the separability of the quantum state. We obtain bounds for elementary symmetric functions of singular values of realignment matrices. This answers some open problems proposed by Lupo, Aniello, and Scardicchio. As a consequence, we show that the proposed scheme by these authors for testing separability would not work if the two subsystems of the bipartite system have the same dimension.
In quant-ph/0205017 v1 Chen, Wu and Yang formulated a necessary separability criterion based on a realignment method for matrices. This note is to point out that this criterion is identical to the necessary cross norm criterion previously put forward by this author.
The problem on detecting the entanglement of a bipartite state is significant in quantum information theory. In this article, we apply the Ky Fan norm to the revised realignment matrix of a bipartite state. Specifially, we consider a family of separable criteria for bipartite states, and present when the density matrix corresponds to a state is real, the criteria is equivalent to the enhanced realignment criterion. Moreover, we present analytical lower bounds of concurrence and the convex-roof extended negativity for arbitrary dimensional systems.
We present a framework for deciding whether a quantum state is separable or entangled using covariance matrices of locally measurable observables. This leads to the covariance matrix criterion as a general separability criterion. We demonstrate that this criterion allows to detect many states where the familiar criterion of the positivity of the partial transpose fails. It turns out that a large number of criteria which have been proposed to complement the positive partial transpose criterion - the computable cross norm or realignment criterion, the criterion based on local uncertainty relatio…
The separability of bipartite non-Gaussian states is studied by applying the realignment criterion with the technique of functional analysis. The realignment criterion is given as one inequality in contrast to the infinitive number of inequalities based on the moments. We give the necessary and sufficient condition of inseparability for non-Gaussian states prepared by photon subtraction or addition from symmetric Gaussian states. The entanglement criterion of non-Gaussian states evolved in thermal noise and amplitude damping environment is also obtained.
We present separability criteria for both bipartite and multipartite quantum states. These criteria include the criteria based on the correlation matrix and its generalized form as special cases. We show by detailed examples that our criteria are more powerful than the positive partial transposition criterion, the realignment criterion and the criteria based on the correlation matrices.
Detection power of separability criteria based on a correlation tensor is tested within a family of generalized isotropic state in $d_1 \otimes d_2$. For $d_1 \neq d_2$ all these criteria are weaker than positive partial transposition (PPT) criterion. Interestingly, our analysis supports the recent conjecture that a criterion based on symmetrically informationaly complete positive operator-valued measure (SIC-POVMs) is stronger than realignment criterion.
Usual separability criteria applicable to distinguishable particles are not applicable to identical particles. Here we show that Partial transposition and symmetrization (or anti symmetrization) of density matrix of bipartite boson systems (fermion systems) can be used to check whether a state is separable or not.By using determinant based separability criteria it has been found that bipartite states of identical particles are always separable. It is found that partial transposition and symmetrization is equivalent to realignment criteria proposed by Wu.
Employing a recently proposed separability criterion we develop analytical lower bounds for the concurrence and for the entanglement of formation of bipartite quantum systems. The separability criterion is based on a nondecomposable positive map which operates on state spaces with even dimension N >= 4, and leads to a class of nondecomposable optimal entanglement witnesses. It is shown that the bounds derived here complement and improve the existing bounds obtained from the criterion of positive partial transposition and from the realignment criterion.
We present a generalized partial transposition separability criterion for the density matrix of a multipartite quantum system. This criterion comprises as special cases the famous Peres-Horodecki criterion and the recent realignment criterion in [O. Rudolph, quant-ph/0202121] and [K. Chen, L.A. Wu, quant-ph/0205017]. It involves only straightforward matrix manipulations and is easy to apply. A quantitative measure of entanglement based on this criterion is also obtained.
Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any separable state, the sum of the singular values of the matrix should be less than or equal to 1. This condition provides a very simple, computable necessary criterion for separability, and shows powerful ability to identify most bound entangled states discussed in the literature. As a byproduct of the criterion, we give an estimate for the degree of entangle…
It is known that realignment crierion is necessary but not a sufficient criterion for lower as well as higher dimensional system. In this work, we first consider a two-qubit system and derived the necessary and sufficient condition based on realignment operation for a particular class of two-qubit system. Thus we solved the problem of if and only if condition partially for a particular class of two-qubit state. We have shown that the derived necessary and sufficient condition detects two-qubit entangled states, which are not detected by the realignment criterion. Next, we discuss the higher di…
Inspired by the `computable cross norm' or `realignment' criterion, we propose a new point of view about the characterization of the states of bipartite quantum systems. We consider a Schmidt decomposition of a bipartite density operator. The corresponding Schmidt coefficients, or the associated symmetric polynomials, are regarded as quantities that can be used to characterize bipartite quantum states. In particular, starting from the realignment criterion, a family of necessary conditions for the separability of bipartite quantum states is derived. We conjecture that these conditions, which a…
A family of separability criteria based on correlation matrix (tensor) is provided. Interestingly, it unifies several criteria known before like e.g. CCNR or realignment criterion, de Vicente criterion and derived recently separability criterion based on SIC POVMs. It should be stressed that, unlike the well known Correlation Matrix Criterion or criterion based on Local Uncertainty Relations, the new criteria are linear in the density operator and hence one may find new classes of entanglement witnesses and positive maps. Interestingly, there is a natural generalization to multipartite scenari…
In this paper, the realignment criterion and the RCCN criterion of separability for states in infinite-dimensional bipartite quantum systems are established. Let $H_A$ and $H_B$ be complex Hilbert spaces with $\dim H_A\otimes H_B=+\infty$. Let $ρ$ be a state on $H_A\otimes H_B$ and $\{δ_k\}$ be the Schmidt coefficients of $ρ$ as a vector in the Hilbert space ${\mathcal C}_2(H_A)\otimes{\mathcal C}_2(H_B)$. We introduce the realignment operation $ρ^R$ and the computable cross norm $\|ρ\|_{\rm CCN}$ of $ρ$ and show that, if $ρ$ is separable, then $\|ρ^{R}\|_{\rm Tr}=\|ρ\|_{\rm CCN}=\sum\limits_k…
A new necessary separability criterion that relates the structures of the total density matrix and its reductions is given. The method used is based on the realignment method [K. Chen and L.A. Wu, Quant. Inf. Comput. 3, 193 (2003)]. The new separability criterion naturally generalizes the reduction separability criterion introduced independently in previous work of [M. Horodecki and P. Horodecki, Phys. Rev. A 59, 4206 (1999)] and [N.J. Cerf, C. Adami and R.M. Gingrich, Phys. Rev. A 60, 898 (1999)]. In special cases, it recovers the previous reduction criterion and the recent generalized partia…
We consider the Schmidt decomposition of a bipartite density operator induced by the Hilbert-Schmidt scalar product, and we study the relation between the Schmidt coefficients and entanglement. First, we define the Schmidt equivalence classes of bipartite states. Each class consists of all the density operators (in a given bipartite Hilbert space) sharing the same set of Schmidt coefficients. Next, we review the role played by the Schmidt coefficients with respect to the separability criterion known as the `realignment' or `computable cross norm' criterion; in particular, we highlight the fact…
We show that any state which violates the computable cross norm (or realignment) criterion for separability also violates the separability criterion of the local uncertainty relations. The converse is not true. The local uncertainty relations provide a straightforward construction of nonlinear entanglement witnesses for the cross norm criterion.
The absolute separability problem asks for a characterization of the quantum states $ρ\in M_m\otimes M_n$ with the property that $UρU^\dagger$ is separable for all unitary matrices $U$. We investigate whether or not it is the case that $ρ$ is absolutely separable if and only if $UρU^\dagger$ has positive partial transpose for all unitary matrices $U$. In particular, we develop an easy-to-use method for showing that an entanglement witness or positive map is unable to detect entanglement in any such state, and we apply our method to many well-known separability criteria, including the range cri…
Entanglement detection problem is one of the important problem in quantum information theory. Gurvit showed that this problem is NP complete and thus this may be the possible reason that only one criterion is not sufficient to detect all entangled states. There are some powerful entanglement detection criterion such as partial transposition criterion, realignment criterion but it may not be possible to implement them successfully in the experiment. This situation can be avoided if the entanglement is detected through the construction of witness operator method. In this work, we take an analyti…
In this paper, a class of indecomposable positive finite rank elementary operators of order $(n,n)$ are constructed. This allows us to give a simple necessary and sufficient criterion for separability of pure states in bipartite systems of any dimension in terms of positive elementary operators of order $(2,2)$ and get some new mixed entangled states that can not be detected by the positive partial transpose (PPT) criterion and the realignment criterion.
Entanglement concurrence has been widely used for featuring entanglement in quantum experiments. As an entanglement monotone it is related to specific quantum Tsallis entropy. Our goal in this paper is to propose a new parameterized bipartite entanglement monotone which is named as $q$-concurrence inspired by general Tsallis entropy. We derive an analytical lower bound for the $q$-concurrence of any bipartite quantum entanglement state by employing positive partial transposition criterion and realignment criterion, which shows an interesting relationship to the strong separability criteria. Th…
Optimal entanglement criteria from trace invariants
S. N. Bose National Centre for Basic Sciences（S.N. 玻色基础科学国家中心）；Indian Statistical Institute（印度统计研究所）；Université de Toulouse（图卢兹大学）；Laboratoire de Physique Théorique, Université de Toulouse, CNRS, UPS（理论物理实验室，图卢兹大学，法国国家科学研究中心）
Let $H$ and $K$ be (finite or infinite dimensional) complex Hilbert spaces. A characterization of positive completely bounded normal linear maps from ${\mathcal B}(H)$ into ${\mathcal B}(K)$ is given, which particularly gives a characterization of positive elementary operators including all positive linear maps between matrix algebras. This characterization is then applied give a representation of quantum channels (operations) between infinite-dimensional systems. A necessary and sufficient criterion of separability is give which shows that a state $ρ$ on $H\otimes K$ is separable if and only …
