Literature DB >> 29362415

A Necessary and Sufficient Criterion for the Separability of Quantum State.

Jun-Li Li1,2, Cong-Feng Qiao3,4,5.   

Abstract

Quantum entanglement has been regarded as one of the key physical resources in quantum information sciences. However, the determination of whether a mixed state is entangled or not is generally a hard issue, even for the bipartite system. In this work we propose an operational necessary and sufficient criterion for the separability of an arbitrary bipartite mixed state, by virtue of the multiplicative Horn's problem. The work follows the work initiated by Horodecki et al. and uses the Bloch vector representation introduced to the separability problem by J. De Vicente. In our criterion, a complete and finite set of inequalities to determine the separability of compound system is obtained, which may be viewed as trade-off relations between the quantumness of subsystems. We apply the obtained result to explicit examples, e.g. the separable decomposition of arbitrary dimension Werner state and isotropic state.

Entities:  

Year:  2018        PMID: 29362415      PMCID: PMC5780502          DOI: 10.1038/s41598-018-19709-z

Source DB:  PubMed          Journal:  Sci Rep        ISSN: 2045-2322            Impact factor:   4.379


Introduction

Entanglement is a ubiquitous feature of quantum system and key element in quantum information processing, whereas yet far from fully understood[1]. A fundamental problem in the study of entanglement is the determination of the separability of quantum states. For pure state, the entangled states are those that cannot be expressed as the product of the subsystems, e.g. we say a bipartite pure state of A and B is entangled if it cannot be expressed in the product form like For the mixed state of a compound system, we say it is entangled if it cannot be written as a convex combination of product states. For example, a bipartite mixed state is separable (i.e. classically correlated[2]) whenever it can be expressed asHere, are local density matrices of particles A and B; p > 0 and . The entanglement (non-separability) criterion for pure state is clear, by virtue of Schmidt or high order singular value decomposition for any-number-partite system[3]. However, none of the existing criteria for the separability of finite dimensional mixed states are satisfactory by far. They are generally either sufficient and necessary, but not practically usable; or easy to use, but only necessary (or only sufficient)[4]. Over the past decades, one remarkable progress towards the operational characterization of a separable mixed state, the positive partial transposition (PPT) criterion[5], was achieved by Peres twenty years ago. This separability criterion is only necessary and sufficient for 2 × 2 and 2 × 3 systems, rather than for arbitrary higher dimensional systems[6]. Though couple of necessary and sufficient criteria were developed afterwards[6-8], they are generally difficult to handle in practice, or only applicable to low-rank density matrices[9]. With the dimension growing, the separability problem of a compound system tends to be NP-hard, even in the bipartite situation[10]. Recent investigations mostly focus on the necessary or sufficient conditions of witnessing entanglement or separability. The computable cross-norm or realignment (CCNR) criterion[11,12] and local uncertainty relations (LURs)[13] are proposed to detect entanglement. By virtue of the Bloch representation, separability criterion had been successfully formulated in matrix norms, which was found to be related to the CCNR criterion[14]. The optimization of entanglement witness observables may stand as a separability criterion[15]. For recent development, readers may refer to refs[16-18] and more comprehensive reviews[19,20]. It should be noted that even restricted to necessary or sufficient criterion, the corresponding inequalities tend to be an ever growing family. Therefore, to find a complete and finite set of inequalities to determine the separability of mixed states is theoretically important and practically necessary. In this work, we present an applicable criterion for the separability of bipartite mixed state through exploring the multiplicative Horn’s problem[21]. By expressing the quantum state in Bloch representation, the problem of factorizing a mixed state into sum of product states is transformed to the task of decomposing a matrix into the product of two other matrices. We find that the solution to the multiplicative Horn’s problem yields a complete and finite set of inequalities, a new criterion, which in practice provides a systematic procedure for the decomposition of separable mixed states. Relations between this new criterion and other related ones are investigated through concrete examples, including the separable decomposition of arbitrary dimensional Werner and isotropic states. Results manifest that the criterion raised in this work is to our knowledge the most applicable one at present in determining the separability of entangled quantum states.

Results

The Bloch representation of quantum state

