We propose a unifying approach to the separability problem using covariance matrices of locally measurable observables. From a practical point of view, our approach leads to strong entanglement criteria that allow to detect the entanglement of many bound entangled states in higher dimensions and which are at the same time necessary and sufficient for two qubits. From a fundamental perspective, our approach leads to insights into the relations between several known entanglement criteria -- such as the computable cross norm and local uncertainty criteria -- as well as their limitations.
We investigate the separability of quantum states based on covariance matrices. Separability criteria are presented for multipartite states. The lower bound of concurrence proposed in Phys. Rev. A. 75, 052320 (2007) is improved by optimizing the local orthonormal observables.
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…
Recently, Laplacian matrices of graphs are studied as density matrices in quantum mechanics. We continue this study and give conditions for separability of generalized Laplacian matrices of weighted graphs with unit trace. In particular, we show that the Peres-Horodecki positive partial transpose separability condition is necessary and sufficient for separability in ${\mathbb C}^2\otimes {\mathbb C}^q$. In addition, we present a sufficient condition for separability of generalized Laplacian matrices and diagonally dominant nonnegative matrices.
A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite systems by presenting a class of fully separable states arising from partially symmetric graphs.
The approximation of matrices to the sum of tensor products of Hermitian matrices is studied. A minimum decomposition of matrices on tensor space $H_1\otimes H_2$ in terms of the sum of tensor products of Hermitian matrices on $H_1$ and $H_2$ is presented. From this construction the separability of quantum states is discussed.
It is shown that, for the block matrices belonging to $M(nd,\mathbb{C})$ with commuting and normal block entries of dimension $d$, the separability of such a block matrices is equivalent to its semi-positive definity. The separability decomposition of lenght equal to the dimension of the block matrix (which is smaller then Carathéodory theorem implies) is given. The separability decomposition depends only on eigenvalues of block entries in the first part and on eigenvectors of the block entries in the second part of the tensor product. It is shown that semi-positive definity of considered bloc…
The correlation matrices or tensors in the Bloch representation of density matrices are encoded with entanglement properties. In this paper, based on the Bloch representation of density matrices, we give some new separability criteria for bipartite and multipartite quantum states. Theoretical analysis and some examples show that the proposed criteria can be more efficient than the previous related criteria.
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…
We study separability criteria in multipartite quantum systems of arbitrary dimensions by using the Bloch representation of density matrices. We first derive the norms of the correlation tensors and obtain the necessary conditions for separability under partition of tripartite and four-partite quantum states. Moreover, based on the norms of the correlation tensors,we obtain the separability criteria by matrix method. Using detailed examples, our results are seen to be able to detect more entangled states than previous studies. Finally, necessary conditions of separability for multipartite syst…
We give necessary and sufficient conditions under which a density matrix acting on a two-fold tensor product space is separable. Our conditions are given in terms of quantum conditional information transmission.
Separability is an important problem in theory of quantum entanglement. By using the Bloch representation of quantum states in terms of the Heisenberg-Weyl observable basis, we present a new separability criterion for bipartite quantum systems. It is shown that this criterion can be better than the previous ones in detecting entanglement. The results are generalized to multipartite quantum states.
We reduce the question whether a given quantum mixed state is separable or entangled to the problem of existence of a certain full family of commuting normal matrices whose matrix elements are partially determined by components of the pure states constituting a decomposition of the considered mixture. The method reproduces many known entanglement and/or separability criteria, and provides yet another geometrical characterization of mixed separable states.
A quantum system consisting of two subsystems is separable if its density matrix can be written as $ρ=\sum_A w_A\,ρ_A'\otimesρ_A''$, where $ρ_A'$ and $ρ_A''$ are density matrices for the two subsytems. In this Letter, it is shown that a necessary condition for separability is that a matrix, obtained by partial transposition of $ρ$, has only non-negative eigenvalues. This criterion is stronger than Bell's inequality.
The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed density matrices from combinatorial laplacian matrices of graphs discussed in Braunstein {\it et al.} Annals of Combinatorics, {\bf 10}(2006)291 to tripartite states. Then we proved that the degree condition defined in Braunstein {\it et al.} Phys. Rev. A {\bf 73}, (2006)012320 is sufficient and necessary for the tripartite separability of the density matrix of a nearest point graph.
We reconsider density matrices of graphs as defined in [quant-ph/0406165]. The density matrix of a graph is the combinatorial laplacian of the graph normalized to have unit trace. We describe a simple combinatorial condition (the "degree condition") to test separability of density matrices of graphs. The condition is directly related to the PPT-criterion. We prove that the degree condition is necessary for separability and we conjecture that it is also sufficient. We prove special cases of the conjecture involving nearest point graphs and perfect matchings. We observe that the degree condition…
We use the generalized concurrence approach to investigate the general multipartite separability problem. By extending the preconcurrence matrix formalism to arbitrary multipartite systems, we show that the separability problem can be formulated equivalently as a pure matrix analysis problem that consists in determining whether a given set of symmetric matrices is simultaneously unitarily congruent to hollow matrices, i.e., to matrices whose main diagonal is only composed of zeroes.
Using the finite Fourier transform, we introduce a generalization of Pauli-spin matrices for $d$-dimensional spaces, and the resulting set of unitary matrices $S(d) $ is a basis for $d\times d$ matrices. If $N=d_{1}\times d_{2}\times...\times d_{b}$ and $H^{[ N]}=\bigotimes H^{% [ d_{k}]}$, we give a sufficient condition for separability of a density matrix $ρ$ relative to the $H^{[ d_{k}]}$ in terms of the $L_{1}$ norm of the spin coefficients of $ρ>.$ Since the spin representation depends on the form of the tensor product, the theory applies to both full and partial separability on a given s…
A geometrical picture of separability of 2 x 2 composite quantum systems, showing the region of separable density matrices in the space of hermitian matrices, is given. It rests on the criterion of separability given by Peres, and it is an extension of the ``Horodecki diagram'' and the ``stella octangula'' described by Aravind.
Recently, Braunstein et al. [1] introduced normalized Laplacian matrices of graphs as density matrices in quantum mechanics and studied the relationships between quantum physical properties and graph theoretical properties of the underlying graphs. We provide further results on the multipartite separability of Laplacian matrices of graphs. In particular, we identify complete bipartite graphs whose normalized Laplacian matrix is multipartite entangled under any vertex labeling. Furthermore, we give conditions on the vertex degrees such that there is a vertex labeling under which the normalized …
Explicit separability of general two qubits density matrices is related to Lorentz transformations. We use the 4-dimensional form R(u,v=0,1,2,3) of the Hilbert-Schmidt (HS) decomposition of the density matrix. For the generic case in which Lorentz transformations diagonalize R(u,v=0,1,2,3) (into s(0),s(1),s(2),s(3)) we give relations between the R parameters and the s parameters. In particular we consider two cases: a) Two qubits density matrices with one pair of linear terms in the HS decomposition. b) Two qubits density matrices with two or three symmetric pairs of linear terms. Some of the …
In this paper, we study the separability of quantum states in bosonic system. Our main tool here is the "separability witnesses", and a connection between "separability witnesses" and a new kind of positivity of matrices--- "Power Positive Matrices" is drawn. Such connection is employed to demonstrate that multi-qubit quantum states with Dicke states being its eigenvectors is separable if and only if two related Hankel matrices are positive semidefinite. By employing this criterion, we are able to show that such state is separable if and only if it's partial transpose is non-negative, which co…
In matrix theory, a well established relation $(AB)^{T}=B^{T}A^{T}$ holds for any two matrices $A$ and $B$ for which the product $AB$ is defined. Here $T$ denote the usual transposition. In this work, we explore the possibility of deriving the matrix equality $(AB)^Γ=A^ΓB^Γ$ for any $4 \times 4$ matrices $A$ and $B$, where $Γ$ denote the partial transposition. We found that, in general, $(AB)^Γ\neq A^ΓB^Γ$ holds for $4 \times 4$ matrices $A$ and $B$ but there exist particular set of $4 \times 4$ matrices for which $(AB)^Γ= A^ΓB^Γ$ holds. We have exploited this matrix equality to investigate th…
In this paper, we present the separability criteria to identify non-$k$-separability and genuine multipartite entanglement in mixed multipartite states using elements of density matrices. Our criteria can detect the non-$k$-separability of Dicke class of states, anti W states and mixtures thereof and higher dimensional W class of states. We then investigate the performance of our criteria by considering $N$-qubit Dicke states with arbitrary excitations added with white noise and mixture of $N$-qudit W state with white noise. We also study the robustness of our criteria against white noise. Fur…
We give a new separability criterion, a necessary condition for separability of $N$-partite quantum states. The criterion is based on the Bloch representation of a $N$-partite quantum state and makes use of multilinear algebra, in particular, the matrization of tensors. Our criterion applies to {\it arbitrary} $N$-partite quantum states in $\mathcal{H}=\mathcal{H}^{d_1}\otimes \mathcal{H}^{d_2} \otimes ... \otimes \mathcal{H}^{d_N}.$ The criterion can test whether a $N$-partite state is entangled and can be applied to different partitions of the $N$-partite system. We provide examples that sho…
We treat 3-qubits states with maximally disordered subsystems, by using Hilbert-Schmidt decompositions.By using unfolding methods, the tensors are converted into matrices and by applying singular values decompositions to these matrices the number 27 of the Hilbert Schmidt parameters, is reduced to 9 and under the condition that the sum of absolute values of these parameters is not larger than 1, we conclude that the density matrix is fully separable . In another method we divide the 27 Hilbert Schmidt parameters into 9 triads where for each triad we calculate the Frobenius norm of 3 Hilbert-Sc…
We consider low rank density operators $\varrho$ supported on a $M\times N$ Hilbert space for arbitrary $M$ and $N$ ($M\leq N$) and with a positive partial transpose (PPT) $\varrho^{T_A}\ge 0$. For rank $r(\varrho) \leq N$ we prove that having a PPT is necessary and sufficient for $\varrho$ to be separable; in this case we also provide its minimal decomposition in terms of pure product states. It follows from this result that there is no rank 3 bound entangled states having a PPT. We also present a necessary and sufficient condition for the separability of generic density matrices for which th…
This work is an enquiry into the circumstances under which entropy methods can give an answer to the questions of both quantum separability and classical correlations of a composite state. Several entropy functionals are employed to examine the entanglement and correlation properties guided by the corresponding calculations of concurrence. It is shown that the entropy difference between that of the composite and its marginal density matrices may be of arbitrary sign except under special circumstances when conditional probability can be defined appropriately. This ambiguity is a consequence of …
Explicit separable density matrices, for mixed two qubits states, are derived by the use of Hilbert Schmidt decompositions and Peres Horodecki criterion. A strongly separable two qubits mixed state is defined by multiplications of two density matrices given with pure states while weakly separable two qubits state is defined by multiplications of two density matrices which includes non-pure states. We find the sufficient and necessary condition for separability of two-qubits density matrices and show that under this condition the two-qubit density matrices are strongly separable.
We pursue a number of analytical directions, motivated to some extent initially by the possibility of developing a methodology for formally proving or disproving a certain conjecture of quantum-theoretical relevance (quant-ph/0308037). It asserts that the 15-dimensional volume occupied by the separable two-qubit density matrices is (\sqrt{2}-1)/3, as measured in terms of the statistical distinguishability metric (four times the Bures or minimal monotone metric). Somewhat disappointingly, however, the several various analyses that we report, though we hope of independent/autonomous interest, ap…
A collection of orthonormal bases for a complex dXd Hilbert space is called mutually unbiased (MUB) if for any two vectors v and w from different bases the square of the inner product equals 1/d: |<v,w>| ^{2}=1/d. The MUB problem is to prove or disprove the the existence of a maximal set of d+1 bases. It has been shown in [W. K. Wootters, B. D. Fields, Annals of Physics, 191, no. 2, 363-381, (1989)] that such a collection exists if d is a power of a prime number p. We revisit this problem and use dX d generalizations of the Pauli spin matrices to give a constructive proof of this result. Speci…
Hilbert-Schmidt (HS) decompositions are employed for analyzing systems of n-qubits, and a qubit with a qudit. Negative eigenvalues, obtained by partial-transpose (PT) plus local unitary transformations (PTU) for one qubit from the whole system, are used for indicating inseparability. A sufficient criterion for full separability of the n-qubits and qubit-qudit systems is given. We use the singular value decomposition (SVD) for improving the criterion for full separability. General properties of entanglement and separability are analyzed for a system of a qubit and a qudit and n-qubits systems, …
Based on the ranks of reduced density matrices, we derive necessary conditions for the separability of multiparticle arbitrary-dimensional mixed states, which are equivalent to sufficient conditions for entanglement. In a similar way we obtain necessary conditions for the separability of a given mixed state with respect to partitions of all particles of the system into subsets. The special case of pure states is discussed separately.
The quantum marginal problem asks whether a set of given density matrices are consistent, i.e., whether they can be the reduced density matrices of a global quantum state. Not many non-trivial analytic necessary (or sufficient) conditions are known for the problem in general. We propose a method to detect consistency of overlapping quantum marginals by considering the separability of some derived states. Our method works well for the $k$-symmetric extension problem in general, and for the general overlapping marginal problems in some cases. Our work is, in some sense, the converse to the well-…
By focusing on the X-matrix part of a density matrix of two qubits we provide an algebraic lower bound for the concurrence. The lower bound is generalized for cases beyond two qubits and can serve as a sufficient condition for non-separability for bipartite density matrices of arbitrary dimension. Experimentally, our lower bound can be used to confirm non-separability without performing a complete state tomography.
The separability from spectrum problem asks for a characterization of the eigenvalues of the bipartite mixed states ρ with the property that U^*ρU is separable for all unitary matrices U. This problem has been solved when the local dimensions m and n satisfy m = 2 and n <= 3. We solve all remaining qubit-qudit cases (i.e., when m = 2 and n >= 4 is arbitrary). In all of these cases we show that a state is separable from spectrum if and only if U^*ρU has positive partial transpose for all unitary matrices U. This equivalence is in stark contrast with the usual separability problem, where a state…
A geometric understanding of entanglement is proposed based on local measurements. Taking recourse to the general structure of density matrices in the framework of Euclidean geometry, we first illustrate our approach for bipartite Werner states. It is demonstrated that separable states satisfy certain geometric constraints that entangled states do not. A separability criterion for multiparty Werner states of arbitrary dimension is derived. This approach can be used to determine separability across any bipartition of a general density matrix and leads naturally to a computable measure of entang…
A general separability condition on the second moment (covariance matrix) for continuous variable two-party systems is derived by an analysis analogous to the derivation of the Kennard's uncertainty relation without referring to the non-negativity of the partially transposed density matrix. This separability criterion is generally more stringent than that used by Simon which is based on the non-negativity of partially transposed density matrix, and thus this criterion may be useful in the analysis of general continuous two-party systems. Another separability criterion used by Duan et al. is sh…
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…
We develop separability criteria to identify non-$k$-separability $(k = 2,3,\ldots,n)$ and genuine multipartite entanglement in different classes of mixed $n$-partite quantum states using elements of density matrices. With the help of these criteria, we detect non-$k$-separability in $n$-qudit GHZ and W states respectively added with white noise. We also discuss the experimental implementation of our criteria by means of local observables.
This paper is devoted to the study of the separability problem in the field of Quantum information theory. We deal mainly with the bipartite finite dimensional case and with two types of matrices, one of them being the PPT matrices. We proved that many results holds for both types. If these matrices have specific Hermitian Schmidt decompositions then the matrices are separable in a very strong sense. We proved that both types have what we call split decompositions. We defined the notion of weak irreducible matrix, based on the concept of irreducible state defined recently. These split decompos…
We revise the problem first addressed by Braunstein and co-workers (Phys. Rev. Lett. {\bf 83} (5) (1999) 1054) concerning the separability of very noisy mixed states represented by general density matrices with the form $ρ_ε= (1-ε)M_d+ερ_1$. From a detailed numerical analysis, it is shown that: (1) there exist infinite values in the interval taken for the density matrix expansion coefficients, $-1\le c_{α_1,...,α_N}\le 1$, which give rise to {\em non-physical density matrices}, with trace equal to 1, but at least one {\em negative} eigenvalue; (2) there exist entangled matrices outside the pre…
We study the normal form of multipartite density matrices. It is shown that the correlation matrix (CM) separability criterion can be improved from the normal form we obtained under filtering transformations. Based on CM criterion the entanglement witness is further constructed in terms of local orthogonal observables for both bipartite and multipartite systems.
In this paper, we mainly discuss the separability of $n$-partite quantum states from elements of density matrices. Practical separability criteria for different classes of $n$-qubit and $n$-qudit quantum states are obtained. Some of them are also sufficient conditions for genuine entanglement of $n$-partite quantum states. Moreover, one of the resulting criteria is also necessary and sufficient for a class of $n$-partite states.
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.
P-representability is a necessary and sufficient condition for separability of bipartite Gaussian states only for the special subset of states whose covariance matrix are $Sp(2,R)\otimes Sp(2,R)$ locally invariant. Although this special class of states can be reached by a convenient $Sp(2,R)\otimes Sp(2,R)$ transformation over an arbitrary covariance matrix, it represents a loss of generality, avoiding inference of many general aspects of separability of bipartite Gaussian states.
Quantum entanglement plays crucial roles in quantum information processing. Quantum entangled states have become the key ingredient in the rapidly expanding field of quantum information science. Although the nonclassical nature of entanglement has been recognized for many years, considerable efforts have been taken to understand and characterize its properties recently. In this review, we introduce some recent results in the theory of quantum entanglement. In particular separability criteria based on the Bloch representation, covariance matrix, normal form and entanglement witness; lower bound…
We propose an entanglement measure for two qudits based on the covariances of a set of generators of the su(N) algebra. In particular, we represent this measure in terms of the mutually unbiased projectors for N prime. For pure states this measure quantify entanglement, we obtain an explicit expression which relates it to the concurrence hierarchy, specifically the I-concurrence and the 3-concurrence. For mixed states we propose a separability 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…
Covariance matrices are a useful tool to investigate correlations and entanglement in quantum systems. They are widely used in continuous variable systems, but recently also for finite dimensional systems powerful entanglement criteria in terms of covariance matrices have been derived. We show how these results can be used for the quantification of entanglement in bipartite systems. To that aim we introduce an entanglement parameter that quantifies the violation of the covariance matrix criterion and can be used to give a lower bounds on the concurrence. These lower bounds are easily computabl…
Two-qubit X-matrices have been the subject of considerable recent attention, as they lend themselves more readily to analytical investigations than two-qubit density matrices of arbitrary nature. Here, we maximally exploit this relative ease of analysis to formally derive an exhaustive collection of results pertaining to the separability probabilities of generalized two-qubit X-matrices endowed with Hilbert-Schmidt and, more broadly, induced measures. Further, the analytical results obtained exhibit interesting parallels to corresponding earlier (but, contrastingly, not yet fully rigorous) res…
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that the density matrix of a graph can be always written as a uniform mixture of pure density matrices of graphs. We consider the von Neumann entropy of these matrices and we characterize the graphs for which the minimum and maximum values are attained. We then discuss the problem of separability by pointing out that separability of density matrices of graphs doe…
Explicitly separable density matrices are constructed for all separable two-qubits states based on Hilbert-Schmidt (HS) decompositions. For density matrices which include only two-qubits correlations the number of HS parameters is reduced to 3 by using local rotations, and for two-qubits states which include single qubit measurements, the number of parameters is reduced to 4 by local Lorentz transformations. For both cases we related the absolute values of the HS parameters to probabilities, and the outer products of various Pauli matrices were transformed to pure states density matrices produ…
We present a criterion for multiparticle entanglement based on covariance matrices. On the one hand, the criterion allows to detect bound entangled states which are not detected by other criteria; on the other hand, some strongly entangled pure states such as the GHZ states are not detected. We show, however, that this is a general phenomenon: No separability criterion based on two-particle correlations can recognize the entanglement in the family of graph states, to which the GHZ states belong.
A finite dimensional quantum mechanical system is modeled by a density rho, a trace one, positive semi-definite matrix on a suitable tensor product space H[N] . For the system to demonstrate experimentally certain non-classical behavior, rho cannot be in S, a closed convex set of densities whose extreme points have a specificed tensor product form. Two mathematical problems in the quantum computing literature arise from this context: (1) the determination whether a given rho is in S and (2) a measure of the ``entanglement'' of such a rho in terms of its distance from S. In this paper we descri…
