Abstract
We consider bipartite mixed states ρ in a quantum system. We say that ρ is PPT if its partial transpose is positive semidefinite, and otherwise ρ is NPT. The well-known Werner states are divided into three types: (a) the separable states (the same as the PPT states); (b) the one-distillable states (necessarily NPT); and (c) the NPT states which are not one-distillable. We give several different formulations and provide further evidence for the validity of the conjecture that Werner states of type (c) are not two-distillable.
1. Introduction
Let be the Hilbert space for the quantum system consisting of two parties, A and B (Alice and Bob). We assume that the Hilbert spaces and have the same finite dimension, which we denote by d. A product state is a tensor product of the states and of the first and second party, respectively. A bipartite state ρ is separable if it can be written as a convex linear combination of product states. We say that a bipartite state is entangled if it is not separable. We say that ρ is PPT if its partial transpose , computed in some fixed orthonormal (o.n.) basis of , is a positive semidefinite operator. Otherwise, σ has a negative eigenvalue, and we say that ρ is NPT.
It is more complicated to give the definition of distillability for bipartite states ρ. For that purpose, we have to consider multiple copies of ρ. For k copies, the density matrix is the k-th tensor power which acts on the Hilbert space . We can identify with the tensor product of the Hilbert spaces and . In this way, we can view as a bipartite state. Thus, any vector has its Schmidt decomposition and a well-defined Schmidt rank.
The definition of distillability given below is not the original one, but it is the only one that we are going to use. Replacing the original definition with this one was nontrivial (see [1]).
Definition 1.
For a bipartite state ρ acting on and an integer , we say that ρ is k-distillable if there exists a (non-normalized) pure state of Schmidt rank that is at most two, such that
We say that ρ is distillable if it is k-distillable for some integer .
The entanglement of a state ρ which is not distillable is known as bound entanglement.
If a bipartite state ρ is separable, then it is PPT, i.e., σ is positive semidefinite, and consequently ρ is not distillable. For the same reason, the entangled bipartite PPT states are not distillable, i.e., their entanglement is bound. Equivalently, every distillable bipartite state is necessarily NPT. It is not known whether the converse holds, i.e., whether every bipartite NPT state is distillable. However, it is widely believed that the converse is false. Actually, the following conjecture has been raised in [2,3] (see also [4], (p. 62)).
Conjecture 1.
There exist bipartite NPT states which are not distillable, i.e., bound NPT entanglement exists.
It is known [5] that for each integer , there exist examples of bipartite states which are distillable but not k-distillable.
We fix an o.n. basis , of , and an o.n. basis of for which we use the same notation. The context will make clear which basis is used. After fixing these bases, we can define the flip operator by
The (non-normalized) Werner states on (see [6], Example 1) can be parametrized as follows:
Several different parametrizations of Werner states appear in the literature (see e.g., [6,7,8]). We have chosen the one above because of its simplicity. It is easy to express the parameter used in these and other references in terms of our parameter t.
Let be the maximally entangled (pure) state given by
Its density matrix is the projector
Since is the partial transpose of F, the partial transpose of is
The following facts about the Werner states are well-known.
Proposition 1.
For (a) and (c), see [7] (p. 59) and [9], and, for (b), see [2] (Theorem 2) and [3,8].The Werner states are:
- (a)
- separable for ;
- (b)
- 1-distillable for ;
- (c)
- NPT but not one-distillable for .
From now on, unless stated otherwise, we assume that . (In Section 4, we will consider briefly the case .) The importance of Werner states for the distillability problem for bipartite states was first established in [7].
Proposition 2.
Conjecture 1 is equivalent to the assertion that some NPT Werner states are not distillable.
In fact, the following stronger conjecture is believed to be true [2,3,10].
Conjecture 2.
None of the Werner states , , are distillable.
The above two conjectures have been open for more than 15 years. In order to stimulate further research related to these conjectures, we propose yet another one. Namely, we shall consider a very weak version of Conjecture 2.
Conjecture 3.
None of the Werner states , , are 2-distillable.
For the k-distillability problem, the following fact [2] (Lemma 4) is useful.
Proposition 3.
If is not k-distillable, then none of the states , , is k-distillable.
In view of this proposition, it suffices to prove Conjecture 3 for only. Extensive numerical evidence for the validity of this conjecture in the case is presented in [2,3,8] and [11]. In [11], it is also claimed that their numerical proof is rigorous. The case was analyzed in [12], but it remains open.
For an alternative approach to Conjecture 1, see the very recent paper [13]. Actually, the authors of that paper study the positive linear maps between matrix algebras which remain positive under tensoring of n copies of themselves for each . Completely positive and completely co-positive linear maps are trivial examples. They show that the existence of non-trivial examples implies the existence of bound NPT entanglement. Moreover, they construct a one-parameter family of candidates for non-trivial maps of that kind, which is reminiscent of the family of Werner states.
Our paper is organized as follows. In Section 2, we construct a hermitian biquadratic form Φ and show that Conjecture 3 is equivalent to Φ being positive semidefinite, . The form Φ depends on arbitrary vectors and , .
In Section 3, we obtain a formula which expresses Φ as a function of four matrices of order d, where , etc. From that formula, we deduce that Φ is invariant under an action of the product of two copies of the unitary group .
In Section 4, we compute the matrix of Φ when the latter is viewed as a hermitian quadratic form in the complex entries of U and V. The entries of X and Y play the role of parameters. Conjecture 3 is equivalent to the claim that . After partitioning H into four square blocks of order , we show that the two diagonal blocks are positive definite matrices. We reduce the task of proving that to the case where X is a diagonal matrix with positive diagonal entries. In the case , we prove that .
In Section 5, we prove that, for any d, when X and Y are diagonal matrices. We point out that is not diagonal even when both X and Y are. Since this is done for arbitrary d, and the proof is nontrivial, we view this fact as an important piece of evidence for the validity of Conjecture 3.
In Section 6, we prove that the inequality is equivalent to , where . Hence, it suffices to prove the inequality when X is singular.
In Section 7, we consider the case . To prove that , we may assume that X is singular. Hence, X has rank 1 or 2. We prove that when X has rank 1. We also show that the leading principal minor of H of order 10 is a positive semidefinite polynomial.
The superscripts *, T and † denote the complex conjugation, the transposition and the adjoint, respectively. We denote by the algebra of complex matrices of order m, and by the identity matrix of .
2. The Hermitian Biquadratic Form Φ
Since we are going to use only one Werner state, the one for , we set
Conjecture 3 is equivalent to the claim that the inequality
is valid for all of Schmidt rank . Such can be written as , where
Note that while . We point out that we do not require to be the Schmidt decomposition of , i.e., we do not require that . The reason for this is to allow the vectors to be completely arbitrary.
We can rewrite and as
The vectors and live in Alice’s second copy of , while and live in Bob’s second copy of . The summation is taken over all i and j in . Consequently, we can view the left-hand side (LHS) of Equation (3) as a function of vectors :
As
we have
where
After the substitution , each of the breaks up into four pieces. For instance, we have
We have computed each of the resulting 16 pieces. For instance, the second piece, say E, in the above formula for , is computed as follows. We first observe that if or . Thus, we have
The final formulas are:
These formulas show that each , viewed as a function of the components of the and , is a hermitian quadratic form. The same is true when we view them as functions of the components of the and . Hence, we shall refer to the (and Φ) as hermitian biquadratic forms. The next proposition follows immediately from Equation (3) and the definition of the form Φ.
Proposition 4.
Conjecture 3 is equivalent to the assertion that .
3. Φ as a Function of Four Matrices
Let X denote the matrix whose successive columns are the vectors . Define similarly the matrices , and V. Let denote the space of complex matrices of order d. Define the inner product on by . For the corresponding norm, we have . The tensor product of matrices and B is defined as the block-matrix .
Now the formulas for Φ can be rewritten in terms of the matrices and V. We obtain that
where ℜ stands for “the real part of”.
The first expression can be further simplified by using the standard Frobenius norm on the tensor product of matrices
The third expression also simplifies to
Consequently, we have
The next proposition follows immediately from the above formulas.
Proposition 5.
The identity
holds true for arbitrary and .
4. The Matrix of the Form Φ
We shall consider the entries of X and Y as parameters and those of U and V as complex variables. Then, Φ (and each ) becomes a family of hermitian quadratic forms depending on the mentioned parameters. Let and , , be the matrices of the corresponding forms Φ and . These are hermitian matrices of order .
For any complex matrix Z, let denote the column vector obtained by writing the columns of Z one below the other starting with the first column, then the second, etc. Now, we can express the relationship between the form Φ and its matrix H by the formula
By using the formulas given in Section 2, we obtain the following simple formulas:
for the matrices . Those for and are obvious. We omit the tedious but straightforward verification of the formulas for and .
For H, we obtain the formula
and for its trace
In view of Proposition 4, we can restate Conjecture 3 in the following equivalent form.
Conjecture 4.
.
If , and we replace X and Y with and , respectively, then the undergo the transformation . In fact, and remain fixed under this transformation.
Similarly, if , and we replace X and Y with and , respectively, then the undergo the transformation . This time, and remain fixed. In the case of , one should use the formulas
which are not hard to verify.
Hence, the following proposition holds.
Proposition 6.
For , we have
Thanks to this proposition (or Proposition 5) we can simplify the task of proving Conjecture 4. Indeed, it suffices to prove this conjecture when the matrix X is diagonal and its diagonal entries are positive.
Let us partition into four square blocks of size . The first diagonal block depends only on X and the second one only on Y. By using Equation (11) and the formulas (7)–(9), we obtain that
where
and .
If X and Y are nonzero matrices, then the two diagonal blocks in Equation (14) are positive definite matrices. This is shown in the next proposition.
Proposition 7.
If then .
Proof.
By Proposition 5, we may assume that with . Let . It follows from Equation (15) that , where
is a diagonal matrix with the diagonal entries
Since
for all , we have . As , we have . If , then all and so . Otherwise, for and is a diagonal matrix with positive diagonal entries. Hence, again . ☐
The matrix H has order , but one can reduce the proof of Conjecture 4 to matrices of order . This does not come for free since the smaller matrix will have a more complicated structure. Recall that we may assume that X is a diagonal matrix with positive diagonal entries. For simplicity, we set , and t in Equation (14). Since , it suffices to show that , see e.g., [14] (Proposition 8.2.3). (As X is diagonal, one can easily compute .) Proving that may be somewhat easier than proving that . We shall use this simplification to handle the case below.
Recall that by the assumption made earlier, but Conjecture 4 also makes sense for and . However, in these two cases, the determinant of is identically 0. For , we have and the conjecture is obviously valid. It is also valid for .
Proposition 8.
Conjecture 4 is true for .
Proof.
We may assume that with . Let , and let us partition H as in Equation (14) and set again , and . Let be the characteristic polynomial of . A computation shows that . Set
After some tedious computations, we found the following formulas for the :
Since , we conclude that all coefficients . Hence, (see e.g., [14] (Proposition 8.2.6)). ☐
We shall consider the case in Section 7.
5. The Diagonal Case
We say that a matrix pair is generic if the matrices X and Y are linearly independent and some linear combination of them is nonsingular.
In this section, we prove that when both X and Y are diagonal matrices, while d is arbitrary. This appears to be a trivial case, but it is not so as is not diagonal even if X and Y are. We prove a slightly stronger result.
Theorem 1.
If is a generic pair of diagonal matrices, then .
Proof.
We denote the diagonal entries of X and Y by and respectively. The hypothesis implies that or for each k. After replacing H with where Π is a suitable permutation matrix, H becomes direct sum of blocks of order 2 and an additional block of order . It suffices to show that each of these blocks is positive definite.
The blocks of order 2 are indexed by the integers , where and . For such index p, the corresponding block of order 2 is the principal submatrix of the original matrix H corresponding to indices p and . Explicitly, we have
where for and . Each matrix on the right-hand side is positive semidefinite of rank 1. If is singular, then all of these matrices must be singular and must have the same kernel. This contradicts the linear independence of X and Y. Hence, must be positive definite.
It remains to consider the block B of size , i.e., the principal submatrix of H corresponding to the indices and for . We have , where denotes the corresponding principal submatrix of . Let us first consider the matrix . After a suitable simultaneous permutation of rows and columns, breaks up into the direct sum of d blocks of order 2, where . Explicitly, we have
Each is positive semidefinite of rank 1 or 2. Thus, in the decomposition , we have and . If all , then , and so .
It remains to consider the case where some , say , is singular. By Cauchy–Schwarz inequality, the vectors and are linearly dependent. It follows that all other must be positive definite. Consequently, the nullspace of is one-dimensional and is spanned by the column vector having all components 0 except the first which is and -th which is . This vector is not killed by , because . Hence, we conclude that . ☐
Corollary 1.
Conjecture 4 is valid when X and Y are diagonal matrices.
Proof.
This follows from the theorem because any pair of diagonal matrices can be approximated by a generic pair of diagonal matrices. ☐
6. Reduction to the Singular Case
Let us show that satisfies yet another identity. Let
and
By using
we deduce that
Consequently, Equation (4) implies that
It suffices to prove the inequality for generic pairs only. If is generic, we can choose such that is a singular matrix. Thus, the identity Equation (18) shows that it suffices to prove when X is singular and Y is invertible.
Yet another conjecture, which is simpler and stronger than Conjecture 4, may be of interest. Let us introduce the real valued polynomial . By taking the determinants in Equation (13), we obtain that
From Equation (18), we deduce that
is valid when Λ is invertible. Since both sides are polynomials, this identity must be valid for arbitrary Λ.
Note that for all matrices X. More generally, we claim that if X and Y are linearly dependent. Indeed, it suffices to choose a matrix Λ as in Equation (16) such that and apply Equation (20). The converse of this claim is false, but we conjecture that it is true in a weaker form.
Conjecture 5.
If , then for generic .
Theorem 1 shows that this conjecture is true when the matrices X and Y are diagonal. As this conjecture deals with only one polynomial and has no positivity conditions whatsoever, it should be much easier to prove (or disprove).
Proposition 9.
Conjecture 4 is a consequence of Conjecture 5.
Proof.
Let and be any matrices in . We have to show that is positive semidefinite. Clearly, it suffices to prove this when the pair is generic. Let be a generic pair of diagonal matrices. Then, is positive definite by Theorem 1. Consequently, , and all eigenvalues of are positive. We can join the pairs and by a continuous path , , such that is generic for each t. By Conjecture 5, for all t. Hence, has no zero eigenvalues. Since the eigenvalues of are continuous functions of t, and they are all positive for , they must all remain positive for all values of t. In particular, this is true for . We thus conclude that is positive definite. ☐
7. The Case
In this section, we consider only the case . As mentioned earlier, in order to prove that , it suffices to do that in the case when X is singular. Thus, the rank of X is 1 or 2. We shall prove the inequality in the case when this rank is 1.
Proposition 10.
If , and some linear combination of X and Y has rank one, then .
Proof.
We may assume that X and Y are linearly independent and that X has rank one. Since we can multiply X by a nonzero scalar, by applying Proposition 6, we may assume that
By applying the same proposition, we may also assume that
where .
We partition the matrix as in Equation (14) and set , , . As explained in Section 4, it suffices to show that the matrix is positive semidefinite. Let
be the characteristic polynomial of S. The are polynomials in the real variables and the complex variables and their conjugates . (The variable a does not occur.)
Set , where for and . Then, the are polynomials with integer coefficients. All these computations were performed by using Maple since the may have several thousand terms. We claim that the polynomials are positive semidefinite, i.e., they have nonnegative values for all real and all complex . The inequality is a consequence of this claim.
To prove our claim, we construct positive semidefinite polynomials , , such that the difference is also a positive semidefinite polynomial. We have . The other are given in the Appendix. The are obviously positive semidefinite. The proof that the differences are positive semidefinite requires the use of Maple (or some other software for symbolic algebraic computations). We just expand and check that all coefficients are nonnegative integers and all monomials that occur in the expansion are hermitian squares. For instance, we have
☐
As an aside, we mention that in the case when
where and , the leading principal minor of H of order 10 is a positive semidefinite polynomial. This follows from the following explicit expression for as a sum of squares of real polynomials:
where
and
Note that the equality implies that Y is a scalar multiple of X.
8. Results and Discussion
We consider the question whether the Werner states , , where F is the flip operator, are two-distillable. The question whether these states are distillable has been considered previously in references [2,8,11,12], and it has been conjectured that they are not distillable, which implies that they are not two-distillable. All evidence so far supports Conjecture 3 saying that these states are not two-distillable. We present in this paper a novel method to attack this conjecture, and we obtain further evidence for its validity. In view of the well-known fact stated as Proposition 3, it suffices to prove Conjecture 3 for only.
We first construct a hermitian biquadratic form depending on vectors and vectors and show that Conjecture 3 is equivalent to Φ being positive semidefinite.
Next, we organize the vectors into the matrix , and, similarly, we construct the matrices from the remaining vectors. It turns out that the form Φ has relatively simple expression Equation (4) in terms of the matrices . By using this expression, we deduce that Φ is invariant under the action of the product of two copies of the unitary group . More precisely, is invariant under the transformation, which sends
where .
If we fix the matrices X and Y, then becomes an ordinary hermitian quadratic form in the complex entries of the matrices U and V. We compute the matrix of this hermitian quadratic form (see the formula (11)). Then, Conjecture 3 reduces to the claim that for all matrices .
Let be complex numbers such that . We prove in Proposition 6 that if and only if . We can choose such so that the matrix becomes singular. Hence, it suffices to prove the inequality when X is singular. By using the action of , we can additionally assume that X is a diagonal matrix with nonnegative diagonal entries.
Even when both X and Y are diagonal matrices, the matrix is not diagonal in general. However, we did prove that in that case (see Theorem 1). Since this is true for any d and the proof is nontrivial, we view this fact as an important piece of evidence for the validity of Conjecture 3 in the general case.
Recall that is a hermitian matrix of order . After partitioning H into four square blocks of order , we show that the two diagonal blocks are positive definite matrices (assuming that X and Y are nonzero matrices). By using the four blocks of H, one can easily construct a hermitian matrix S of order such that if and only if . By using this trick, we proved by brute force that is true in the case . This also follows from the fact that is separable when .
Assume now that . Since we may assume that X is singular, its rank is 1 or 2. We prove that when X has rank 1. This is done by using the above mentioned trick which replaces H by S, which is of order 9. We compute the characteristic polynomial of S and prove that by showing that this polynomial has no negative roots. We also show that the leading principal minor of H of order 10 is a positive semidefinite polynomial.
To finish off the case , it remains to consider the case when the matrix X has rank 2. We may assume that X is a diagonal matrix with the diagonal entries , and . We were not able to compute the characteristic polynomial of S. Then, we made the additional assumption that Y is real. By subtracting a multiple of X from Y, we can also assume that the first entry of Y vanishes. After these simplifications, we succeeded with computing the determinant of S. Its denominator is
The numerator is a (non-homogeneous) polynomial of degree 36 in nine real variables, having 487,056 terms. We stopped at this point, short of reaching our goal to write this numerator as a sum of squares.
9. Conclusions
The old conjecture that the bipartite bound NPT entanglement exists is still open. We have proposed a much simpler conjecture that, in , the NPT Werner states which are not one-distillable are also not two-distillable. We have reformulated this conjecture in several different ways and provided new evidence for its validity, especially for .
Acknowledgments
I would like to thank the referees for their valuable comments and suggestions. Supported in part by the National Sciences and Engineering Research Council of Canada (NSERC) Discovery Grant 5285-2012.
Conflicts of Interest
The author declares no conflict of interest.
Appendix
We list here the polynomials , , used in Section 7.
References
- Horodecki, M.; Horodecki, P.; Horodecki, R. Mixed-state entanglement and distillation: Is there a “bound” entanglement in nature? Phys. Rev. Lett. 1998, 80, 5239–5242. [Google Scholar] [CrossRef]
- DiVincenzo, D.P.; Shor, P.W.; Smolin, J.A.; Terhal, B.M.; Thapliyal, A.V. Evidence for bound entangled states with negative partial transpose. Phys. Rev. A 2000, 61, 062312. [Google Scholar] [CrossRef]
- Dür, W.; Cirac, J.I.; Lewenstein, M.; Bruß, D. Distillability and partial transposition in bipartite systems. Phys. Rev. A 2000, 61, 062313. [Google Scholar] [CrossRef]
- Horodecki, P.; Horodecki, R. Distillation and bound entanglement. Quantum Inf. Comput. 2001, 1, 45–75. [Google Scholar]
- Watrous, J. Many copies may be required for entanglement distillation. Phys. Rev. Lett. 2004, 93, 010502. [Google Scholar] [CrossRef]
- Vollbrecht, K.G.H.; Werner, R.F. Entanglement measures under symmetry. Phys. Rev. A 2001, 64, 062307. [Google Scholar] [CrossRef]
- Horodecki, M.; Horodecki, P. Reduction criterion of separability and limits for a class of distillation protocols. Phys. Rev. A 1999, 59, 4206–4216. [Google Scholar] [CrossRef]
- Lewenstein, M.; Bruß, D.; Cirac, J.I.; Kraus, B.; Kuś, M.; Samsonowicz, J.; Sanpera, A.; Tarrach, R. Separability and distillability in composite quantum systems-a primer. J. Mod. Opt. 2000, 47, 2481–2499. [Google Scholar] [CrossRef]
- Rungta, P.; Munro, W.J.; Nemoto, K.; Feauar, P.; Milburn, G.J.; Caves, C.M. Qudit Entanglement. In Directions in Quantum Optics; Springer: Berlin/Heidelberg, Germany, 2001; pp. 149–164. [Google Scholar]
- Clarisse, L. The distillability problem revisited. Quantum Inf. Comput. 2006, 6, 539–560. [Google Scholar]
- Vianna, R.O.; Doherty, A.C. Distillability of Werner states using entanglement witnesses and robust semidefinite programs. Phys. Rev. A 2006, 74, 052306. [Google Scholar] [CrossRef]
- Pankowski, Ł.; Piani, M.; Horodecki, M.; Horodecki, P. A few steps more towards NPT bound entanglement. IEEE Trans. Inf. Theory 2010, 56, 4085–4100. [Google Scholar]
- Müller-Hermes, A.; Reeb, D.; Wolf, M.M. Positivity of linear maps under tensor powers. J. Math. Phys. 2016, 57, 015202. [Google Scholar] [CrossRef]
- Bernstein, D.S. Matrix Mathematics: Theory, Facts, and Formulas With Applications to Linear Systems Theory; Princeton University Press: Princeton, NJ, USA, 2005. [Google Scholar]
© 2016 by the author; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC-BY) license (http://creativecommons.org/licenses/by/4.0/).