Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0704.3942 · Quantum Information and Computation

Separability criterion for multipartite quantum states based on the Bloch representation of density matrices

Ali Saif M. Hassan, Pramod S. Joag

Published Sep 1, 2008• 39 citations
arXivHTMLPDF

Abstract

We give a new separability criterion, a necessary condition for separability of N-partite quantum states. The criterion is based on the Bloch representation of a N-partite quantum state and makes use of multilinear algebra, in particular, the matrization of tensors. Our criterion applies to arbitrary N-partite quantum states in $\mathcal{H}=\mathcal{H}^{d_1}\otimes \mathcal{H}^{d_2} \otimes \cdots \otimes \mathcal{H}^{d_N}.$ The criterion can test whether a N-partite state is entangled and can be applied to different partitions of the $N$-partite system. We provide examples that show the ability of this criterion to detect entanglement. We show that this criterion can detect bound entangled states. We prove a sufficiency condition for separability of a 3-partite state, straightforwardly generalizable to the case N > 3, under certain condition. We also give a necessary and sufficient condition for separability of a class of N-qubit states which includes N-qubit PPT states.

DOI
10.26421/qic8.8-9-7

Related papers

Separability criteria based on the Bloch representation of density matrices

Juan de Vicente

We study the separability of bipartite quantum systems in arbitrary dimensions using the Bloch representation of their density matrix. This approach enables us to find an alternative characterization of the separability problem, from which we derive a necessary condition and sufficient conditions for separability. For a certain class of states the necessary condition and a sufficient condition turn out to be equivalent, therefore yielding a necessary and sufficient condition. The proofs of the sufficient conditions are constructive, thus providing decompositions in pure product states for the states that satisfy them. We provide examples that show the ability of these conditions to detect entanglement. In particular, the necessary condition is proved to be strong enough to detect bound entangled states.

arXiv:quant-ph/0607195•Quantum Information and Computation•Sep 1, 2007•99 citations

Separability and classification of multipartite quantum states

Pan-Wen Ma, Hui Zhao, Naihuan Jing

Abstract We study separability in arbitrary multipartite quantum systems based on principal base matrices. Necessary conditions are presented for different kinds of separable states. These conditions can give a complete classification of multipartite quantum states. While the usual Bloch representation of a density matrix uses three types of generators, the representation with principal base matrices has one uniform type of generator which simplifies computation. In this paper, we take advantage of this simplicity to derive useful and operational criteria to detect multipartite separability. We first obtain criteria on detecting 1 − 3 separable, 2 − 2 separable, 1 − 1 − 2 separable and fully separable four-partite quantum states. We then study k-separability for multipartite quantum states in arbitrary dimensions. Detailed examples are given to show that our criteria are able to detect more entanglement states than some existing criteria.

Laser Physics Letters•Nov 8, 2023•1 citation

On sufficient and necessary criteria of multipartite quantum entanglement

Zhi-Bo Chen, Shao-Ming Fei

Abstract Based on the generalized Bloch representation, we study the separability and entanglement of arbitrary dimensional multipartite quantum states. Some sufficient and some necessary criteria are presented. For certain states, these criteria together are both sufficient and necessary. Detailed examples show that our criteria are better than some existing ones in identifying separability. Based on these criteria, the largest separable ball around the maximally mixed state for arbitrary multi-qubit systems is found, and it is proved that its radius defined via the l 1-norm of the Bloch vector is the constant 1. Furthermore, the criteria in this paper can be implemented experimentally.

arXiv:2503.10123•Physica Scripta•Aug 8, 2025•0 citations

Separability criteria based on Heisenberg–Weyl representation of density matrices

Jingmei Chang, Meiyu Cui, Tinggui Zhang +1 more

Separability is an important problem in theory of quantum entanglement. By using the Bloch representation of quantum states in terms of the Heisenberg–Weyl observable basis, we present a new separability criterion for bipartite quantum systems. It is shown that this criterion can be better than the previous ones in detecting entanglement. The results are generalized to multipartite quantum states.

arXiv:2002.00164•Chinese Physics B•Mar 1, 2018•9 citations

Separability criteria based on Heisenberg-Weyl representation of density matrices

Chang, J., Cui, M., Zhang, T. +1 more

