Abstract
The correlation matrices or tensors in the Bloch representation of density matrices are encoded with entanglement properties. In this paper, based on the Bloch representation of density matrices, we give some new separability criteria for bipartite and multipartite quantum states. Theoretical analysis and some examples show that the proposed criteria can be more efficient than the previous related criteria.
Similar content being viewed by others
Introduction
Quantum entanglement is a fascinating phenomenon in quantum physics. It can be seen as a physical resource like energy with applications from quantum teleportation to quantum cryptography1,2,3,4,5. In the last years, much work has been devoted to understanding entanglement, but there are still many problems unsolved. One of them is to determine whether a given quantum state is entangled or separable. This problem is extremely difficult to solve, and has been proved as a nondeterministic polynomial-time hard problem6. Nevertheless, a variety of operational criteria for separability of quantum states have been proposed in the last decades. Among them are the positive partial transpose (PPT) criterion or Peres-Horodecki criterion7,8, realignment criteria9,10,11,12,13, covariance matrix criteria14,15,16 and so on; see, e.g.17,18, for a comprehensive survey.
The Bloch representation19,20,21 of density matrices stands as an important role in quantum information. The correlation matrices or tensors in the Bloch representation are encoded with entanglement properties22,23, which can be exploited to study quantum entanglement. In ref. 24, by making use of correlation matrices, Vicente obtained the correlation matrix criterion for bipartite quantum states, which can be more efficient than the PPT criterion7,8 and the computable cross norm or realignment (CCNR) criterion9,10 in many different situations. After that, this criterion was used to give the analytical lower bounds for the entanglement measures: concurrence and tangle25,26, which are good supplement to the lower bounds based on PPT and CCNR criteria. By the matricizations of tensors, the correlation matrix criterion was generalized to detect non-full-separability of multipartite states27. Later, this multipartite criterion was extended and improved to be a much more general case28. Meanwhile, by the standard tensor norm and the norms of matricizations of tensors, some genuine entanglement conditions were derived. In refs 22, 23, some simple geometrical methods based on correlation tensors were presented to detect various multipartite entanglement. By bounding tensor norms for partially separable states and states of limited dimension, Klöckl and Huber29 studied the detection of multipartite entanglement in an experimentally feasible way. In many cases, only few definite measurements are needed. Recently, Li et al.30 presented some separability criteria under the combination of correlation matrices and the Bloch vectors of reduced density matrices, which can be stronger than the correlation matrix criterion24 by examples.
This paper is further devoted to an investigation of entanglement detection in terms of Bloch representations of density matrices. On the one hand, by adding some parameters, a more general separability criterion for bipartite states is presented, which can outperform the corresponding criteria given in24,30. On the another hand, the presented bipartite separability criterion is extended to the multipartite case. An example shows that the new multipartite separability criterion can be better than the corresponding criteria obtained in refs 27, 28 and 30.
Results
Separability criteria for bipartite states
Let be the traceless Hermitian generators of SU(d) satisfying the orthogonality relation . Then any state ρ in can be represented as21
where Id denotes the d × d identity matrix,
Denote by ||·||tr, ||·||2 and Ep×q the trace norm (the sum of singular values), the spectral norm (the maximum singular value) and the p × q matrix with all entries being 1, respectively. By defining , and T = (tij), we construct the following matrix
where α and β are nonnegative real numbers, m is a given natural number, t stands for transpose, and for any column vector x,
Using , we can get the following separability criterion for bipartite states.
Theorem 1. If the state ρ in is separable, then
See Methods for the proof of Theorem 1.
When α and β are chosen to be 0, Theorem 1 reduces to the correlation matrix criterion in ref. 24: if ρ in is separable, then
If we choose α = β = m = 1, then Theorem 1 becomes the separability criterion given in [30, Corollary 2]: any separable state ρ in must satisfy
For simplicity, we call these criteria in (6) and (7) the V-B and L-B criteria, respectively. The following result can help us find that our separability criterion from Theorem 1 is stronger than the V-B and L-B criteria.
Proposition 1. If α and β are selected to satisfy
then Theorem 1 becomes more effective when m gets larger.
See Methods for the proof of Proposition 1.
From Proposition 1, Theorem 1 with the condition (8) is stronger than the V-B criterion.
For the case d1 = d2 and α = β, it follows from Proposition 1 that Theorem 1 is more efficient when m gets larger. In particular, Theorem 1 is better than the L-B criterion, and the L-B criterion is better than the V-B criterion. For the case d1 ≠ d2, let us consider the following example. The following 2 × 4 bound entangled state is due to31:
where 0 < b < 1. To verify the efficiency of the present criteria, we consider the state
where . For simplicity, we choose
Then Theorem 1 can detect the entanglement in ρx for 0.2235 ≤ x ≤ 1, while the V-B criterion and L-B criterion can only detect the entanglement in ρx for 0.2293 ≤ x ≤ 1 and 0.2841 ≤ x ≤ 1, respectively. Thus, Theorem 1 is better than the V-B and L-B criteria.
Separability criteria for multipartite states
Let be an f1 × ··· × fN tensor, A and be two nonempty subsets of {1, ···, N} satisfying . Then we denote by the matricization of ; see28 for detail. This matricization is a generalization of mode-n matricization in the multilinear algebra32.
For any state ρ in , we import a natural number m and nonnegative real parameters α1, ···, αN, and define
We define the tensor with elements
Clearly, if m = 0, the tensor reduces to the correlation tensor in ref. 27. When m = α1 = ··· = αN = 1, the tensor becomes the tensor with a constant multiple in ref. 30.
An n partite sate ρ in is (fully) separable33 if and only if it can be written in the form
where the probabilities , and are pure states of the subsystems.
In the following, we give the full separability criterion based on .
Theorem 2. If the state ρ in is fully separable, then, for any subset A of {1, ···, N}, we have
See Methods for the proof of Theorem 2.
For the case α1 = ··· = αN = 0, Theorem 2 reduces to the criterion given in [28, Theorem 4], which has an important improvement on the corresponding criterion given in ref. 27. If α1 = ··· = αN = 1 and m = 1, then Theorem 2 becomes [30, Corollary 3]. For simplicity, we call these criteria in refs 27, 28 and 30 V-M, H-M and L-M criteria, respectively. In the following we give a tripartite example to demonstrate the efficiency of Theorem 2. Consider a perturbation of the tripartite GHZ state16:
where is a given real parameter, and γ denotes the normalization. We consider the mixture of this state with the maximally mixed state:
In the tripartite case, the V-M criterion is equivalent to the H-M criterion obviously. By taking m = 1 and α1 = α2 = α3 = 0.1, Table 1 displays the detection results with different values of . Clearly, Theorem 2 is more efficient than the V-M, H-M and L-M criteria.
Discussions
Correlation matrices or tensors in the Bloch representation of quantum states contain the information of entanglement of the quantum states. Based on the Bloch representation of quantum states, we have given some new separability criteria including the V-B, L-B, V-M, H-M and L-M criteria as special cases. For bipartite cases, by choosing some special parameters involved, our criteria are stronger than the V-B and L-B criteria. For multipartite cases, by a simple example it has been also shown that our criterion can be more efficient than the V-M, H-M and L-M criteria.
Nevertheless, the problem of how to choose the involved parameters such that Theorems 1–2 can detect more entangled states needs to be further studied in the future. In the Bloch representation (1), the traceless Hermitian generators of SU(d) come from Gell-Mann matrices. But this is by far not the only possible choice. Maybe the new basis of observables34 constructed from Heisenberg-Weyl operators can be used to obtain better separable criteria, since the Heisenberg-Weyl based observables can outperform the canonical basis of generalized Gell-Mann operators in entanglement detection34. Thus, this problem is worth studying in the coming days.
It should be noted that the separability criteria Theorems 1–2 presented in30 for bipartite and multipartite states are at most as good as the corresponding V-B, L-B, V-M and L-M criteria, respectively. For example, set . It was shown by [30, Theorem 1] that any separable state ρ in satisfies
where M = (mij) is any real matrix. From (18) and35, we get
which implies that the L-B criterion is at least as good as the criterion (18). Other cases can be proved similarly.
Methods
Proof of Theorem 1. Since ρ is separable, from [24, (17)], it follows that there exist vectors and such that
where
Thus, the matrix can be written as
and then
where we have used the following equality, for any vectors |a〉 and |b〉,
■
Proof of Proposition 1. For any state ρ, from [24, Lemma 1], we get
If the inequality from (5),
holds, then from (25) we have
where the equality (24) has been used in the first and fifth equalities, and, in the third and fourth equalities, we have employed the fact that the trace norm of a Hermitian positive semidefinite matrix is equal to its trace.
Proof of Theorem 2. Without loss of generality, we assume that
Since ρ is fully separable, then from27 there exist vectors such that
where
Thus,
where we have used the equality (24).
Additional Information
How to cite this article: Shen, S.-Q. et al. Improved Separability Criteria Based on Bloch Representation of Density Matrices. Sci. Rep. 6, 28850; doi: 10.1038/srep28850 (2016).
References
Nielsen, M. A. & Chuang, I. L. Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, England, 2000).
Ekert, A. K. Quantum cryptography based on Bells theorem. Phys. Rev. Lett. 67, 661 (1991).
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A. & Wootters, W. K., Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Phys. Rev. Lett. 70, 1895 (1993).
Gao, T., Yan, F. L. & Li, Y. C., Optimal controlled teleportation. Europhys. Lett. 84, 50001 (2008).
Bennett, C. H. & Wiesner, S. J., Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Phys. Rev. Lett. 69, 2881 (1992).
Gurvits, L. In Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing (ACM Press, New York), pp. 10–19 (2003).
Peres, A. Separability criterion for density matrices. Phys. Rev. Lett. 77, 1413 (1996).
Horodecki, M., Horodecki, P. & Horodecki, R. Separability of mixed states: necessary and sufficient conditions. Phys. Lett. A 223, 1–8 (1996).
Rudolph, O. Some properties of the computable cross-norm criterion for separability. Phys. Rev. A 67, 032312 (2003).
Chen, K. & Wu, L. A. A matrix realignment method for recognizing entanglement. Quantum Inf. Comput. 3, 193–202 (2003).
Rudolph, O. Further results on the cross norm criterion for separability. Quantum Inf. Process. 4, 219–239 (2005).
Zhang, C. J., Zhang, Y. S., Zhang, S. & Guo, G. C. Entanglement detection beyond the computable cross-norm or realignment criterion. Phys. Rev. A 77, 060301(R) (2008).
Aniello, P. & Lupo, C. A class of inequalities inducing new separability criteria for bipartite quantum systems. J. Phys. A: Math. Theor. 41, 355303 (2008).
Gühne, O., Hyllus, P., Gittsovich, O. & Eisert, J. Covariance matrices and the separability problem. Phys. Rev. Lett. 99, 130504 (2007).
Gittsovich, O., Gühne, O., Hyllus, P. & Eisert, J. Unifying several separability conditions using the covariance matrix criterion. Phys. Rev. A 78, 052319 (2008).
Gittsovich, O., Hyllus, P. & Gühne, O. Multiparticle covariance matrices and the impossibility of detecting graph-state entanglement with two-particle correlations. Phys. Rev. A 82, 032306 (2010).
Horodecki, R., Horodecki, P., Horodecki, M. & Horodecki, K. Quantum entanglement. Rev. Mod. Phys. 81, 865 (2009).
Gühne, O. & Tóth, G. Entanglement detection. Phys. Rep. 474, 1–75 (2009).
Bloch, F. Nuclear induction. Phys. Rev. 70, 460 (1946).
Hioe, F. T. & Eberly, J. H. N-Level coherence vector and higher conservation laws in quantum optics and quantum mechanics. Phys. Rev. Lett. 47, 838 (1981).
Fano, U. Pairs of two-level systems. Rev. Mod. Phys. 55, 855–874 (1983).
Badziag, P., Brukner, Č., Laskowski, W., Paterek, T. & Żukowski, M. Experimentally friendly geometrical criteria for entanglement. Phys. Rev. Lett. 100, 140403 (2008).
Laskowski, W., Markiewicz, M., Paterek, T. & Żukowski, M. Correlation-tensor criteria for genuine multiqubit entanglement. Phys. Rev A 84, 062305 (2011).
Vicente, J. I. d. Separability criteria based on the Bloch representation of density matrices. Quantum Inf. Comput. 7, 624–638 (2007).
Vicente, J. I. d. Lower bounds on concurrence and separability conditions. Phys. Rev. A 75, 052320 (2007).
Vicente, J. I. d. Further results on entanglement detection and quantification from the correlation matrix criterion. J. Phys. A: Math. Theor. 41, 065309 (2008).
Hassan, A. S. M. & Joag, P. S. Separability criterion for multipartite quantum states based on the Bloch representation of density matrices. Quantum Inf. Comput. 8, 773–790 (2008).
Vicente, J. I. d. & Huber, M. Multipartite entanglement detection from correlation tensors. Phys. Rev. A 84, 062306 (2011).
Klöckl, C. & Huber, M. Characterizing multipartite entanglement without shared reference frames. Phys. Rev. A 91, 042339 (2015).
Li, M., Wang, J., Fei, S. M. & Li-Jost, X. Quantum separability criteria for arbitrary-dimensional multipartite states. Phys. Rev. A 89, 022325 (2014).
Horodecki, P. Separability criterion and inseparable mixed states with positive partial transposition. Phys. Lett. A 232, 333–339 (1997).
Kolda, T. G. & Bader, B. W. Tensor decompositions and applications. SIAM Rev. 51, 455–500 (2009).
Werner, R. F. Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model. Phys. Rev. A 40, 4277 (1989).
Asadian, A., Erker, P., Huber, M. & Klökl, C. Heisenberg-Weyl basis observables and related applications. http://arxiv.org/abs/1512.05640.
Watrous, J. Theory of quantum information (lecture notes, 2011).
Acknowledgements
This work is supported by the Fundamental Research Funds for the Central Universities (No. 15CX05062A, No. 15CX02075A, No. 16CX02049A), Qingdao Applied Basic Research Program (No. 15-9-1-103-jch), NSFC (No. 11275131) and the Project-sponsored by SRF for ROCS, SEM. We are grateful to the referee for their helpful suggestions to improve the quality of this paper.
Author information
Authors and Affiliations
Contributions
S.-Q.S., M.L. and S.-M.F. wrote the main manuscript text. J.Y. computed the examples. All authors reviewed the manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing financial interests.
Rights and permissions
This work is licensed under a Creative Commons Attribution 4.0 International License. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder to reproduce the material. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/
About this article
Cite this article
Shen, SQ., Yu, J., Li, M. et al. Improved Separability Criteria Based on Bloch Representation of Density Matrices. Sci Rep 6, 28850 (2016). https://doi.org/10.1038/srep28850
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/srep28850
This article is cited by
-
One-particle loss detection of genuine multipartite entanglement
Quantum Information Processing (2023)
-
A family of bipartite separability criteria based on Bloch representation of density matrices
Quantum Information Processing (2023)
-
Criteria of Genuine Multipartite Entanglement Based on Correlation Tensors
International Journal of Theoretical Physics (2022)
-
Detection of Multipartite Entanglement Based on Heisenberg-Weyl Representation of Density Matrices
International Journal of Theoretical Physics (2022)
-
Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems
Mathematical Programming (2022)
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.