A quantum state in N-dimensional Hilbert space may be expressed as[22]where the real coefficients r = 〈λ〉 = Tr[ρλ], and λ are the N2 − 1 generators of SU(N) group. The N2 − 1 dimensional vector is called Bloch vector (or coherent vector) of the density matrix ρ, where the superscript T means the transposition. As the density matrix must be positive semidefinite and normalized, the vector subjects to a set of constraints[23,24], among which is imposed by the condition Tr[ρ2] ≤ 1 with the vector norm defined as . Similarly, any bipartite state of dimensions N × M in the Bloch representation can be expressed asHere , , , and σν are generators of SU(M). Reformulating the right hand side of Eq. (2) in term of Bloch representation of , , and comparing with Eq. (4), the necessary and sufficient condition of separability then turns towhere the subscripts in , label different Bloch vectors rather the components of them, and the correlation matrix has the matrix elements of . The reduced density matrices of A and B can be derived from Eq. (4) by partial traceHere the local ranks are rank(ρ) = n and rank(ρ) = m, where n and m may be non-full local ranks of n < N and m < M. We then have the following observation (see[25] for details):

Observation 1.

All N × M mixed states with local ranks n < N and m < M are either reducible to n × m states with full local ranks or entangled. According to Observation 1, we need only consider the separability of mixed states with full local ranks. The full local rank state could be transformed to a normal form with maximally mixed subsystems[26], i.e.Note that in the literature there are studies about the normal form in the separability problem[27,28]. Hereafter, the quantum states ρ are implied to be in their normal form, and we have

Observation 2.

Let and be Bloch vectors of density matrices and , we may define two matrices and , where , , and D = diag{p1, p2, …, p} with 0 < p ≤ 1 and . The state ρis separable if and only if there exist a number L such that with and .

The criterion of separability

For arbitrary bipartite quantum state ρ in normal form, let be its correlation matrix, and M and M be defined in Observation 2, the decomposition then can be obtained via the following theorem:

Theorem 1.

A real matrix can be decomposed as if and only if M, M, and Dhave the following relationHere, and are the left and right singular vectors of with singular values of τ; X, Y, Q(1), Q(2) ∈ SO(L); D = diag{α1, …, α} and D = diag{β1, …, β} are singular values of Mand M; D = diag{τ1, …, τ}, with ; all the singular values are arranged in descending order.

Proof:

The if part is quite streightfoward For the only if part, suppose the singular value decompositions of M and M arewe haveBecause , the singular value decomposition of the matrix DQQ′TD must be DQQ′TD = XTDY, where D contains the first L singular values of . Therefore, we havewith and . Q.E.D. Observation 2 turns the separable problem of a compound system to the question of how to decompose the correlation matrix into a product of other two nontrivial matrices, i.e. , with constraints and . Theorem 1 further gives the decomposition conditions, that is: (1) The left singular vectors of M and M agree with the left and right singular vectors of (i.e. Eqs (8 and 9)); (2) The right singular vectors of M and M, and their singular values satisfy Eq. (10). For condition 1, we may rotate the orthogonal bases of particle A and B to and respectively, where becomes a diagonal matrix. While for condition 2, we need to solve Eq. (10), which makes the singular values of matrices , M, and M correlated. Before proceeding to the Eq. (10), two prerequisite lemmas are necessary. Let I, J, K be certain subsets of natural numbers {1, …, n} with the same cardinality r, i.e., I = {i1, i2, …, i}, J = {j1, j2, …, j}, and K = {k1, k2, …, k}, where the elements are arranged in increasing order so that ; , and . Define , and let the triplet , then we are legitimate to introduce a triple set defined as:

Lemma 1.

A triplet (I, J, K) is in if and only if the corresponding triplet (λ, μ, ν) occurs as eigenvalues of the triple of r by r Hermitian matrices, with the third to be the sum of the first two. This lemma appears as Theorem 2 of ref.[29], where the practical methods on how to generate were also discussed, i.e., via the Horn’s inductive procedure or Littlewood-Richardson coefficients.

Lemma 2.

A triplet ({a}, {b}, {c}) occurs as singular values of n by n real matrices A, B, and C(C = AB) if and only iffor all (I, J, K) in and all r < n. This is known as the multiplicative Horn’s problem, see theorem 16 of ref.[29] for details. Historically, the multiplicative Horm’s problem first appeared as the Thompson’s conjecture[30], and later was found can be solved for invertible matrices[31]. It was found to be true for real matrices[32], and even extendable to the case of non-invertible matrices recently[21] (see Supplemental Material for a brief review of the proof). The decomposition of Eq. (10) can be realized through the following theorem:

Theorem 2.

