ukdate\ordinaldate\THEDAY \monthname[\THEMONTH] \THEYEAR
Inertia of two-qutrit entanglement witnesses
Abstract
Entanglement witnesses (EWs) are a fundamental tool for the detection of entanglement. We investigate the inertias of bipartite EWs constructed by the partial transpose of NPT states. Furthermore, we find out most of the inertias of the partial transpose of the two-qutrit bipartite NPT states. As an application, we extend our results to high dimensional states.
pacs:
03.65.Ud, 03.67.MnI Introduction
Einstein, Podolsky, Rosen, Schrodinger, et al discovered quantum entanglement. Then it became a remarkable feature of quantum mechanics. It lies in the heart of quantum information theory 2007Quantum ; GUHNE20091 . In recent decades, entanglement has been recognized as a kind of valuable resource 2007Quantum ; 2019Quantum ; Patricia2019Resource . It is widely used in various quantum information processing tasks such as quantum computing 2005Experimental , teleportation 2004Deterministic , dense coding 2002Quantum , cryptography 2020Entanglement , and quantum key distribution Xu2020 .
Although several useful separability criteria such as positive-partial-transpose (PPT) criterion Peres1996 ; horodecki1997 , range criterion, and realignment criterion Rudolph2002Some were developed, all of them cannot strictly distinguish between the set of entangled states and that of separable ones. According to PPT criterion, any state with non positive partial transpose (NPT) must be entangled. Nevertheless, the converse only holds for two-qubit and qubit-qutrit systems. It has been shown that determining whether a bipartite state is entangled is an NP-hard problem 2003Proceedings . In , Terhal first introduced the term entanglement witness (EW) by indicating that a violation of a Bell inequality can be expressed as a witness for entanglement 2000Entanglement . Nowadays, EWs are a fundamental tool for the detection of entanglement both theoretically and experimentally. Actually, many EWs have been implemented with local measurements 2000Entanglement ; 2019Design ; 2020Measurement .
As we know, the partial transpose of NPT state is an EW. The negative eigenvalues of are a signature of entanglement. They are closely related to other problems in entanglement theory. The negativity is a well-known computable entanglement measure 2002Computable . At the same time, it is the sum of the absolute values of negative eigenvalues of . Also, by the definition of -distillable state Micha1998Mixed , when has more negative eigenvalues, is more likely to be -distillable. Thus, it is important to explore the negative eigenvalues of . The problem of determining how many negative eigenvalues the partial transpose of NPT state could contain has attracted great interest 2008Universal ; 2012Qubit ; 2013Negative ; 2013Non . It was first specified in 2008Universal that has one negative eigenvalue and three positive eigenvalues for any two-qubit entangled state . Next the inertias of the partial transpose of NPT states has been investigated in 2020Inertias . As far as we know, many quantum information queestions turn into intractable when systems are replaced by systems, such as distillability problem Micha1998Mixed ; 1999Evidence , distinguishable subspace problem 2007On , and separability problem 2002Distinguishing .
Due to Sylvester theorem 2011Matrix , we introduce a tool to study the inertia of EW, namely the inertia of a Hermitian operator is invariant under SLOCC. Firstly, we introduce what the two-qutrit subspaces contain for subspaces with various dimensions in Lemma 9. Then we explore a property of the inertia of the partial transpose of bipartite NPT states in Lemma 10. Further we investigate the number of positive eigenvalues of bipartite EWs in Lemma 11. Then we give some observations on the relation between the number of positive eigenvalues and that of negative eigenvalues in Lemma 12. Then we propose two observations on the partial transpose of the two-qutrit NPT states in Lemmas 13 and 14, demonstrated by Example 15. Then we discuss all cases in the partial transpose of the two-qutrit bipartite NPT state in Theorem 16. We draw a conclusion about the inertias of (the partial transpose) of the two-qutrit bipartite NPT states in Theorem 17. Next we propose Example 18 to illustrate Theorem 17(i). We propose Example 19 to show the relationship between the inertias of states and those of states. Finally, we extend some conclusions on the inertias from states to states in Lemma 20.
The remainder of this paper is organized as follows. In section II we introduce the preliminaries by clarifying the notations and presenting necessary definitions and results. In section III we focus on the bipartite EWs constructed by (the partial transpose) of NPT state, and determine intertias of such EWs. In section IV we investigate the inertias of the partial transpose of the two-qutrit bipartite NPT states. Finally, we conclude in section VI. In section V we find out the relationship between the inertias of states and those of states and extend some conclusions on the inertias from states to states. We also partially test the existence of two unverified inertias using python program.
II Preliminaries
In this section we introduce the facts used in this paper. We refer to as the -dimensional Hilbert space. We define as the identity matrix of order . We denote as the n-partite Hilbert space, where ’s are local dimensions. Let be the set of matrices. If is a positive semidefinite matrix of trace one, then is an -partite quantum state. The partial transpose w.r.t. system A of a bipartite matrix is definied as, , where the set of is an arbitrary orthonormal basis in . If has at least one negative eigenvalue then has non-positive partial transpose (NPT). If does not have negative eigenvalues then has positive partial transpose (PPT). We refer to an state as a bipartite such that rank and rank . Given the Schmidt decomposition , we refer to the number of nonzero as the Schmidt rank of . We denote the number as SR(). There is an essential proposition for the matrix inertia, namely Sylvester theorem Horn1985 . It states that Hermitian matrices have the same inertia if and only if there is a non-singular matrix such that .
In the following we review the entanglement witness (EW), inertia and stochastic local operations and classical communications (SLOCC) equivalence.
Definition 1
Suppose is Hermitian. We say that W is an -partite EW if
(i) it is non-positive semidefinite,
(ii) for any product vector with .
Definition 2
Let be Hermitian. The inertia of , denoted by , is defined as the following sequence
(1) |
where and are respectively the numbers of negative, zero and positive eigenvalues of .
Note that if is PPT, then .
Definition 3
Two -partite pure state , are SLOCC equivalent if there exists a product invertible operation such that .
Then we present several results for the state and the EWs 2013Non ; 2020Inertias ; Chen2013 ; 3tensors1983 .
Lemma 4
3tensors1983 Suppose is a bipartite Hilbert subspace.
(i) If , then is spanned by product vectors.
(ii) If , then is either spanned by product vectors or up to SLOCC equivalence spanned by .
Lemma 6
(Chen2013, , Proposition ) Suppose . If then contains at least one product vector. Furthermore, if then has infinitely many product vectors.
Lemma 7
(2020Inertias, , Lemma ) Suppose is an EW on .
(i) Let be the non-positive eigen-space of , i.e., the sum of negative and zero eigen-spaces of W. Then the product vectors in all belong to the zero eigen-space of W. In particular, every vector in the negative eigen-space of W is a pure entangled state.
(ii) The number of negative eigenvalues of W is in . The decomposable EW containing exactly negative eigenvalues exists.
(iii) The number of positive eigenvalues of W is in .
We will apply Lemma 4 to prove Lemma 11. We will use Lemmas 5, 6 and 7 to prove Lemma 17. Then we denote the inertia set, . We introduce some observations on the inertias.
Lemma 8
(2020Inertias, , Lemma ) (i) Suppose is an NPT state and has the inertia . Then there is a small enough and NPT state , such that .
(ii) Suppose and . If , with , then for any we have .
Based on the above preliminary knowledge we are ready to study the inertia of the partial transposes of NPT states.
III Inertias of the partial transposes of NPT states
In this section we focus on the bipartite EWs constructed by the partial transpose of NPT state, and determine intertias of such EWs.
At first, we introduce what the two-qutrit subspaces contain for subspaces with various dimensions.
Lemma 9
Suppose has infinitely many pairwise linearly independent product vectors.
(i) If the dimension of is two, then up to SLOCC equivalence and system permutation contains .
(ii) If the dimension of is three, then up to SLOCC equivalence and system permutation contains or .
(iii) If the dimension of is four, then up to SLOCC equivalence and system permutation contains or or satisfying the conditions and .
(iv) If the dimension of is five, then up to SLOCC equivalence and system permutation contains or or ,
Proof.
(i) If the dimension of is two, then we obtain that one product vector is SLOCC equivalent to . One can verify that the other product vector can only be SLOCC equivalent or system permutated to .
(ii) Suppose the dimension of is three. Since has infinitely many product vectors, it may contain the set from (i). Suppose does not contain the set. It contains product vectors . Up to SLOCC equivalence, we may assume that and . Suppose the third product vector is . Recall that has infinitely many pairwise linearly independent product vectors. So we have that is a product vector and . Then we obtain that the rank of is one. Because these three row vectors are pairwise linearly dependent and , we have . Then we obtain that is SLOCC equivalent to . Then up to SLOCC equivalence and system permutation contains .
(iii) Suppose the dimension of is four. Since has infinitely many product vectors, it may contain the sets or from (ii). Suppose does not contain the sets. That is, we hypothesize that the space spanned by any three product vectors of the set does not generate infinitely many product vectors. The sets contains product vectors . Up to SLOCC equivalence, we may assume that and . Then we discuss three cases (iii.A)-(iii.C) in terms of the third product vector and the fouth product vector .
Because of the hypothesis, can only be . We will divide into two cases up to SLOCC equivalence and permutation. One is , the other is . When is , we will prove it is impossible that is and is in (iii.A). Then we obtain that and are not up to SLOCC equivalent to . Then we consider the other case for . If or , one can prove that generates infinitely many product vectors. We draw a contradiction. So . We obtain that is SLOCC equivalent to in this case. Because are not up to SLOCC equivalent to , we will divide into two cases when . Then we will dicuss the case that is and is in (iii.B), and the case that is and is in (iii.C). Suppose or . up to SLOCC equivalence and system permutation contains . We get that up to SLOCC equivalence and system permutation contains . We draw a contradiction. Then we have . We will suppose and in (iii.C).
(iii.A) Suppose is and is . has infinitely many pairwise linearly independent product vectors. Then we obtain that the rank of is one. These three row vectors are pairwise linearly dependent. Because of the hypothesis, we get that . Then one can verify that the rank of the above matrix is more than one. Then we draw a contradiction.
(iii.B) Suppose is , is . Then we obtain that the rank of is one. One can verify that if the rank of the matrix is one, then . We draw a contradiction.
(iii.C) Suppose is , is and . Then we obtain that the rank of is one. Because of the hypothesis, we get that . If , then by (ii) we have that can generate infinitely many product vectors when . We draw a contradiction. We obtain that . Then we consider the values of and . Suppose . We have that is a -dimensional subspace. We draw a contradiction. So we have that . Similarly, we get that . Suppose and . We define . , if and only if the rank of is one. We obtain that , and . Because the value of is arbitrary, there are various combinations of values of . So we get that up to SLOCC equivalence and system permutation contains and and .
Then we introduce a property of the inertia of an bipartite NPT state.
Lemma 10
Suppose is an bipartite NPT state, and where and . If , then has the inertia or or .
Proof.
Because , we have , , or where and . If or then by the definition of inertia, we obtain that has inertia . Next suppose . We can write up and where
(3) |
We have
(4) | |||||
(5) | |||||
(6) | |||||
(7) |
where has rank one or two. Further, (III) implies that the nonzero vector in is linearly independent from any nonzero vector in . If then is positive semidefinite. So has the inertia . On the other hand if then has at least one positive eigenvalue. So has the inertia or . We have proven the assertion.
Then we investigate the number of positive eigenvalues of bipartite EWs.
Lemma 11
Every bipartite EW has at least three positive eigenvalues.
Proof.
It is known that every bipartite EW has at least two positive eigenvalues. Thus, we have to show that there is no EW with exact two positive eigenvalues. Assume that is an EW which has inertia . Then the spectral decomposition of reads as
(8) |
where are pairwisely orthogonal. It follows from Lemma 4 that the non-positive eigenspace of is either spanned by product vectors or up to SLOCC equivalence spanned by .
First, if is spanned by product vectors, there exists a product vector which is orthogonal to but non-orthogonal to . Hence, we obtain that
(9) |
It is a contradiction.
Second, if is spanned by up to SLOCC equivalence. It follows that is spanned by . It is known that every two-qubit EW has inertia . Hence, we assume one of is greater than two. Suppose one of the local dimensions is two. For example, we may assume . Using the projector we obtain that
(10) |
It follows that is negative semidefinite. It implies . However, we have
(11) |
The last inequality follows from is an EW. Thus, we derive a contradiction. Finally, suppose . Using the projector we similarly obtain that is negative semidefinite. It follows that . However, for the same reason (11) we also have . We derive a contradiction again. Therefore, such an EW which has exact two positive eigenvalues does not exist.
This completes the proof.
We give some observations on the relation between and on the inertia.
Lemma 12
Suppose is an EW on . Suppose the negative space of is spanned by and the positive space is spanned by . If is supported in and is supported in and and , then we can choose a projector such that is negative semidefinite.
IV Inertias of the partial transpose of the two-qutrit bipartite NPT states
In this section we focus on the inertias of the two-qutrit bipartite NPT states. In Subsec. IV.1, we propose two observations on of the two-qutrit NPT states in Lemmas 14 and 13 firstly. For understanding the partial transpose of the two-qutrit bipartite NPT states in Example 15. Then we discuss all cases in the two-qutrit bipartite NPT state in detail in Theorem 16. In Subsec. IV.2, we draw a conclusion about in Theorem 17. Finally we propose Example 18 to illustrate Theorem 17(i).
IV.1 Supporting lemmas
At first, we propose some observations on the two-qutrit NPT states.
Lemma 13
Let be a two-qutrit NPT state. Then we have,
(i) if and are in , then is one of the arrays in Theorem 17(i).
(ii) .
Proof.
(i) If , then we have . Then we have that the first row and column of consist of zero entries. Similarly, if , then we have . Then we have that the second row and column of consist of zero entries.
So can be written as Because , we have . Then can be written as . We have by . If , then .
If , then we have . There exists a local invertible product operator such that , where is a state.
We have known that from (2020Inertias, , Corollary ). Then one can verify that is one of the 13 arrays in Theorem 17(i).
(ii) Suppose . Then we have . Because the dimension of non-positive eigen-space of is , we obtain that the non-positive eigen-space of has infinitely many product vectors from Lemma 6. From Lemma 7 we obtain that contains infinitely many product vectors. We have . If and are linearly dependent, then we can find an invertible operator such that and . Then we have . Let . We obtain that by Sylvester theorem. Then and are in . From (i) we derive a contradiction. So we have .
Lemma 14
Let be a two-qutrit NPT state. Then we have,
(i) if , and are in , then is one of the arrays in Theorem 17(i).
(ii) if satisfying the conditions and are in , then is one of the arrays in theorem 17(i).
(iii) .
Proof.
(i) If , then we have . Then we have that the first row and column of consist of zero entries. Similarly, if , then we have . Then we have that the fifth row and column of consist of zero entries. We have .
So can be written as Because , we have . Then can be written as
Because is a positive semi-definite matrix, then can be written as
Then we obtain that and are in the . We obtain that is one of the arrays in Theorem 17(i) from Lemma 13(i).
(ii) If , then we have . Then we have that the first row and column of consist of zero entries. Similarly, if , then we have . Then we have that the fifth row and column of consist of zero entries. We have . Then we have that .
So can be written as Because , we have . Then we have that , , and . Then can be written as Because is a positive semi-definite matrix and is a hermitian matrix, then can be written as
Then we obtain that and are in the . We obtain that is one of the arrays in Theorem 17(i) from Lemma 13(i).
(iii) If or , we obtain that the non-positive eigen-space of has infinitely many product vectors form Lemma 6. Then we obtain that the zero eigen-space of has infinitely many product vectors from Lemma 7(i). If , then the zero eigen-space of is up to SLOCC equivalence spanned by or by Lemma 9(ii). If , then the zero eigen-space of is up to SLOCC equivalence spanned by or or satisfying the conditions and by Lemma 9(iii). Then in these two cases we obtain that and are in the . is one of the 12 arrays in Theorem 17(i) from (i) and (ii). Then we derive a contradiction. So we have .
We propose an example to understand the two-qutrit bipartite NPT states in Example 15. Then we discussed all cases in the two-qutrit bipartite NPT states in detail in Theorem 16.
Example 15
Suppose is a two-qutrit bipartite NPT state.
Then can be written as . Then can be written as . Then we obtain that . We get that has six constant eigenvalues, . The other three eigenvalues of are the three roots of . Suppose these three roots are respectively. We obtain that and . Then we obtain that three eigenvalues are , and . We get that and . So nine eigenvalues of are . The interia .
In this example, we investigate the interia of a two-qutrit bipartite NPT state of rank two. We define the case of SR and SR as a binary array . We get that has six cases, , , , , , . In the case of , is a separable state. We need to get rid of . On the other hand, the case is equivalent to the one of the remaining four cases. So it suffices to study four cases of two-qutrit bipartite NPT states of rank two as follows.
Theorem 16
Suppose is a two-qutrit bipartite NPT state.
(i) If SR and SR, then we have .
(ii) If SR and SR, then we have .
(iii) If SR and SR, then we have .
(iv) If SR and SR, then we have .
Proof.
Suppose is a two-qutrit bipartite NPT state,
(12) |
.
(i) If SR in Eq(12), then we have that is up to SLOCC equivalent to . If SR, then we have that is up to LOCC equivalent to . Then we have . Then we get that nine eigenvalues are . Then . In conclusion, we obtain that if SR and SR, then we have .
(ii) If SR in Eq(12), then we have that is up to SLOCC equivalent to . If SR, then we have that cotains and . Because is equivalent to , we have that is up to SLOCC equivalent to . We get that at least one of and contains . So has two cases. One case is that is up to SLOCC equivalent to , the other case is that is up to SLOCC equivalent to .
(ii.a) Suppose in Eq(12). Then we have . Then we get that nine eigenvalues are . Then .
(ii.b) Suppose in Eq(12).
Then we have . Then we get that six eigenvalues are . The other three eigenvalues are the roots of . These three roots are two negative roots and one positive root. Then . In conclusion, we obtain that if SR and SR, then we have .
(iii) If SR in Eq(12), then we have that is up to SLOCC equivalent to . If SR, then we have that is up to SLOCC equivalent to . From Example 15, we get that .
(iv) If SR in Eq(12), then we have that is up to SLOCC equivalent to . If SR, then we have that is up to SLOCC equivalent to . Suppose is a two-qutrit invertible matrix. There exists a two-qutrit invertible matrix , such that and or . Then has two cases, and . The case is SLOCC equivalent to the case . There exists a two-qutrit invertible matrix , such that and or . The case is divided into two cases and . Similarly, the case is divided into two cases and . If SR, then has four cases , , , .
(iv.a) Suppose in Eq(12). Then we have . We know that and have the same inertia when is an elementary matrix. We obtain that has the same inertia as , where is a product of some elementary matrices. Then we get that the six eigenvalues of are . can be a positive or zero or negative number. Then when , when , when .
(iv.b) Suppose in Eq(12). If , then SR and we reduce to (iii). Then we have and . So we have is equivalent to . Then we have . We have known that and have the same inertia when is an elementary matrix. We obtain that has the same inertia as , where is a product of some elementary matrices. Then we get that nine enigenvalues are . Then .
(iv.c) Suppose in Eq(12). Then we have . Suppose . Similar to (iv.a), we get that has the same inertia as , where is a product of some elementary matrices. Then we get that nine enigenvalues are . Then . If , we get that has the same inertia as , where is a product of some elementary matrices. Then we get that nine enigenvalues are . can be a positive or zero or negative number. Then . In conclusion, we obtain that .
(iv.d) Suppose in Eq(12). If , then SR and we reduce to (iii). Then we have and . So is equivalent to . Then we have . Similar to (iv.b), we get that has the same inertia as , where is a product of some elementary matrices. Then we get that nine enigenvalues are . Then .
In conlusion, if SR and SR, then we have .
IV.2 Main conclusion
We have proposed some observations about two-qutrit bipartite NPT states in Subsec. IV.1. Then we investigate the set . We have the following observations.
Theorem 17
(i) has the following arrays, , , , , , , , , , , , , .
(ii) does not have the following three arrays, , , .
(iii) might have the following two arrays, , .
(iv) , is a subset of above (i) and (iii)’s arrays.
Proof.
(i) We obtain that by (2020Inertias, , Corollary ). Using Lemma 8 we obtain that, . We obtain that by Lemma 5. We obtain that by (2013Negative, , Example ). We obtain that by Theorem 16.
(ii) We have known that by (2020Inertias, , Lemma ) and by Lemma 17. We have that . Then migtht have the following five arrays, , , , , . Then we have that by Lemma 13 and 14.
(iii) From (ii), we get that might have the following two arrays, , .
(iii) We have by the results in (i),(ii),(iii) and is a subset of above (i) and (iii)’s arrays.
Then we propose the following example to illustrate the Theorem 17(i).
Example 18
Suppose is a two-qutrit bipartite NPT state. (i) Suppose . Then .
(ii) Suppose . Then .
(iii) Suppose . Then .
(iv) Suppose . Then .
(v) Suppose . Then .
(vi) Suppose . Then .
(vii) Suppose . Then .
(viii) Suppose . Then .
(ix) Suppose . Then .
(x) Suppose . Then .
(xi) Suppose . Then .
(xii) Suppose . Then .
(xiii) Suppose . Then .
V application
In this section, we study the relationship between the inertias of states and those of states firstly. Next we extend some conclusions on the inertias from states to states. We also partially test the existence of two unverified inertias using python program.
We have obtained that 2020Inertias . Then we have obtained that , , , , , , , , , , , , in Theorem 17. By Theorem 17 (i), we have also obtained that , , , , , are from , and , , , are from . Next we consider the remaining three inertias, , and . From Example 18 (xi), (xii), (xiii), we propose the following example.
Example 19
Suppose is a bipartite NPT state.
(xi) Suppose . Then .
(xii) Suppose . Then .
(xiii) Suppose . Then .
From this example, we get that is from , and , are from by Example 19. We conclude the above findings in the following table.
So far we have investigated the states. Next we will extend the conclusions from low dimensional states to high dimensional states. For extending the conclusions on the inertias from states to states, we consider the inertias of in the following.
Lemma 20
There are at least inertias in , i.e.,
, for .
Furthermore, these inertias in are as follows.
, ,
, ,
…
, .
Proof.
We have obtained that 2020Inertias . Using Lemma 8 we have that , .
Similarly, we also have that
, ,
…
, .
So we obtain that obtains at least , namely inertias.
Finally, we partially investigate the existence of inertia and in terms of numerical test by using a python program. We utilize a program package named numpy 111Oliphant,T.E. A guide to NumPy (Vol.1, p.85).USA: Trelgol Publishing.(2006). to generate a real random matrix 222https://machinelearningmastery.com/how-to-generate-random-numbers-in-python/(2018).. Then we multiply by its transpose to obtain a random positive semi-definite matrix 333https://en.m.wikipedia.org/wiki/Definite matrixNegative-definite.2C semidefinite and indefinite matrices(2002).. After transforming into , the program only need to calculate the feature values of and judge its inertia index, which turns out to be neither of the two inertias or . Such a numerical test supports the conjecture that neither of the two inertias exists.
VI Conclusion
We have investigated two-qutrit EWs constructed by the partial transpose of NPT states. Furthermore, we investigated the inertias of the two-qutrit bipartite NPT states. One open problem is to deterimine whether are in . In the future, we need to extend more conclusions on the inertias from low dimensional states to high dimensional states.
References
- [1] Ryszard Horodecki, Pawel Horodecki, Michal Horodecki, and Karol Horodecki. Quantum entanglement. Review of Modern Physics, 2007.
- [2] Otfried Gühne and Géza Tóth. Entanglement detection. Physics Reports, 474(1):1–75, 2009.
- [3] E. Chitambar and G. Gour. Quantum resource theories. Review of Modern Physics, 91(2), 2019.
- [4] Patricia, Contreras-Tejada, Carlos, Palazuelos, Julio, I, de, and Vicente. Resource theory of entanglement with a unique multipartite maximally entangled state. Physical review letters, 2019.
- [5] P. Walther, K. J. Resch, T. Rudolph, E. Schenck, H. Weinfurter, V. Vedral, M. Aspelmeyer, and A. Zeilinger. Experimental one-way quantum computing. Nature, 2005.
- [6] M. Riebe, H Haffner, C. F. Roos, W Hansel, J. Benhelm, and Lancaster Gpt. Deterministic quantum teleportation with atoms. Nature, 429(6993):734–7, 2004.
- [7] X. Li, Q. Pan, J. Jing, J. Zhang, and K. Peng. Quantum dense coding exploiting a bright einstein-podolsky-rosen beam. Physical Review Letters, 88(4):047904, 2002.
- [8] J. Yin, Y. H. Li, S. K. Liao, M. Yang, and J. W. Pan. Entanglement-based secure quantum cryptography over 1,120 kilometres. Nature, 582(7813):1–5, 2020.
- [9] Zhang Q Lo H-K Xu F, Ma X and Pan J-W. Secure quantum key distribution with realistic devices, 2020.
- [10] A. Peres. Separability criterion for density matrices. Phys. Rev. Lett., 77:1413, 1996.
- [11] P. Horodecki. Separability criterion and inseparable mixed states with positive partial transposition. Phys. Lett. A, 232:333, 1997.
- [12] Rudolph and Oliver. Some properties of the computable cross norm criterion for separability. Physical Review A, 67(3):535–542, 2002.
- [13] Lawrence L Larmore and Michel X Goemans. Proceedings of the 35th annual acm symposium on theory of computing, june 9-11, 2003, san diego, ca, usa. In STOC, 2003.
- [14] B. M. Terhal and Kgh Vollbrecht. Entanglement of formation for isotropic states. Physical Review Letters, 85(12):2625, 2000.
- [15] D. Amaro and M Müller. Design and experimental performance of local entanglement witness operators. 2019.
- [16] Zheng Da Li, Qi Zhao, Rui Zhang, Li Zheng Liu, and Jian Wei Pan. Measurement-device-independent entanglement witness of tripartite entangled states and its applications. Physical Review Letters, 124(16), 2020.
- [17] G. Vidal and R. F. Werner. Computable measure of entanglement. Physical Review A, 65(3):032314, 2002.
- [18] Micha, Horodecki, Pawe, Horodecki, Ryszard, and Horodecki. Mixed-state entanglement and distillation: Is there a ”bound” entanglement in nature? Physical Review Letters, 80(24):5239–5242, 1998.
- [19] R. Augusiak, M. Demianowicz, and P. Horodecki. Universal observable detecting all two-qubit entanglement and determinant-based separability tests. Physical Review A, 2008.
- [20] C. Lin and Dragomir Z. Djokovic. Qubit-qudit states with positive partial transpose. Physical Review A, 86(6):12510–12517, 2012.
- [21] S. Rana. Negative eigenvalues of partial transposition of arbitrary bipartite states. PHYSICAL REVIEW A, 87(5):1–4, 2013.
- [22] N. Johnston. Non-positive-partial-transpose subspaces can be as large as any entangled subspace. Physical Review A, 87(6):459–496, 2013.
- [23] Y. Shen, L. Chen, and L. J. Zhao. Inertias of entanglement witnesses. Journal of Physics A: Mathematical and Theoretical, 53(48):485302 (27pp), 2020.
- [24] D. P. Divincenzo, P. W. Shor, J. A. Smolin, B. M. Terhal, and A. V. Thapliyal. Evidence for bound entangled states with negative partial transpose. 1999.
- [25] C. King and D. Matysiak. On the existence of locc-distinguishable bases in three-dimensional subspaces of bipartite 3 × n systems. Journal of Physics A Mathematical and Theoretical, 40(28):7939, 2007.
- [26] A. C. Doherty, P. A. Parrilo, and F. M. Spedalieri. Distinguishing separable and entangled states. Physical Review Letters, 88(18):187904–187904, 2002.
- [27] R. Bhatia. Matrix Analysis. Matrix Analysis, 2011.
- [28] Horn R A and Johnson C R (ed). Matrix analysis (cambridge: Cambridge university press), 1985.
- [29] Chen L and Djokovic D Z. Properties and construction of extreme bipartite states having positive partial transpose, 2013.
- [30] M. D. Atkinson and S. Lloyd. The ranks of. SIAM Journal on Computing, 12(4):611–615, 1983.