Next Article in Journal
Experimental Study of Single Phase Flow in a Closed-Loop Cooling System with Integrated Mini-Channel Heat Sink
Next Article in Special Issue
Novel Criteria for Deterministic Remote State Preparation via the Entangled Six-Qubit State
Previous Article in Journal
General Bulk-Viscous Solutions and Estimates of Bulk Viscosity in the Cosmic Fluid
Previous Article in Special Issue
Multiphoton Controllable Transport between Remote Resonators
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Two-Distillable Werner States

by
Dragomir Ž. Đoković
1,2
1
Department of Pure Mathematics, University of Waterloo, Waterloo, ON N2L 3G1, Canada
2
Institute for Quantum Computing, University of Waterloo, Waterloo, ON N2L 3G1, Canada
Entropy 2016, 18(6), 216; https://doi.org/10.3390/e18060216
Submission received: 7 April 2016 / Revised: 23 May 2016 / Accepted: 30 May 2016 / Published: 2 June 2016
(This article belongs to the Special Issue Quantum Information 2016)

Abstract

:
We consider bipartite mixed states ρ in a d d quantum system. We say that ρ is PPT if its partial transpose 1 T ( ρ ) 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 H = H A H B be the Hilbert space for the quantum system consisting of two parties, A and B (Alice and Bob). We assume that the Hilbert spaces H A and H B have the same finite dimension, which we denote by d. A product state is a tensor product ρ A ρ B of the states ρ A and ρ B 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 σ = 1 T ( ρ ) , computed in some fixed orthonormal (o.n.) basis of H B , 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 ρ k which acts on the Hilbert space H k . We can identify H k with the tensor product of the Hilbert spaces H A k and H B k . In this way, we can view ρ k as a bipartite state. Thus, any vector | ψ H k 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 H and an integer k 1 , we say that ρ is k-distillable if there exists a (non-normalized) pure state | ψ H k of Schmidt rank that is at most two, such that
ψ | σ k | ψ < 0 , σ = 1 T ( ρ ) .
We say that ρ is distillable if it is k-distillable for some integer k 1 .
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 k 1 , there exist examples of bipartite states which are distillable but not k-distillable.
We fix an o.n. basis | i , i = 1 , 2 , , d of H A , and an o.n. basis of H B 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 F : H H by
F = i , j | i , j j , i | .
The (non-normalized) Werner states on H (see [6], Example 1) can be parametrized as follows:
ρ W ( t ) = 1 t F , 1 t 1 .
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 | ψ max H be the maximally entangled (pure) state given by
| ψ max = 1 d i | i , i .
Its density matrix is the projector
P = 1 d i , j | i , i j , j | .
Since d P is the partial transpose of F, the partial transpose of ρ W ( t ) is
σ W ( t ) = 1 t d P .
The following facts about the Werner states are well-known.
Proposition 1. 
The Werner states ρ W ( t ) are:
(a) 
separable for 1 t 1 / d ;
(b) 
1-distillable for 1 / 2 < t 1 ;
(c) 
NPT but not one-distillable for 1 / d < t 1 / 2 .
For (a) and (c), see [7] (p. 59) and [9], and, for (b), see [2] (Theorem 2) and [3,8].
From now on, unless stated otherwise, we assume that d 3 . (In Section 4, we will consider briefly the case d = 2 .) 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 ρ W ( t ) are not distillable.
In fact, the following stronger conjecture is believed to be true [2,3,10].
Conjecture 2. 
None of the Werner states ρ W ( t ) , 1 / d < t 1 / 2 , 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 ρ W ( t ) , 1 / d < t 1 / 2 , are 2-distillable.
For the k-distillability problem, the following fact [2] (Lemma 4) is useful.
Proposition 3. 
If ρ W ( 1 / 2 ) is not k-distillable, then none of the states ρ W ( t ) , 1 / d < t < 1 / 2 , is k-distillable.
In view of this proposition, it suffices to prove Conjecture 3 for t = 1 / 2 only. Extensive numerical evidence for the validity of this conjecture in the case d = 3 is presented in [2,3,8] and [11]. In [11], it is also claimed that their numerical proof is rigorous. The case d = 4 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 n = 2 , 3 , . 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, Φ 0 . The form Φ depends on 4 d arbitrary vectors x i , y i H A and u i , v i H B , i = 1 , 2 , , d .
In Section 3, we obtain a formula which expresses Φ as a function of four matrices X , Y , U , V of order d, where X = [ x 1 x 2 x d ] , etc. From that formula, we deduce that Φ is invariant under an action of the product of two copies of the unitary group U ( d ) .
In Section 4, we compute the matrix H = H ( X , Y ) of Φ when the latter is viewed as a hermitian quadratic form in the 2 d 2 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 H 0 . After partitioning H into four square blocks of order d 2 , we show that the two diagonal blocks are positive definite matrices. We reduce the task of proving that H 0 to the case where X is a diagonal matrix with positive diagonal entries. In the case d = 2 , we prove that H 0 .
In Section 5, we prove that, for any d, H ( X , Y ) 0 when X and Y are diagonal matrices. We point out that H ( X , Y ) 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 H ( X , Y ) 0 is equivalent to H ( α X + β Y , γ X + δ Y ) 0 , where α δ β γ 0 . Hence, it suffices to prove the inequality H ( X , Y ) 0 when X is singular.
In Section 7, we consider the case d = 3 . To prove that H ( X , Y ) 0 , we may assume that X is singular. Hence, X has rank 1 or 2. We prove that H ( X , Y ) 0 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 M m the algebra of complex matrices of order m, and by I m the identity matrix of M m .

2. The Hermitian Biquadratic Form Φ