There exists a real orthogonal matrix Q such that DQDhas the singular values of D, if and only if the following is satisfiedfor all and r < L. Theorem 2 is a direct application of Lemma 2. For a given bipartite state whose correlation matrix is known, the Eq. (16) applies to all possible singular values of the matrices decomposed from , and behaves as trade-off relations among them. The singular values of M and M are determined by their column vectors, i.e. and , whose norms relate to the mixedness (or quantumness) of the subsystems, i.e. and . Large τ implies large α or β or both. When column vectors and surpass the Bloch vectors of density matrices in lengths, the quantum state is entangled. The quantum state is separable only when the two factor matrices are composed of Bloch vectors of physical states. In the following we demonstrate our method in bipartite quantum system as an example. For more systematic and detailed applications, readers may refer to ref.[25]. It should be noted that theorems 1 and 2 are also suitable to the bi-separability of arbitrary multipartite states, and hence the method presented here is also applicable to the multi-separability problem, due to the reason that the Bloch representation generally turns the sum decomposition problem into a product decomposition one.

Applications

In Bloch representation of quantum state, we have the following two observations:

Observation 3.

If is a Bloch vector of a density matrix, then the , whose components corresponding to those SU(N) generators satisfying , is also a Bloch vector of a density matrix.

Observation 4.

If the norm of a Bloch vector with dimension (N2 − 1) satisfies , then is also a Bloch vector for arbitrary rotation P ∈  SO(N2 − 1). Here, the Observation 3 is established due to the fact that the transposition of a positive semidefinite Hermitian matrix keeps on being positive semidefinite, while the Observation 4 is just a corollary of Eq. (11) in ref.[14] (or see ref.[33]). In the following, we demonstrate how the criterion works through concrete examples.

Example I:

The relationship between Vicente’s criterion[14] and ours A subset inequalities of Eq. (16) goes as follows (see theorem 3.3.4 of ref.[34]): Employing Ky Fan matrix norm and Schwarz inequality , we have:

Corollary 1.

The average square norms of the local states’ Bloch vectors are lower bounded by Ky Fan norm of the correlation matrix Eq. (17) leads to (see Corollary 3.3.10 of ref.[34]) The Ky Fan norm of is The Frobennius norm for real matrices are , so we haveQ.E.D. Because and , we haveTaking Eq. (22) into Corollary 1, Theorem 1 of ref.[14] is arrived. On the other hand, from Observation 4 we have the following:

Corollary 2.

If , the quantum state is separable. Suppose that with rank(T) = l ≥ 1, when working in the bases of and , we may construct the following matrix equationHere, Q ∈ SO(l + 1) with elements in the last row being ; p ≥ 0, and . Choosing , , and , we have Comparing Eq. (23) with , we can get the Bloch vectors and where j ∈ {1, …, l + 1} and the norms are We may set the probability distribution p to be . Then replacing the p in Eqs (27, 28), we have According to Observation 4, the Corollary 2 is then established. Q.E.D. Corollary 2 agrees with the Proposition 3 of ref.[14] where M and N are dimensions of the subsystems. Here, in proof of Corollary 2, explicit separable decomposition of into M and M with also exhibits.

Example II:

The relation with PPT [5] scheme The partial transposition of a bipartite density matrix corresponds to the sign flips of columns or rows (not both) of , whose indices are that of skew symmetric generators, i.e., . The Observation 3 implies that the PPT criterion is necessary for separability. Conversely, the positivity of partially transposed density matrix generally does not imply separability, that is, PPT is not sufficient. However, for qubit-qubit system, calculation indicates that the PPT of density operators gives by means of the technique introduced in ref.[35] (see Supplemental Material). As , according to the Corollary 2, PPT also tells separability. Therefore it is a necessary and sufficient condition for qubit-qubit system, which agrees with the conclusionn proved by other method[6].

Example III:

For generalized Werner state and isotropic state

The relation between the Werner state and the isotropic state

The generalized Werner state and isotropic state in the Bloch vector representation read[14]:where S1 represents the symmetric generators of , and S2 denotes the skew symmetric generators of . The partial transposition operation correlates the Werner state with isotropic states. According to Observation 3, we may readily find that the parameters in Eqs (30 and 31) satisfiesEquation (32) tells us that, when considering the separability, only one of the two states need to be taken into account. Before proceeding to the separable decomposition, we first present serval straightforward but interesting results from Eq. (32): (1) The positivity condition of ρISO[36] implies that ρW is entangled when ϕ < 0; (2) The positivity condition ϕ ≤ 1 of ρW implies that ρISO is entangled when ; (3) If ρW is separable at 0 ≤ ϕ ≤ 1 then ρISO is separable at .