Separability is an important problem in theory of quantum entanglement. By using the Bloch representation of quantum states in terms of the Heisenberg–Weyl observable basis, we present a new separability criterion for bipartite quantum systems. It is shown that this criterion can be better than the previous ones in detecting entanglement. The results are generalized to multipartite quantum states.

•Jan 1, 2018•7 citations

Separability of Density Matrices of Graphs for Multipartite Systems

Chen Xie, Hui Zhao, Zhi‐Xi Wang

We investigate separability of Laplacian matrices of graphs when seen as density matrices. This is a family of quantum states with many combinatorial properties. We firstly show that the well-known matrix realignment criterion can be used to test separability of this type of quantum states. The criterion can be interpreted as novel graph-theoretic idea. Then, we prove that the density matrix of the tensor product of N graphs is N-separable. However, the converse is not necessarily true. Additionally, we derive a sufficient condition for N-partite entanglement in star graphs and propose a necessary and sufficient condition for separability of nearest point graphs.

The Electronic Journal of Combinatorics•Nov 22, 2013•5 citations
We give a new separability criterion, a necessary condition for separability of N-partite quantum states. The criterion is based on the Bloch representation of a N-partite quantum state and makes use of multilinear algebra, in particular, the matrization of tensors. Our criterion applies to arbitrary N-partite quantum states in H=Hd1⊗Hd2⊗⋯⊗HdN.\mathcal{H}=\mathcal{H}^{d_1}\otimes \mathcal{H}^{d_2} \otimes \cdots \otimes \mathcal{H}^{d_N}.H=Hd1​⊗Hd2​⊗⋯⊗HdN​. The criterion can test whether a N-partite state is entangled and can be applied to different partitions of the NNN-partite system. We provide examples that show the ability of this criterion to detect entanglement. We show that this criterion can detect bound entangled states. We prove a sufficiency condition for separability of a 3-partite state, straightforwardly generalizable to the case N > 3, under certain condition. We also give a necessary and sufficient condition for separability of a class of N-qubit states which includes N-qubit PPT states.
We study the separability of bipartite quantum systems in arbitrary dimensions using the Bloch representation of their density matrix. This approach enables us to find an alternative characterization of the separability problem, from which we derive a necessary condition and sufficient conditions for separability. For a certain class of states the necessary condition and a sufficient condition turn out to be equivalent, therefore yielding a necessary and sufficient condition. The proofs of the sufficient conditions are constructive, thus providing decompositions in pure product states for the states that satisfy them. We provide examples that show the ability of these conditions to detect entanglement. In particular, the necessary condition is proved to be strong enough to detect bound entangled states.
Abstract We study separability in arbitrary multipartite quantum systems based on principal base matrices. Necessary conditions are presented for different kinds of separable states. These conditions can give a complete classification of multipartite quantum states. While the usual Bloch representation of a density matrix uses three types of generators, the representation with principal base matrices has one uniform type of generator which simplifies computation. In this paper, we take advantage of this simplicity to derive useful and operational criteria to detect multipartite separability. We first obtain criteria on detecting 1 − 3 separable, 2 − 2 separable, 1 − 1 − 2 separable and fully separable four-partite quantum states. We then study k-separability for multipartite quantum states in arbitrary dimensions. Detailed examples are given to show that our criteria are able to detect more entanglement states than some existing criteria.
Abstract Based on the generalized Bloch representation, we study the separability and entanglement of arbitrary dimensional multipartite quantum states. Some sufficient and some necessary criteria are presented. For certain states, these criteria together are both sufficient and necessary. Detailed examples show that our criteria are better than some existing ones in identifying separability. Based on these criteria, the largest separable ball around the maximally mixed state for arbitrary multi-qubit systems is found, and it is proved that its radius defined via the l 1-norm of the Bloch vector is the constant 1. Furthermore, the criteria in this paper can be implemented experimentally.
We investigate separability of Laplacian matrices of graphs when seen as density matrices. This is a family of quantum states with many combinatorial properties. We firstly show that the well-known matrix realignment criterion can be used to test separability of this type of quantum states. The criterion can be interpreted as novel graph-theoretic idea. Then, we prove that the density matrix of the tensor product of N graphs is N-separable. However, the converse is not necessarily true. Additionally, we derive a sufficient condition for N-partite entanglement in star graphs and propose a necessary and sufficient condition for separability of nearest point graphs.