Since we are going to use only one Werner state, the one for t = 1 / 2 , we set
ρ W = ρ W ( 1 / 2 ) = 1 F / 2 , σ W = σ W ( 1 / 2 ) = 1 d P / 2 .
Conjecture 3 is equivalent to the claim that the inequality
ψ | σ W 2 | ψ 0
is valid for all | ψ H 2 of Schmidt rank 2 . Such | ψ can be written as | ψ = | ψ 1 + | ψ 2 , where
| ψ 1 = | x | u , | ψ 2 = | y | v .
Note that | x , | y H A H A while | u , | v H B H B . We point out that we do not require | ψ 1 + | ψ 2 to be the Schmidt decomposition of | ψ , i.e., we do not require that x | y = u | v = 0 . The reason for this is to allow the vectors | x , | y , | u , | v to be completely arbitrary.
We can rewrite | ψ 1 and | ψ 2 as
| ψ 1 = i , j | i , j , x i , u j , | ψ 2 = i , j | i , j , y i , v j .
The vectors | x i and | y i live in Alice’s second copy of H A , while | u i and | v i live in Bob’s second copy of H B . The summation is taken over all i and j in { 1 , 2 , , d } . Consequently, we can view the left-hand side (LHS) of Equation (3) as a function of 4 d vectors x i , y j , u r , v s :
Φ ( x 1 , , x d , y 1 , , y d , u 1 , , u d , v 1 , , v d ) = ψ | σ W 2 | ψ .
As
σ W 2 = 1 1 2 ( 1 d P + d P 1 ) + 1 4 d P d P ,
we have
Φ = Φ 1 1 2 ( Φ 2 + Φ 3 ) + 1 4 Φ 4 ,
where
Φ 1 = ψ | ψ , Φ 2 = ψ | 1 d P | ψ , Φ 3 = ψ | d P 1 | ψ , Φ 4 = ψ | d P d P | ψ .
After the substitution | ψ = | ψ 1 + | ψ 2 , each of the Φ k breaks up into four pieces. For instance, we have
Φ 2 = i , j , r , s i , j , x i , u j | 1 d P | r , s , x r , u s + i , j , r , s i , j , x i , u j | 1 d P | r , s , y r , v s + i , j , r , s i , j , y i , v j | 1 d P | r , s , x r , u s + i , j , r , s i , j , y i , v j | 1 d P | r , s , y r , v s .
We have computed each of the resulting 16 pieces. For instance, the second piece, say E, in the above formula for Φ 2 , is computed as follows. We first observe that i , j , x i , u j | 1 d P | r , s , y r , v s = 0 if r i or s j . Thus, we have
E = i , j x i , u j | d P | y i , v j = i , j , r , s x i , u j | r , r s , s | y i , v j = i , j r x i , u j | r , r · s s , s | y i , v j = i , j x i | u j * y i | v j * * .
The final formulas are:
Φ 1 = i x i 2 · j u j 2 + i x i | y i · j u j | v j + i y i | x i · j v j | u j + i y i 2 · j v j 2 , Φ 2 = i , j | x i | u j * | 2 + i , j x i | u j * y i | v j * * + i , j y i | v j * x i | u j * * + i , j | y i | v j * | 2 , Φ 3 = i , j x i | x j u i | u j + i , j x i | y j u i | v j + i , j y j | x i v j | u i + i , j y i | y j v i | v j , Φ 4 = i x i | u i * 2 + i , j x i | u i * y j | v j * * + i , j x i | u i * * y j | v j * + j y j | v j * 2 .
These formulas show that each Φ k , viewed as a function of the components of the x i and y j , is a hermitian quadratic form. The same is true when we view them as functions of the components of the u i and v j . Hence, we shall refer to the Φ k (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 Φ 0 .

3. Φ as a Function of Four Matrices

Let X denote the d × d matrix whose successive columns are the vectors x 1 , , x d . Define similarly the matrices Y , U , and V. Let M d denote the space of complex matrices of order d. Define the inner product on M d by A | B = tr ( A B ) . For the corresponding norm, we have A 2 = tr ( A A ) . The tensor product of matrices A = [ a i j ] and B is defined as the block-matrix A B = [ a i , j B ] .
Now the formulas for Φ can be rewritten in terms of the matrices X , Y , U , and V. We obtain that
Φ 1 ( X , Y , U , V ) = X 2 U 2 + Y 2 V 2 + 2 ( tr ( X Y ) · tr ( U V ) ) , Φ 2 ( X , Y , U , V ) = X T U + Y T V 2 , Φ 3 ( X , Y , U , V ) = tr X T X * U U + X T Y * V U + Y T X * U V + Y T Y * V V , Φ 4 ( X , Y , U , V ) = | tr ( X T U + Y T V ) | 2 ,
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
Φ 1 ( X , Y , U , V ) = X U + Y V 2 .
The third expression also simplifies to
Φ 3 ( X , Y , U , V ) = U X T + V Y T 2 .
Consequently, we have
Φ ( X , Y , U , V ) = X U + Y V 2 1 2 X T U + Y T V 2 + U X T + V Y T 2 + 1 4 tr ( X T U + Y T V ) 2 .
The next proposition follows immediately from the above formulas.
Proposition 5. 
The identity
Φ ( A X B , A Y B , A * U B * , A * V B * ) = Φ ( X , Y , U , V ) ,
holds true for arbitrary X , Y , U , V M d and A , B U ( d ) .

4. The Matrix H 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 Φ k ) becomes a family of hermitian quadratic forms depending on the mentioned parameters. Let H = H ( X , Y ) and H k = H k ( X , Y ) , k = 1 , 2 , 3 , 4 , be the matrices of the corresponding forms Φ and Φ k . These are hermitian matrices of order 2 d 2 .
For any complex matrix Z, let Z ˜ 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
Φ ( X , Y , U , V ) = U ˜ V ˜ H ( X , Y ) U ˜ V ˜ .
By using the formulas given in Section 2, we obtain the following simple formulas:
H 1 = X 2 tr ( X Y ) tr ( Y X ) Y 2 I d 2 ,
H 2 = X X X Y Y X Y Y I d ,
H 3 = I d X * X T I d X * Y T I d Y * X T I d Y * Y T ,
H 4 = X ˜ Y ˜ * · X ˜ Y ˜ T ,
for the matrices H k . Those for H 1 and H 4 are obvious. We omit the tedious but straightforward verification of the formulas for H 2 and H 3 .
For H, we obtain the formula
H ( X , Y ) = H 1 1 2 ( H 2 + H 3 ) + 1 4 H 4 ,
and for its trace
tr H ( X , Y ) = d 1 2 2 X 2 + Y 2 .
In view of Proposition 4, we can restate Conjecture 3 in the following equivalent form.
Conjecture 4. 
H ( X , Y ) 0 , X , Y M d .
If A U ( d ) , and we replace X and Y with A X and A Y , respectively, then the H k undergo the transformation Z ( I 2 d A * ) Z ( I 2 d A T ) . In fact, H 1 and H 2 remain fixed under this transformation.
Similarly, if B U ( d ) , and we replace X and Y with X B and Y B , respectively, then the H k undergo the transformation Z ( I 2 B I d ) Z ( I 2 B I d ) . This time, H 1 and H 3 remain fixed. In the case of H 4 , one should use the formulas
A X ˜ = ( I d A ) · X ˜ , ( Y B ˜ ) T = ( Y ˜ ) T · ( B I d ) ,
which are not hard to verify.
Hence, the following proposition holds.
Proposition 6. 
For A , B U ( d ) , we have
H ( A X B , A Y B ) = ( I 2 B A * ) H ( X , Y ) ( I 2 B A T ) .
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 H ( X , Y ) into four square blocks of size d 2 . 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
H ( X , Y ) = L ( X ) L ( X , Y ) L ( X , Y ) L ( Y ) ,
where
L ( X , Y ) = tr ( X Y ) I d 2 1 2 X Y I d + I d X * Y T + 1 4 X ˜ * Y ˜ T ,
and L ( X ) : = L ( X , X ) .
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 X 0 then L ( X ) > 0 .
Proof. 
By Proposition 5, we may assume that X = diag ( λ 1 , λ 2 , , λ d ) with λ 1 λ 2 λ d 0 . Let s = X 2 = λ i 2 . It follows from Equation (15) that L ( X ) = M + ( 1 / 4 ) X ˜ X ˜ T , where
M = i = 1 d ( s λ i 2 2 ) I d 1 2 X 2
is a diagonal matrix with the diagonal entries
μ i j = s ( λ i 2 + λ j 2 ) / 2 , i , j = 1 , 2 , , d .
Since
μ i j μ 1 , 1 = λ 2 2 + + λ d 2 0
for all i , j , we have L ( X ) 0 . As X 0 , we have λ 1 > 0 . If λ 2 > 0 , then all μ i j > 0 and so L ( X ) > 0 . Otherwise, λ i = 0 for i > 1 and L ( X ) is a diagonal matrix with positive diagonal entries. Hence, again L ( X ) > 0 . ☐
The matrix H has order 2 d 2 , but one can reduce the proof of Conjecture 4 to matrices of order d 2 . 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 A = L ( X ) , B = L ( X , Y ) and C = L ( Y ) t in Equation (14). Since A > 0 , it suffices to show that S : = C B A 1 B 0 , see e.g., [14] (Proposition 8.2.3). (As X is diagonal, one can easily compute A 1 .) Proving that S 0 may be somewhat easier than proving that H 0 . We shall use this simplification to handle the case d = 2 below.
Recall that d 3 by the assumption made earlier, but Conjecture 4 also makes sense for d = 1 and d = 2 . However, in these two cases, the determinant of H ( X , Y ) is identically 0. For d = 1 , we have H 1 = H 2 = H 3 = H 4 and the conjecture is obviously valid. It is also valid for d = 2 .
Proposition 8. 
Conjecture 4 is true for d = 2 .
Proof. 
We may assume that X = a 0 0 b with a , b > 0 . Let Y = u 1 v 1 u 2 v 2 , and let us partition H as in Equation (14) and set again A = L ( X ) , B = L ( X , Y ) and C = L ( Y ) . Let t 4 c 1 t 3 + c 2 t 2 c 3 t + c 4 be the characteristic polynomial of S : = C B A 1 B . A computation shows that c 4 = 0 . Set
p = a 2 + b 2 , q = a 4 + 4 a 2 b 2 + b 4 , r = p ( | u 2 | 2 + | v 1 | 2 ) + | a v 2 b u 1 | 2 .
After some tedious computations, we found the following formulas for the c i :
2 p q c 1 = 4 ( p 2 + a 2 b 2 ) | a v 2 b u 1 | 2 + p ( 2 a 2 b 2 + 3 q ) ( | u 2 | 2 + | v 1 | 2 ) , 4 p 2 q c 2 = q | a v 2 b u 1 | 4 + p ( 7 a 4 + 22 a 2 b 2 + 7 b 4 ) ( | u 2 | 2 + | v 1 | 2 ) | a v 2 b u 1 | 2 + 2 p 2 ( q + 3 a 2 b 2 ) | u 2 | 2 + | v 1 | 2 2 + 2 ( a 4 + a 2 b 2 + b 4 ) u 2 v 1 2 + 2 a b u 2 v 1 + ( a v 2 b u 1 ) 2 2 , 4 p q c 3 = r 2 a b u 2 v 1 + ( a v 2 b u 1 ) 2 2 + 2 a 2 b 2 ( | u 2 | 4 + | v 1 | 4 ) + p ( | u 2 | 2 + | v 1 | 2 ) | a v 2 b u 1 | 2 + 2 p 2 u 2 v 1 2 .
Since p , q , r > 0 , we conclude that all coefficients c i 0 . Hence, S 0 (see e.g., [14] (Proposition 8.2.6)). ☐
We shall consider the case d = 3 in Section 7.

