Separability Criterion for Multipartite Pure States
Zongwen Yu, Su Hu

TL;DR
This paper introduces new criteria for determining the separability of multipartite pure quantum states, including an efficient algorithm that does not require Schmidt decomposition, advancing the analysis of quantum entanglement.
Contribution
The paper presents novel separability criteria and an algorithm that simplifies the process without needing Schmidt decomposition, improving the analysis of multipartite quantum states.
Findings
Established a relationship between separability and Schmidt decomposability.
Derived a criterion that does not require Schmidt decomposition.
Provided an effective algorithm for separability judgment.
Abstract
In this paper, we give out some effective criterions which can be used to judge the separability of multipartite pure states. We obtain the relationship between separability and Schmidt decomposable of multipartite pure states in Theorem1. The first criterion derived from Theorem2 dose not need the Schmidt decomposition which is hard to find for multipartite states. Theorem3 is more profound which can be used to deduce Corollary1 which is one of the main results in [1]. Finally, we give out an algorithm which can be used to judge the separability of multipartite pure states effectively.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning in Materials Science · Cold Atom Physics and Bose-Einstein Condensates
Separability Criterion for Multipartite Pure States
Zongwen Yu
Su Hu
Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China
Abstract
In this letter, we give out some effective criterions which can be used to judge the separability of multipartite pure states. We obtain the relationship between separability and Schmidt decomposable of multipartite pure states in Theorem 1. The first criterion derived from Theorem 2 dose not need the Schmidt decomposition which is hard to find for multipartite states. Theorem 3 is more profound which can be used to deduce Corollary 1 which is one of the main results in DafaLi2006 . Finally, we give out an algorithm which can be used to judge the separability of multipartite pure states effectively.
pacs:
03.67.-a, 03.67.Hk, 03.67.Mn
The state is one of the fundamental concepts in quantum computation and information which can be classified into pure state and mixed state. In view of the purification NC2000 , we always pay attention to the pure states with related technique for quantum computation and quantum information. The pure states can be classified into pure separable states and pure entanglement states. Entanglement is a valuable physical resource for accomplishing many useful quantum computing and quantum information processing tasks NC2000 . For certain tasks such as superdense coding Ben1992 and quantum teleportation Ben1993 , it has been demonstrated that entanglement is an indispensable ingredient. For many other tasks entanglement is also used to enhance the efficiency Childs2000 ; Acin2001 ; DA2001 ; ZFJi2006 . The question of quantifying entanglement of multipartite quantum states is fundamental to the whole field of quantum information and in general to the physics of multicomponent quantum systems. Separability is a theoretical foot stone to define the measures of entanglement. As a result, the problem of separability, that is whether a quantum state is separable or entangled, is fundamental. Some authors have given some separability criterions, valid under certain conditions Peres1996 ; Wu2000 ; Vcoffman2001 ; JEisert2004 ; YuChSh2005 ; DafaLi2006 . In this letter, we will devote to the separability criterions for any multipartite pure state.
Let be a pure state of a composite system AB possessed by Alice and Bob, then we know that has Schmidt decomposition NC2000 . It is also known that a state of a bipartite system is separable if and only if it has Schmidt number 1 NC2000 . So we can judge a bipartite pure state to be separable or not by computing its Schmidt number. Unfortunately, the Schmidt decomposition does not always exist for any multi()-partite pure state when . In order to extend the forward criterion to any multipartite pure state, some pioneers have paid their attentions to the conditions of the occurrence of Schmidt decomposition for multipartite pure states. Peres Peres1995 presented a necessary and sufficient condition for the occurrence of Schmidt decomposition for a tripartite pure state and Peres1996 showed that the positivity of the partial transpose of a density matrix is a necessary condition for separability. Unfortunately, this criterion is only necessary for a pure state to be separable, but not sufficient. Thapliyal Thap1999 showed that a multipartite pure state is Schmidt decomposable if and only if the deduced density matrices obtained by tracing out any party are separable. We should note that the separable states in Thapliyal’s criterion contain the pure separable states and the mixed separable states. Making use of the Schmidt decomposition we will get the first criterion.
Let be a pure state in a dimensional -partite quantum system , which is composed by the subsystems . So we have and denote where is the dimension of -th subsystem for . Because is a pure state in , we have , where are the orthonormal basis of subsystems and are the amplitudes with . By definition, a -partite pure state is separable if and only if there exits pure states respectively belonging to subsystems and . Generalizing the separability condition for a bipartite pure state we have the following theorem.
Theorem 1**.**
A -partite pure state is separable if and only if it is Schmidt decomposable and has Schmidt number 1.
Proof.
If a -partite pure state is separable, then we have
[TABLE]
where is a pure state in for respectively. Let and choose to make to be the orthonormal basis of subsystems for . Taking into account Eq. (1), if we choose and , then we have
[TABLE]
which is actual the Schmidt decomposition and we know that the Schmidt number of is 1.
On the other hand, if a -partite pure state is Schmidt decomposable and has Schmidt number 1. Supposing that , then we have , where is a pure state in for . ∎
Taking into account Theorem 1, we can judge the separability of any -partite pure state by finding its Schmidt decomposition. In order to obtain the Schmidt decomposition of a -partite pure state , we need to compute (1) the density operator , (2) the reduced density operators and (3) the eigenvalues of . However it is hard to compute all the eigenvalues of high dimensional density operators exactly. Theorem 1 does not give us an effective criterion. In the following, we will introduce some effective separability criterions.
Any quantum state can be represent by a density operator. For a -partite pure state in , its density operator is . Taking the partial trace operation on each -th subsystem , we get reduced density operators (with multiplication operations and plus operations in the worst case) for .
In order to judge the separability of a -partite pure state there is no need to find the Schmidt decomposition since we have the following theorem.
Theorem 2**.**
A -partite pure state is separable if and only if
[TABLE]
where are the matrices related to the reduced density operators for . are the identity matrices and have the same dimension with for .
By using the characterizations of density operators (trace and positivity conditions) NC2000 , we can easily prove the following lemma.
Lemma 1**.**
The rank of matrices are all equal to 1 if and only if Eq. (3) can be obtained.
Then we can give out the proof of Theorem 2 by using Lemma 1.
Proof.
Taking into account Theorem 1 and Lemma 1, we need only to prove that the -partite pure state is Schmidt decomposable and has Schmidt number 1 if and only if the rank of matrices are equal to 1 for .
If the -partite pure state is Schmidt decomposable and has Schmidt number 1, then we have . We can calculate the density operator and reduced density operators
.
So we have
[TABLE]
This means that only have 1 to be their nonzero eigenvalues. So Eq. (3) is obtained.
On the other hand, all the matrices only have 1 to be their nonzero eigenvalues. Denote to be the eigenvectors of corresponding to the eigenvalues 1 for respectively. Then we have which is the Schmidt decomposition of with Schmidt number 1. So is separable. ∎
Theorem 2 can be used to judge the separability of any n-partite pure state. For example, -cat state (in honor of Schrdinger’s cat ) is with the Einstein-Podolsky-Rosen-Bohm pair when and the Greenberger-Hone-Zeilinger-Mermin state when . We have the density operator and reduced operators which means that
[TABLE]
Then we have which means that the -cat state is an entanglement pure state by Theorem 2.
Theorem 2 give us an separability criterion for any -partite pure state. The total number of times the criterion has to run, in the worst case, is with the most operations being used for computing the determinants.
For a -partite pure state, we have . Let are matrices of the amplitudes of the form
[TABLE]
We have the following lemma without proof.
Lemma 2**.**
The reduced density matrices satisfy the following equations.
[TABLE]
where are given by Eq. (4) and are the Hermitian of .
To avoid the Schmidt decomposition, by using Lemma 1 and Lemma 2 we also obtain the following theorem.
Theorem 3**.**
A -partite pure state is separable if and only if the rank of matrices are equal to 1 for .
Proof.
Theorem 2 and Lemma 1 tell us that a -partite pure state is separable if and only if the rank of matrices are equal to 1. Taking into account Lemma 2, we know that the rank of matrices are equal to 1 if and only if the rank of are equal to 1. ∎
Corollary 1**.**
A -partite pure state is separable if and only if the determinants of all the submatrices of are zeros.
Using Theorem 3, we can easily prove Corollary 1 which is the main result of Dafa Li in DafaLi2006 . In fact, Theorem 3 and Corollary 1 are equivalent, but this does not mean they have the same efficiency. Corollary 1 can give us another criterion with times to be used in the worst case. By using Theorem 3, we obtain a more effective criterion.
Corollary 2**.**
A -partite pure state is separable if and only if
[TABLE]
where are any fixed nonzero elements in matrices for respectively and is the -th column of the matrix for .
Proof.
Taking into account Theorem 3, we only need to prove that the rank of matrices are equal to 1 if and only if Eq. (2) is true.
If the rank of matrices are equal to 1, then any two columns of are linearly dependent. This will imply Eq. (2).
On the other hand, Eq. (2) implies that any two columns of are linearly dependent. Since are not zero matrices, We have the rank of matrices are equal to 1. ∎
For example, considering the -cat state , we have
[TABLE]
We can see , where are the first and second columns of . So -cat state is an entanglement state as we know.
Using Corollary 2, we have an effective algorithm which can be used to judge the separability of a -partite pure state. The algorithm contains the following 3 steps. Step1: Construct matrices from the -partite pure state by Eq. 4; Step2: Deleting the zero columns and the zero rows of the matrices . The result matrices are also denoted by . Step 3: If Eq. (2) does not true for some , then stop and we get is an entanglement pure state, otherwise, is a separable pure state. The total number of times the algorithm has to run, in the worst case, is .
In this letter, we have given some necessary and sufficient conditions for the separability of a multipartite pure state. Using these conditions we get some criterions which can be used to judge the separability of a multipartite pure state. Finally, an effective algorithm deduced from Corollary 2 has been provided.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1(1) Dafa Li et al., quant-ph/0604147.
- 2(2) M.A. Nilsen and I.L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Canbridge, England, 2000).
- 3(3) C.H. Bennett and S.J. Wiesner, Phys. Rev. Lett. 69, 2881 (1992).
- 4(4) C.H. Bennett et al., Phys. Rev. Lett. 70, 1895 (1993).
- 5(5) A.M. Childs, J. Preskill and J. Renes, J. Mod. Opt. 47, 155 (2000).
- 6(6) G.M. D’Ariano, P. Lo Presti and M.G.A. Paris, Phys. Rev. Lett. 87, 270404 (2001).
- 7(7) A. Ac i ´ ´ 𝑖 \acute{i} n, Phys. Rev. Lett. 87, 177901 (2001).
- 8(8) Z.F. Ji, Y. Feng, R.Y. Duan and M.S. Ying, Phys. Rev. Lett. 96, 200401 (2006).