Separable decomposition of the Werner state

Considering the Werner state with and , there must be at least Bloch vectors in both M and M, due to the additional constraints and . Based on Theorem 2, we may construct M and M as follows:Here, ; Q ∈ SO(N2) whose elements in last row are which ensures . Since the singular values of are all equal, we may set , , and ; hence have The sets and form two N2-simplexes (or hypertetrahedron) each of which lies in the (N 2 − 1)-dimensional Bloch vector space of particles A and B. The angles between any two of the Bloch vectors fulfilEquation (36) agrees with the requirement for pure state: angle θ between any two pure states must satisfy (see the Eq. (12) of ref.[37]) As being true for qubit and numerically verified for qutrit systems, we are tempted to make the following conjecture:

Conjecture 1.

There exists an -simplex with circumradius , which fits into the convex hall of the ( − 1)-dimensional Bloch vector space of N-dimensional mixed states.

The separable decomposition for maximum value of

Conjecture 1 leads to a solution to the open problem of finding separable decompositions of all separable Werner states in any dimension[38]. Inputting (35) to constraints for Bloch vectors, i.e. (the equality holds for pure state), we haveBecause , Eq. (38) leads to Inputting (33) and (34) into we haveCombining of Eqs (39) and (40) leads toThe value of ϕ = 1 for ρ has the decomposition of two N2-simplexes in the N2 − 1 dimensional Bloch vector spaces of particles A and B, i.e.

The separable decomposition for minimum value of

If is separable when ϕ = 1, and decomposes aswith and being Bloch vectors for pure state, then for , shall be written aswhere . If in Eq. (43) are Bloch vectors of pure state, in Eq. (44) can not be physical Bloch vectors for pure state according to Eq. (37)except for the qubit case of N = 2, where Bloch vectors of density matrix form a three dimensional ball. Therefore, the lower limit of ϕ is not except for the qubit case. Now, suppose one of the two particles having Bloch vectors satisfying Observation 4, i.e. (or , but not both), by the procedure of Eqs (38) to (40), we haveTherefore the separable decomposition for ϕ = 0 readswhere and . The separable decomposition of Eq. (47) corresponds to two N2-simplexes: a smaller one composed with and a larger one composed with . The smaller one satisfies reflection symmetry: because it lies in the Ball of , both and are Bloch vectors of density matrices.

Discussion

We have presented an applicable and operational necessary and sufficient criterion for the separability of bipartite mixed state. The criterion is exhibited in a finite set of inequalities relating the correlation matrix to the Bloch vectors of the quantum states of subsystems, which is shown to be complete by exploring the multiplicative Horn’s problem. These inequalities may be treated as trade-off relations between the quantumness of the constituent parts, balanced by the correlation matrix. A state is separable if the decomposition can be performed within the convex hulls of the Bloch vectors of subsystems. As an illustration, separable decompositions for generalized Werner state and isotropic state are achieved in according to the new scheme. The proposed criterion sets up a geometric boundary in between the separability and entanglement for compound system, and provides a new perspective on the nonlocal nature of entanglement. Supplemental Material
  5 in total

1.  Separability Criterion for Density Matrices.

Authors: 
Journal:  Phys Rev Lett       Date:  1996-08-19       Impact factor: 9.161

2.  Local unitary classification of arbitrary dimensional multipartite pure states.

Authors:  Bin Liu; Jun-Li Li; Xikun Li; Cong-Feng Qiao
Journal:  Phys Rev Lett       Date:  2012-01-31       Impact factor: 9.161

3.  Covariance matrices and the separability problem.

Authors:  O Gühne; P Hyllus; O Gittsovich; J Eisert
Journal:  Phys Rev Lett       Date:  2007-09-28       Impact factor: 9.161

4.  Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model.

Authors: 
Journal:  Phys Rev A Gen Phys       Date:  1989-10-15

5.  Improved Separability Criteria Based on Bloch Representation of Density Matrices.

Authors:  Shu-Qian Shen; Juan Yu; Ming Li; Shao-Ming Fei
Journal:  Sci Rep       Date:  2016-06-28       Impact factor: 4.379

  5 in total
  1 in total

1.  Correlation minor norms, entanglement detection and discord.

Authors:  Bar Y Peled; Amit Te'eni; Avishy Carmi; Eliahu Cohen
Journal:  Sci Rep       Date:  2021-02-02       Impact factor: 4.379

  1 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.