5. The Diagonal Case

We say that a matrix pair ( X , Y ) 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 H ( X , Y ) 0 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 H ( X , Y ) is not diagonal even if X and Y are. We prove a slightly stronger result.
Theorem 1. 
If ( X , Y ) is a generic pair of diagonal matrices, then H ( X , Y ) > 0 .
Proof. 
We denote the diagonal entries of X and Y by λ 1 , , λ d and μ 1 , , μ d respectively. The hypothesis implies that λ k 0 or μ k 0 for each k. After replacing H with Π H Π T where Π is a suitable permutation matrix, H becomes direct sum of d 2 d blocks of order 2 and an additional block of order 2 d . It suffices to show that each of these blocks is positive definite.
The blocks of order 2 are indexed by the integers p = ( i 1 ) d + j , where i , j { 1 , 2 , , d } and j i . For such index p, the corresponding block of order 2 is the principal submatrix H ( p ) of the original matrix H corresponding to indices p and p + d 2 . Explicitly, we have
H ( p ) = k = 1 d c k | λ k | 2 λ k * μ k λ k μ k * | μ k | 2 ,
where c k = 1 for k i , j and c i = c j = 1 / 2 . Each matrix on the right-hand side is positive semidefinite of rank 1. If H ( p ) 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, H ( p ) must be positive definite.
It remains to consider the block B of size 2 d , i.e., the principal submatrix of H corresponding to the indices ( i 1 ) d + i and ( i 1 ) d + i + d 2 for 1 i d . We have B = B 1 ( B 2 + B 3 ) / 2 + B 4 / 4 , where B k denotes the corresponding principal submatrix of H k . Let us first consider the matrix B = B 1 ( B 2 + B 3 ) / 2 . After a suitable simultaneous permutation of rows and columns, B breaks up into the direct sum of d blocks G ( i ) of order 2, where i { 1 , 2 , , d } . Explicitly, we have
G ( i ) = k i | λ k | 2 λ k * μ k λ k μ k * | μ k | 2 .
Each G ( i ) is positive semidefinite of rank 1 or 2. Thus, in the decomposition B = B + B 4 / 4 , we have B 0 and B 4 0 . If all G ( i ) > 0 , then B > 0 , and so B > 0 .
It remains to consider the case where some G ( i ) , say G ( 1 ) , is singular. By Cauchy–Schwarz inequality, the vectors ( λ 2 , λ 3 , , λ d ) and ( μ 2 , μ 3 , , μ d ) are linearly dependent. It follows that all other G ( i ) must be positive definite. Consequently, the nullspace of B is one-dimensional and is spanned by the column vector having all components 0 except the first which is μ 2 and ( d + 1 ) -th which is λ 2 . This vector is not killed by B 4 , because λ 1 μ 2 λ 2 μ 1 0 . Hence, we conclude that B > 0 . ☐
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 H ( X , Y ) satisfies yet another identity. Let
Λ = α β γ δ GL 2 ( C ) ,
and
( Λ T ) 1 = α β γ δ .
By using
α γ β δ α β γ δ = 1 0 0 1 ,
we deduce that
( α X + β Y ) ( α U + β V ) + ( γ X + δ Y ) ( γ U + δ V ) = X U + Y V , ( α X + β Y ) T ( α U + β V ) + ( γ X + δ Y ) T ( γ U + δ V ) = X T U + Y T V , ( α U + β V ) ( α X + β Y ) T + ( γ U + δ V ) ( γ X + δ Y ) T = U X T + V Y T .
Consequently, Equation (4) implies that
Φ ( α X + β Y , γ X + δ Y , α U + β V , γ U + δ V ) = Φ ( X , Y , U , V ) .
By using Equation (6) and the formula
α U ˜ + β V ˜ γ U ˜ + δ V ˜ = ( Λ T ) 1 I d 2 U ˜ V ˜ ,
we obtain the new identity
H ( α X + β Y , γ X + δ Y ) = ( Λ * I d 2 ) H ( X , Y ) ( Λ T I d 2 ) .
It suffices to prove the inequality H ( X , Y ) 0 for generic pairs ( X , Y ) only. If ( X , Y ) is generic, we can choose Λ GL 2 ( C ) such that α X + β Y is a singular matrix. Thus, the identity Equation (18) shows that it suffices to prove H ( X , Y ) 0 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 D ( X , Y ) = det H ( X , Y ) . By taking the determinants in Equation (13), we obtain that
D ( A X B , A Y B ) = D ( X , Y ) , A , B U ( d ) .
From Equation (18), we deduce that
D ( α X + β Y , γ X + δ Y ) = α δ β γ 2 d 2 D ( X , Y )
is valid when Λ is invertible. Since both sides are polynomials, this identity must be valid for arbitrary Λ.
Note that D ( X , 0 ) = 0 for all matrices X. More generally, we claim that D ( X , Y ) = 0 if X and Y are linearly dependent. Indeed, it suffices to choose a matrix Λ as in Equation (16) such that γ X + δ Y = 0 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 d 3 , then D ( X , Y ) 0 for generic ( X , Y ) .
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 X 1 and Y 1 be any matrices in M d . We have to show that H ( X 1 , Y 1 ) is positive semidefinite. Clearly, it suffices to prove this when the pair ( X 1 , Y 1 ) is generic. Let ( X 0 , Y 0 ) be a generic pair of diagonal matrices. Then, H ( X 0 , Y 0 ) is positive definite by Theorem 1. Consequently, D ( X 0 , Y 0 ) > 0 , and all eigenvalues of H ( X 0 , Y 0 ) are positive. We can join the pairs ( X 0 , Y 0 ) and ( X 1 , Y 1 ) by a continuous path ( X t , Y t ) , 0 t 1 , such that ( X t , Y t ) is generic for each t. By Conjecture 5, D ( X t , Y t ) 0 for all t. Hence, H ( X t , Y t ) has no zero eigenvalues. Since the eigenvalues of H ( X t , Y t ) are continuous functions of t, and they are all positive for t = 0 , they must all remain positive for all values of t. In particular, this is true for t = 1 . We thus conclude that H ( X 1 , Y 1 ) is positive definite. ☐

7. The Case d = 3

In this section, we consider only the case d = 3 . As mentioned earlier, in order to prove that H ( X , Y ) 0 , 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 X , Y M 3 , and some linear combination of X and Y has rank one, then H ( X , Y ) 0 .
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
X = 1 0 0 0 0 0 0 0 0 .
By applying the same proposition, we may also assume that
Y = a u v x b 0 y 0 c ,
where b , c , u , v 0 .
We partition the matrix H = H ( X , Y ) as in Equation (14) and set A = L ( X ) , B = L ( X , Y ) , C = L ( Y ) . As explained in Section 4, it suffices to show that the matrix S : = C B A 1 B is positive semidefinite. Let
p ( t ) = k = 0 9 ( 1 ) k c k t 9 k , c 0 = 1 ,
be the characteristic polynomial of S. The c k are polynomials in the real variables b , c , u , v and the complex variables x , y and their conjugates x * , y * . (The variable a does not occur.)
Set c k = p k / d k , where d k = 2 k for k < 9 and d 9 = d 8 = 256 . Then, the p k are polynomials with integer coefficients. All these computations were performed by using Maple since the p k may have several thousand terms. We claim that the polynomials p k are positive semidefinite, i.e., they have nonnegative values for all real b , c , u , v and all complex x , y . The inequality H ( X , Y ) 0 is a consequence of this claim.
To prove our claim, we construct positive semidefinite polynomials q k , k { 1 , 2 , , 9 } , such that the difference p k q k | b u x c v y | 2 is also a positive semidefinite polynomial. We have q 1 = q 2 = 0 . The other q k are given in the Appendix. The q k are obviously positive semidefinite. The proof that the differences p k q k | b u x c v y | 2 are positive semidefinite requires the use of Maple (or some other software for symbolic algebraic computations). We just expand p k q k | b u x c v y | 2 and check that all coefficients are nonnegative integers and all monomials that occur in the expansion are hermitian squares. For instance, we have
p 1 = 5 ( u 2 + v 2 + | x | 2 + | y | 2 ) + 6 ( b 2 + c 2 ) , p 2 = 41 ( u 2 + v 2 ) 2 + ( | x | 2 + | y | 2 ) 2 ) + 62 ( b 2 + c 2 ) 2 + 6 b 2 c 2 + 91 ( u 2 + v 2 ) ( | x | 2 + | y | 2 ) + 102 b 2 ( u 2 + | x | 2 ) + c 2 ( v 2 + | y | 2 ) + 108 b 2 ( v 2 + | y | 2 ) + c 2 ( u 2 + | x | 2 ) .
As an aside, we mention that in the case when
X = a 0 0 0 b 0 0 0 c , Y = u 1 v 1 w 1 u 2 v 2 w 2 u 3 v 3 w 3 ,
where a , b , c > 0 and u i , v i , w i C , the leading principal minor μ 10 of H of order 10 is a positive semidefinite polynomial. This follows from the following explicit expression for μ 10 as a sum of squares of real polynomials:
μ 10 = 1 512 ( 2 a 2 + b 2 + c 2 ) 2 ( a 2 + 2 b 2 + c 2 ) ( a 2 + b 2 + 2 c 2 ) · p ,
where
p = 2 ( a 2 + 2 b 2 + c 2 ) ( a 2 + b 2 + 2 c 2 ) · ( 4 a 4 + b 4 + c 4 + 5 a 2 ( b 2 + c 2 ) + 4 b 2 c 2 ) | b w 3 c v 2 | 2 + ( a 2 + b 2 ) ( a 2 + c 2 ) ( | c u 1 a w 3 | 2 + | a v 2 b u 1 | 2 ) + ( a 6 + b 6 + c 6 + 11 a 2 b 2 c 2 + 5 ( a 4 ( b 2 + c 2 ) + b 4 ( a 2 + c 2 ) + c 4 ( a 2 + b 2 ) ) · q ,
and
q = 2 ( a 2 + 2 b 2 + c 2 ) ( a 2 + b 2 + 2 c 2 ) ( | v 3 | 2 + | w 2 | 2 ) + ( a 2 + 2 b 2 ) ( a 2 + b 2 + 2 c 2 ) ( | u 3 | 2 + | w 1 | 2 ) + ( a 2 + 2 c 2 ) ( a 2 + 2 b 2 + c 2 ) ( | u 2 | 2 + | v 1 | 2 ) .
Note that the equality μ 10 = 0 implies that Y is a scalar multiple of X.

8. Results and Discussion

We consider the question whether the Werner d d states ρ W ( t ) = 1 t F , 1 / d < t 1 / 2 , 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 t = 1 / 2 only.
We first construct a hermitian biquadratic form depending on 2 d vectors x 1 , , x d , y 1 , , y d H A and 2 d vectors u 1 , , u d , v 1 , , v d H B and show that Conjecture 3 is equivalent to Φ being positive semidefinite.
Next, we organize the vectors x 1 , , x d into the matrix X = [ x 1 x d ] , and, similarly, we construct the matrices Y , U , V from the remaining 3 d vectors. It turns out that the form Φ has relatively simple expression Equation (4) in terms of the matrices X , Y , U , V . By using this expression, we deduce that Φ is invariant under the action of the product of two copies of the unitary group U ( d ) . More precisely, Φ ( X , Y , U , V ) is invariant under the transformation, which sends
X A X B , Y A Y B , U A * U B * , V A * V B * ,
where A , B U ( d ) .
If we fix the matrices X and Y, then Φ ( X , Y , U , V ) becomes an ordinary hermitian quadratic form in the 2 d 2 complex entries of the matrices U and V. We compute the matrix H = H ( X , Y ) of this hermitian quadratic form (see the formula (11)). Then, Conjecture 3 reduces to the claim that H ( X , Y ) 0 for all matrices X , Y M d .
Let α , β , γ , δ be complex numbers such that α δ β γ 0 . We prove in Proposition 6 that H ( X , Y ) 0 if and only if H ( α X + β Y , γ X + δ Y ) 0 . We can choose such α , β , γ , δ so that the matrix α X + β Y becomes singular. Hence, it suffices to prove the inequality H ( X , Y ) 0 when X is singular. By using the action of U ( d ) × U ( d ) , 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 H ( X , Y ) is not diagonal in general. However, we did prove that H ( X , Y ) 0 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 H = H ( X , Y ) is a hermitian matrix of order 2 d 2 . After partitioning H into four square blocks of order d 2 , 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 d 2 such that H 0 if and only if S 0 . By using this trick, we proved by brute force that H 0 is true in the case d = 2 . This also follows from the fact that ρ W ( 1 / 2 ) is separable when d = 2 .
Assume now that d = 3 . Since we may assume that X is singular, its rank is 1 or 2. We prove that H ( X , Y ) 0 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 S 0 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 d = 3 , 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 1 , a , 0 , and a > 0 . 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
256 ( a 2 + 1 ) 3 ( a 2 + 2 ) 2 ( 2 a 2 + 1 ) 2 ( a 4 + 4 a 2 + 1 ) .
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 d d , 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 d = 3 .

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 q k , k > 2 , used in Section 7.
q 3 = 2 , q 4 = 11 ( u 2 + v 2 + | x | 2 + | y | 2 ) + 14 ( b 2 + c 2 ) , q 5 = 22 ( u 4 + v 4 + | x | 4 + | y | 4 ) + 38 ( b 4 + c 4 ) + 44 ( u 2 + v 2 + | x | 2 + | y | 2 ) + 52 ( u 2 + v 2 ) ( | x | 2 + | y | 2 ) + 59 b 2 ( u 2 + | x | 2 ) + c 2 ( v 2 + | y | 2 ) + 65 b 2 ( v 2 + | y | 2 ) + c 2 ( u 2 + | x | 2 ) + 86 b 2 c 2 , q 6 = 296 b 2 c 2 ( u 2 + v 2 + | x | 2 + | y | 2 ) + 254 ( b 2 v 2 | y | 2 + c 2 u 2 | x | 2 ) + 225 ( b 2 + c 2 ) ( u 2 | y | 2 + v 2 | x | 2 ) + 202 ( b 2 u 2 | x | 2 + c 2 v 2 | y | 2 ) + 198 b 2 c 2 ( b 2 + c 2 ) + 192 ( b 2 + c 2 ) ( u 2 v 2 + | x | 2 | y | 2 ) + 168 ( u 2 | x | 2 ( v 2 + | y | 2 ) + v 2 | y | 2 ( u 2 + | x | 2 ) ) + 141 ( b 4 ( v 2 + | y | 2 ) + c 4 ( u 2 + | x | 2 ) ) + 116 ( b 4 ( u 2 + | x | 2 ) + c 4 ( v 2 + | y | 2 ) ) + 106 ( b 2 ( v 4 + | y | 4 ) + c 2 ( u 4 + | x | 4 ) ) + 86 ( b 2 ( u 4 + | x | 4 ) + c 2 ( v 4 + | y | 4 ) ) + 84 ( ( u 2 + v 2 ) ( | x | 4 + | y | 4 ) + ( | x | 2 + | y | 2 ) ( u 4 + v 4 ) ) + 60 ( u 2 v 2 ( u 2 + v 2 ) + | x | 2 | y | 2 ( | x | 2 + | y | 2 ) ) + 50 ( b 6 + c 6 ) + 20 ( u 6 + v 6 + | x | 6 + | y | 6 ) + 3 | b u x + c v y | 2 , q 7 = 802 b 2 c 2 ( u 2 | x | 2 + v 2 | y | 2 ) + 778 b 2 c 2 ( u 2 | y | 2 + v 2 | x | 2 ) + 688 b 2 c 2 ( u 2 v 2 + | x | 2 | y | 2 ) + 574 ( b 2 v 2 | y | 2 ( u 2 + | x | 2 ) + c 2 u 2 | x | 2 ( v 2 + | y | 2 ) ) + 515 b 2 c 2 ( b 2 ( v 2 + | y | 2 ) + c 2 ( u 2 + | x | 2 ) ) + 488 ( b 2 u 2 | x | 2 ( v 2 + | y | 2 ) + c 2 v 2 | y | 2 ( u 2 + | x | 2 ) ) + 470 b 2 c 2 ( b 2 ( u 2 + | x | 2 ) + c 2 ( v 2 + | y | 2 ) ) + 418 ( b 4 v 2 | y | 2 + c 4 u 2 | x | 2 ) + 384 u 2 v 2 | x | 2 | y | 2 + 364 b 4 c 4 + 336 b 2 c 2 ( u 4 + v 4 + | x | 4 + | y | 4 ) + 331 ( b 4 + c 4 ) ( u 2 | y | 2 + v 2 | x | 2 ) + 324 ( b 2 v 2 | y | 2 ( v 2 + | y | 2 ) + c 2 u 2 | x | 2 ( u 2 + | x | 2 ) ) + 278 ( b 4 + c 4 ) ( u 2 v 2 + | x | 2 | y | 2 ) + 274 ( u 2 | y | 2 ( b 2 | y | 2 + c 2 u 2 ) + v 2 | x | 2 ( b 2 v 2 + c 2 | x | 2 ) ) + 260 ( b 4 u 2 | x | 2 + c 4 v 2 | y | 2 ) + 250 ( u 2 | y | 2 ( b 2 u 2 + c 2 | y | 2 ) + v 2 | x | 2 ( b 2 | x | 2 + c 2 v 2 ) ) + 214 ( b 2 u 2 | x | 2 ( u 2 + | x | 2 ) + c 2 v 2 | y | 2 ( v 2 + | y | 2 ) ) + 210 b 2 c 2 ( b 4 + c 4 ) + 204 ( u 2 v 2 ( b 2 v 2 + c 2 u 2 ) + | x | 2 | y | 2 ( b 2 | y | 2 + c 2 | x | 2 ) ) + 192 ( u 2 v 2 ( | x | 4 + | y | 4 ) + | x | 2 | y | 2 ( u 4 + v 4 ) ) + 180 ( u 2 v 2 ( b 2 u 2 + c 2 v 2 ) + | x | 2 | y | 2 ( b 2 | x | 2 + c 2 | y | 2 ) ) + 174 ( b 4 ( v 4 + | y | 4 ) + c 4 ( u 4 + | x | 4 ) ) + 168 ( u 2 + v 2 ) ( | x | 2 + | y | 2 ) ( u 2 v 2 + | x | 2 | y | 2 ) + 135 ( b 6 ( v 2 + | y | 2 ) + c 6 ( u 2 + | x | 2 ) ) + 112 ( b 4 ( u 4 + | x | 4 ) + c 4 ( v 4 + | y | 4 ) ) + 100 ( b 6 ( u 2 + | x | 2 ) + c 6 ( v 2 + | y | 2 ) ) + 96 ( u 4 + v 4 ) ( | x | 4 + | y | 4 ) + 76 ( b 2 ( v 6 + | y | 6 ) + c 2 ( u 6 + | x | 6 ) ) + 56 ( ( u 2 + v 2 ) ( | x | 6 + | y | 6 ) + ( | x | 2 + | y | 2 ) ( u 6 + v 6 ) ) + 52 ( b 2 ( u 6 + | x | 6 ) + c 2 ( v 6 + | y | 6 ) ) + 48 ( u 4 v 4 + | x | 4 | y | 4 ) + 32 ( b 8 + c 8 + u 2 v 2 ( u 4 + v 4 ) + | x | 2 | y | 2 ( | x | 4 + | y | 4 ) ) + ( 10 ( b 2 + c 2 ) + 7 ( u 2 + v 2 + | x | 2 + | y | 2 ) ) | b u x + c v y | 2 + 8 ( u 8 + v 8 + | x | 8 + | y | 8 ) , q 8 = 1248 b 2 c 2 ( u 2 v 2 ( | x | 2 + | y | 2 ) + | x | 2 | y | 2 ( u 2 + v 2 ) ) + 960 b 2 c 2 ( b 2 v 2 | y | 2 + c 2 u 2 | x | 2 ) + 820 b 2 c 2 ( b 2 + c 2 ) ( u 2 | y | 2 + v 2 | x | 2 ) + 780 b 2 c 2 ( b 2 u 2 | x | 2 + c 2 v 2 | y | 2 ) + 776 u 2 v 2 | x | 2 | y | 2 ( b 2 + c 2 ) + 748 b 2 c 2 ( b 2 + c 2 ) ( u 2 v 2 + | x | 2 | y | 2 ) + 628 b 2 c 2 ( u 2 | x | 2 ( u 2 + | x | 2 ) + v 2 | y | 2 ( v 2 + | y | 2 ) ) + 586 b 4 c 4 ( u 2 + v 2 + | x | 2 + | y | 2 ) + 576 b 2 c 2 ( u 2 | y | 2 ( u 2 + | y | 2 ) + v 2 | x | 2 ( v 2 + | x | 2 ) ) + 570 ( b 4 v 2 | y | 2 ( u 2 + | x | 2 ) + c 4 u 2 | x | 2 ( v 2 + | y | 2 ) ) + 488 b 2 c 2 ( u 2 v 2 ( u 2 + v 2 ) + | x | 2 | y | 2 ( | x | 2 + | y | 2 ) ) + 470 ( b 2 v 2 | y | 2 + c 2 u 2 | x | 2 ) ( u 2 | y | 2 + v 2 | x | 2 ) + 428 ( b 2 v 2 | y | 2 + c 2 u 2 | x | 2 ) ( u 2 v 2 + | x | 2 | y | 2 ) + 398 b 2 c 2 ( b 2 ( v 4 + | y | 4 ) + c 2 ( u 4 + | x | 4 ) ) + 394 ( b 4 u 2 | x | 2 ( v 2 + | y | 2 ) + c 4 v 2 | y | 2 ( u 2 + | x | 2 ) ) + 382 ( b 2 v 2 | y | 2 ( u 4 + | x | 4 ) + c 2 u 2 | x | 2 ( v 4 + | y | 4 ) ) + 366 ( b 4 v 2 | y | 2 ( v 2 + | y | 2 ) + c 4 u 2 | x | 2 ( u 2 + | x | 2 ) ) + 358 b 2 c 2 ( b 4 ( v 2 + | y | 2 ) + c 4 ( u 2 + | x | 2 ) ) + 332 b 2 c 2 ( b 2 ( u 4 + | x | 4 ) + c 2 ( v 4 + | y | 4 ) ) + 320 ( b 2 u 2 | x | 2 ( v 4 + | y | 4 ) + c 2 v 2 | y | 2 ( u 4 + | x | 4 ) ) + 306 ( b 2 u 2 | x | 2 + c 2 v 2 | y | 2 ) ( v 2 | x | 2 + u 2 | y | 2 ) + 304 b 2 c 2 ( b 4 ( u 2 + | x | 2 ) + c 4 ( v 2 + | y | 2 ) ) + 284 ( b 2 v 4 | y | 4 + c 2 u 4 | x | 4 ) + 276 b 4 c 4 ( b 2 + c 2 ) + 274 ( b 2 u 2 | x | 2 + c 2 v 2 | y | 2 ) ( u 2 v 2 + | x | 2 | y | 2 ) + 268 ( b 4 ( u 2 | y | 4 + v 4 | x | 2 ) + c 4 ( u 4 | y | 2 + v 2 | x | 4 ) ) + 256 ( b 6 v 2 | y | 2 + c 6 u 2 | x | 2 ) + 234 ( b 4 ( u 4 | y | 2 + v 2 | x | 4 ) + c 4 ( u 2 | y | 4 + v 4 | x | 2 ) ) + 192 ( b 4 ( u 2 v 4 + | x | 2 | y | 4 ) + c 4 ( u 4 v 2 + | x | 4 | y | 2 ) + u 2 v 2 | x | 2 | y | 2 ( u 2 + v 2 + | x | 2 + | y | 2 ) ) + 190 ( b 6 + c 6 ) ( u 2 | y | 2 + v 2 | x | 2 ) + 186 ( b 2 + c 2 ) ( u 4 | y | 4 + v 4 | x | 4 ) + 158 ( b 2 v 2 | y | 2 ( v 4 + | y | 4 ) + c 2 u 2 | x | 2 ( u 4 + | x | 4 ) ) + 152 b 2 c 2 ( u 6 + v 6 + | x | 6 + | y | 6 ) + 140 ( b 4 u 2 | x | 2 ( u 2 + | x | 2 ) + c 4 v 2 | y | 2 ( v 2 + | y | 2 ) + ( b 6 + c 6 ) ( u 2 v 2 + | x | 2 | y | 2 ) ) + 136 ( b 4 ( u 4 v 2 + | x | 4 | y | 2 ) + c 4 ( u 2 v 4 + | x | 2 | y | 4 ) ) + 122 ( b 2 ( u 2 | y | 6 + v 6 | x | 2 ) + c 2 ( u 6 | y | 2 + v 2 | x | 6 ) ) + 120 ( b 2 u 4 | x | 4 + c 2 v 4 | y | 4 ) + 112 ( b 2 | x | 2 ( b 4 u 2 + v 2 | x | 4 ) + c 2 v 2 ( c 4 | y | 2 + v 4 | x | 2 ) + u 2 | y | 2 ( b 2 u 4 + c 2 | y | 4 ) ) + 110 ( b 6 ( v 4 + | y | 4 ) + c 6 ( u 4 + | x | 4 ) ) + 100 b 2 c 2 ( b 6 + c 6 ) + 96 ( ( b 2 + c 2 ) ( u 4 v 4 + | x | 4 | y | 4 ) + ( u 2 + v 2 ) ( | x | 4 | y | 4 + u 2 v 2 ( | x | 4 + | y | 4 ) ) + ( | x | 2 + | y | 2 ) ( u 4 v 4 + | x | 2 | y | 2 ( u 4 + v 4 ) ) ) + 88 ( b 4 ( v 6 + | y | 6 ) + c 4 ( u 6 + | x | 6 ) ) + 80 ( b 2 ( u 2 v 6 + | x | 2 | y | 6 ) + c 2 ( u 6 v 2 + | x | 6 | y | 2 ) ) + 76 ( b 2 u 2 | x | 2 ( u 4 + | x | 4 ) + c 2 v 2 | y | 2 ( v 4 + | y | 4 ) ) + 64 ( u 2 v 2 ( | x | 6 + | y | 6 + ( | x | 2 + | y | 2 ) ( u 4 + v 4 ) ) + | x | 2 | y | 2 ( u 6 + v 6 + ( u 2 + v 2 ) ( | x | 4 + | y | 4 ) ) ) + 52 ( b 8 ( v 2 + | y | 2 ) + c 8 ( u 2 + | x | 2 ) ) + 48 ( b 6 ( u 4 + | x | 4 ) + c 6 ( v 4 + | y | 4 ) + u 2 v 2 ( b 2 u 4 + c 2 v 4 ) + | x | 2 | y | 2 ( b 2 | x | 4 + c 2 | y | 4 ) ) + 32 ( ( u 6 + v 6 ) ( | x | 4 + | y | 4 ) + ( | x | 6 + | y | 6 ) ( u 4 + v 4 ) + b 8 ( u 2 + | x | 2 ) + c 8 ( v 2 + | y | 2 ) + b 4 ( u 6 + | x | 6 ) + c 4 ( v 6 + | y | 6 ) ) + 28 b 2 c 2 | b u x + c v y | 2 + 24 ( b 2 ( v 8 + | y | 8 ) + c 2 ( u 8 + | x | 8 ) ) + 18 ( b 2 ( v 2 + | y | 2 ) + c 2 ( u 2 + | x | 2 ) ) | b u x + c v y | 2 + 16 ( ( u 8 + v 8 ) ( | x | 2 + | y | 2 ) + ( u 2 + v 2 ) ( | x | 8 + | y | 8 ) + ( u 2 + v 2 ) ( | x | 2 + | y | 2 ) | b u x + c v y | 2 ) + 10 ( b 2 ( u 2 + | x | 2 ) + c 2 ( v 2 + | y | 2 ) ) | b u x + c v y | 2 + 8 ( b 10 + c 10 + b 2 ( u 8 + | x | 8 ) + c 2 ( v 8 + | y | 8 ) + ( b 4 + c 4 ) | b u x + c v y | 2 ) , q 9 = 492 b 2 c 2 u 2 v 2 | x | 2 | y | 2 + 349 b 2 c 2 ( b 2 v 2 | y | 2 ( u 2 + | x | 2 ) + c 2 u 2 | x | 2 ( v 2 + | y | 2 ) ) + 305 b 2 c 2 ( b 2 u 2 | x | 2 ( v 2 + | y | 2 ) + c 2 v 2 | y | 2 ( u 2 + | x | 2 ) ) + 260 b 4 c 4 ( u 2 | x | 2 + v 2 | y | 2 ) + 231 b 2 c 2 ( u 2 | x | 2 + v 2 | y | 2 ) ( u 2 v 2 + | x | 2 | y | 2 ) + 230 b 4 c 4 ( u 2 + | x | 2 ) ( v 2 + | y | 2 ) + 228 b 2 c 2 ( u 2 v 2 ( | x | 4 + | y | 4 ) + | x | 2 | y | 2 ( u 4 + v 4 ) ) + 216 b 2 c 2 ( u 2 | x | 2 ( v 4 + | y | 4 ) + v 2 | y | 2 ( u 4 + | x | 4 ) ) + 200 b 2 c 2 ( b 2 v 2 | y | 2 ( v 2 + | y | 2 ) + c 2 u 2 | x | 2 ( u 2 + | x | 2 ) ) + 164 b 2 c 2 ( b 4 v 2 | y | 2 + c 4 u 2 | x | 2 ) + 149 b 2 c 2 ( b 2 ( u 2 | y | 4 + v 4 | x | 2 ) + c 2 ( u 4 | y | 2 + v 2 | x | 4 ) ) + 146 u 2 v 2 | x | 2 | y | 2 ( b 4 + c 4 ) + 144 b 2 c 2 ( b 2 ( u 4 | y | 2 + u 2 v 4 + v 2 | x | 4 + | x | 2 | y | 4 ) + c 2 ( u 2 | y | 4 + u 4 v 2 + v 4 | x | 2 + | x | 4 | y | 2 ) ) + 140 b 2 c 2 ( b 2 u 2 | x | 2 ( u 2 + | x | 2 ) + c 2 v 2 | y | 2 ( v 2 + | y | 2 ) ) + 131 b 2 c 2 ( b 4 + c 4 ) ( u 2 | y | 2 + v 2 | x | 2 ) + 125 b 2 c 2 ( b 2 ( u 4 v 2 + | x | 4 | y | 2 ) + c 2 ( u 2 v 4 + | x | 2 | y | 4 ) ) + 120 ( b 2 c 2 ( u 4 | x | 4 + v 4 | y | 4 ) + ( b 4 v 2 | y | 2 + c 4 u 2 | x | 2 ) ( u 2 | y | 2 + v 2 | x | 2 ) ) + 117 b 2 c 2 ( b 4 + c 4 ) ( u 2 v 2 + | x | 2 | y | 2 ) + 112 ( b 2 c 2 ( b 4 u 2 | x | 2 + c 4 v 2 | y | 2 ) + u 2 v 2 | x | 2 | y | 2 ( b 2 ( v 2 + | y | 2 ) + c 2 ( u 2 + | x | 2 ) ) ) + 111 ( b 4 v 2 | y | 2 + c 4 u 2 | x | 2 ) ( u 2 v 2 + | x | 2 | y | 2 ) + 110 b 4 c 4 ( b 2 ( v 2 + | y | 2 ) + c 2 ( u 2 + | x | 2 ) ) + 108 b 4 c 4 ( u 4 + v 4 + | x | 4 + | y | 4 ) + 104 b 4 c 4 ( b 2 ( u 2 + | x | 2 ) + c 2 ( v 2 + | y | 2 ) ) + 93 ( b 4 v 2 | y | 2 ( u 4 + | x | 4 ) + c 4 u 2 | x | 2 ( v 4 + | y | 4 ) ) + 92 ( b 4 v 4 | y | 4 + c 4 u 4 | x | 4 ) + 90 b 2 c 2 ( u 4 | y | 4 + v 4 | x | 4 ) + 80 ( b 2 c 2 ( u 4 v 4 + | x | 4 | y | 4 ) + b 2 v 4 | y | 4 ( u 2 + | x | 2 ) + c 2 u 4 | x | 4 ( v 2 + | y | 2 ) + u 2 v 2 | x | 2 | y | 2 ( b 2 ( u 2 + | x | 2 ) + c 2 ( v 2 + | y | 2 ) ) ) + 76 b 2 c 2 ( u 2 | x | 2 ( u 4 + | x | 4 ) + v 2 | y | 2 ( v 4 + | y | 4 ) ) + 74 ( b 6 v 2 | y | 2 ( u 2 + | x | 2 ) + c 6 u 2 | x | 2 ( v 2 + | y | 2 ) ) + 72 ( u 4 v 4 ( b 2 | y | 2 + c 2 | x | 2 ) + | x | 4 | y | 4 ( b 2 v 2 + c 2 u 2 ) ) + 70 b 2 c 2 ( b 4 ( v 4 + | y | 4 ) + c 4 ( u 4 + | x | 4 ) ) + 64 ( u 4 | y | 4 ( b 2 v 2 + c 2 | x | 2 ) + v 4 | x | 4 ( b 2 | y | 2 + c 2 u 2 ) ) + 61 b 2 c 2 ( u 2 | y | 2 ( u 4 + | y | 4 ) + v 2 | x | 2 ( v 4 + | x | 4 ) ) + 57 ( b 4 u 2 | x | 2 ( v 4 + | y | 4 ) + c 4 v 2 | y | 2 ( u 4 + | x | 4 ) ) + 56 ( b 6 c 6 + b 2 v 2 | y | 2 ( u 2 v 4 + | x | 2 | y | 4 ) + c 2 u 2 | x | 2 ( u 4 v 2 + | x | 4 | y | 2 ) ) + 54 ( b 6 v 2 | y | 2 ( v 2 + | y | 2 ) + c 6 u 2 | x | 2 ( u 2 + | x | 2 ) ) + 48 ( b 2 c 2 ( u 2 v 2 ( u 4 + v 4 ) + | x | 2 | y | 2 ( | x | 4 + | y | 4 ) + b 4 ( u 4 + | x | 4 ) + c 4 ( v 4 + | y | 4 ) ) + b 2 ( v 6 + | y | 6 ) + c 2 ( u 6 + | x | 6 ) + b 2 v 2 | y | 2 ( u 2 | y | 4 + v 4 | x | 2 ) + c 2 u 2 | x | 2 ( u 4 | y | 2 + v 2 | x | 4 ) ) + 46 ( b 4 v 2 | y | 2 ( v 4 + | y | 4 ) + c 4 u 2 | x | 2 ( u 4 + | x | 4 ) ) + 45 ( b 4 + c 4 ) ( u 4 | y | 4 + v 4 | x | 4 ) + 44 ( b 4 u 2 | x | 2 + c 4 v 2 | y | 2 ) ( u 2 | y | 2 + v 2 | x | 2 ) + 40 ( b 2 v 2 | y | 2 ( u 6 + | x | 6 ) + c 2 u 2 | x | 2 ( v 6 + | y | 6 ) + b 2 c 2 ( b 6 ( v 2 + | y | 2 ) + c 6 ( u 2 + | x | 2 ) ) ) + 39 ( b 6 ( u 2 | y | 4 + v 4 | x | 2 ) + c 6 ( v 2 | x | 4 + u 4 | y | 2 ) ) + 36 b 4 c 4 ( b 4 + c 4 ) + 34 ( b 6 ( u 4 | y | 2 + v 2 | x | 4 ) + c 6 ( v 4 | x | 2 + u 2 | y | 4 ) ) + 33 ( b 4 ( v 6 | x | 2 + u 2 | y | 6 ) + c 4 ( u 6 | y | 2 + v 2 | x | 6 ) ) + 32 ( b 2 v 4 | y | 4 ( v 2 + | y | 2 ) + c 2 u 4 | x | 4 ( u 2 + | x | 2 ) + b 4 c 2 ( u 6 + | x | 6 ) + b 2 c 4 ( v 6 + | y | 6 ) + b 8 c 2 ( u 2 + | x | 2 ) + b 2 c 8 ( v 2 + | y | 2 ) + b 6 u 2 | x | 2 ( v 2 + | y | 2 ) + c 6 v 2 | y | 2 ( u 2 + | x | 2 ) + b 2 u 2 | x | 2 ( u 2 | y | 4 + v 4 | x | 2 ) + c 2 v 2 | y | 2 ( v 2 | x | 4 + u 4 | y | 2 ) ) + 28 ( b 4 ( u 6 | y | 2 + v 2 | x | 6 ) + c 4 ( v 6 | x | 2 + u 2 | y | 6 ) ) + 24 ( b 2 u 2 | x | 2 ( v 6 + | y | 6 ) + c 2 v 2 | y | 2 ( u 6 + | x | 6 ) + ( b 4 u 2 | x | 2 + c 4 v 2 | y | 2 ) ( u 2 v 2 + | x | 2 | y | 2 ) + u 4 v 4 ( b 2 | x | 2 + c 2 | y | 2 ) + | x | 4 | y | 4 ( b 2 u 2 + c 2 v 2 ) ) + 20 ( b 8 v 2 | y | 2 + c 8 u 2 | x | 2 ) + 17 ( b 6 ( u 2 v 4 + | x | 2 | y | 4 ) + c 6 ( u 4 v 2 + | x | 4 | y | 2 ) ) + 16 ( ( b 2 + c 2 ) ( u 4 | y | 4 ( u 2 + | y | 2 ) + v 4 | x | 4 ( v 2 + | x | 2 ) ) + ( b 8 + c 8 ) ( u 2 | y | 2 + v 2 | x | 2 ) + u 2 v 2 ( b 2 | x | 6 + c 2 | y | 6 ) + | x | 2 | y | 2 ( b 2 u 6 + c 2 v 6 ) + b 2 v 2 | y | 2 ( v 6 + | y | 6 ) + c 2 u 2 | x | 2 ( u 6 + | x | 6 ) + b 2 u 4 | x | 4 ( v 2 + | y | 2 ) + c 2 v 4 | y | 4 ( u 2 + | x | 2 ) + b 4 ( u 2 v 6 + | x | 2 | y | 6 ) + c 4 ( u 6 v 2 + | x | 6 | y | 2 ) + b 6 ( v 6 + | y | 6 ) + c 6 ( u 6 + | x | 6 ) + ( b 2 v 2 | y | 2 + c 2 u 2 | x | 2 ) | b u x + c v y | 2 ) + 10 ( b 8 ( v 4 + | y | 4 ) + c 8 ( u 4 + | x | 4 ) + b 2 c 2 ( u 2 + v 2 + | x | 2 + | y | 2 ) | b u x + c v y | 2 ) + 8 ( b 10 c 2 + b 2 c 10 + b 4 ( v 8 + | y | 8 ) + c 4 ( u 8 + | x | 8 ) + ( b 4 + c 4 ) ( u 4 v 4 + | x | 4 | y | 4 ) + v 2 | x | 2 ( b 2 + c 2 ) ( v 6 + | x | 6 ) + u 2 | y | 2 ( b 2 + c 2 ) ( u 6 + | y | 6 ) + b 2 c 2 ( | x | 8 + | y | 8 + u 8 + v 8 ) + b 2 u 2 | x | 2 ( u 4 v 2 + | x | 4 | y | 2 ) + c 2 v 2 | y | 2 ( | x | 2 | y | 4 + u 2 v 4 ) + ( b 2 + c 2 ) ( b 2 c 2 + u 2 | y | 2 + v 2 | x | 2 ) | b u x + c v y | 2 ) + 4 ( ( b 8 + c 8 ) ( u 2 v 2 + | x | 2 | y | 2 ) + ( b 4 ( v 2 + | y | 2 ) + c 4 ( u 2 + | x | 2 ) ) | b u x + c v y | 2 ) + 2 ( b 10 ( v 2 + | y | 2 ) + c 10 ( u 2 + | x | 2 ) + b 6 ( u 4 v 2 + | x | 4 | y | 2 ) + c 6 ( u 2 v 4 + | x | 2 | y | 4 ) ) .

References

  1. 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]
  2. 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]
  3. 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]
  4. Horodecki, P.; Horodecki, R. Distillation and bound entanglement. Quantum Inf. Comput. 2001, 1, 45–75. [Google Scholar]
  5. Watrous, J. Many copies may be required for entanglement distillation. Phys. Rev. Lett. 2004, 93, 010502. [Google Scholar] [CrossRef]
  6. Vollbrecht, K.G.H.; Werner, R.F. Entanglement measures under symmetry. Phys. Rev. A 2001, 64, 062307. [Google Scholar] [CrossRef]
  7. 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]
  8. 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]
  9. 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]
  10. Clarisse, L. The distillability problem revisited. Quantum Inf. Comput. 2006, 6, 539–560. [Google Scholar]
  11. 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]
  12. 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]
  13. 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]
  14. Bernstein, D.S. Matrix Mathematics: Theory, Facts, and Formulas With Applications to Linear Systems Theory; Princeton University Press: Princeton, NJ, USA, 2005. [Google Scholar]

Share and Cite

MDPI and ACS Style

Đoković, D.Ž. On Two-Distillable Werner States. Entropy 2016, 18, 216. https://doi.org/10.3390/e18060216

AMA Style

Đoković DŽ. On Two-Distillable Werner States. Entropy. 2016; 18(6):216. https://doi.org/10.3390/e18060216

Chicago/Turabian Style

Đoković, Dragomir Ž. 2016. "On Two-Distillable Werner States" Entropy 18, no. 6: 216. https://doi.org/10.3390/e18060216

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop