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:2403.07351 · Quantum

An Effective Way to Determine the Separability of Quantum State

Ma-Cheng Yang, Cong‐Feng Qiao

Published May 6, 2025• 2 citations
arXivHTMLPDF

Abstract

We propose in this work a practical approach to address the longstanding and challenging problem of quantum separability, leveraging the correlation matrices of generic observables. General separability conditions are obtained by dint of constructing the measurement-induced Bloch space, which in essence come from the intrinsic constraints in the space of quantum state. The novel approach can not only reproduce various established entanglement criteria, it may as well brings about some new results, possessing obvious advantages for certain bound entangled states and the high dimensional Werner states. Moreover, it is found that criteria obtained in our approach can be directly transformed into entanglement witness operators.

DOI
10.22331/q-2025-05-06-1734

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•111 citations

Covariance Matrices and the Separability Problem

Otfried Gühne, P. Hyllus, Oleg Gittsovich +1 more

We propose a unifying approach to the separability problem using covariance matrices of locally measurable observables. From a practical point of view, our approach leads to strong entanglement criteria that allow us to detect the entanglement of many bound entangled states in higher dimensions and which are at the same time necessary and sufficient for two qubits. From a fundamental perspective, our approach leads to insights into the relations between several known entanglement criteria--such as the computable cross-norm and local uncertainty criteria--as well as their limitations.

arXiv:quant-ph/0611282•Physical Review Letters•Sep 28, 2007•170 citations

Geometric criterion for separability based on local measurement

Aryaman A. Patel, Prasanta Kumar Panigrahi

A geometric understanding of entanglement is proposed based on local measurements. Taking recourse to the general structure of density matrices in the framework of Euclidean geometry, we first illustrate our approach for bipartite Werner states. It is demonstrated that separable states satisfy certain geometric constraints that entangled states do not. A separability criterion for multiparty Werner states of arbitrary dimension is derived. This approach can be used to determine separability across any bipartition of a general density matrix and leads naturally to a computable measure of entanglement for multiparty pure states. It is known that all density matrices within a certain distance of the normalized identity are separable. This distance is determined for a general setting of $n$ qudits, each of dimension $d$.

arXiv:1608.06145•Aug 22, 2016•1 citation

Separability Criteria Combined with Local Filtering Transformation Based on the Bloch Representation

Wenli Wu, Zhaofeng Su

Quantum properties, such as entanglement and coherence, are indispensable resources in various quantum information processing tasks. However, given a quantum state, it is not a simple question to identify whether it is entangled or not. We study the entanglement of quantum systems in arbitrary dimensions using the Bloch representation of density matrix. This approach enables us to consider quantum entanglement geometrically. We first analyze the effect of local Bloch vector on determining whether a quantum state is entangled or separable, and obtain an entanglement criterion related to local Bloch vector, which is stronger than the criterion that only considers the correlation matrix. This criterion is equivalent to the optimized computable cross norm criterion in [14]. Our proof is considered from the perspective of Bloch representation, and there is no need to know the matrix relignment in advance. This criterion also be extended to the problem of the separability of tripartite quantum states. We then combine the local filtering transformation with this entanglement criterion. After applying a suitable local filtering transformation, the quantum state has at most one nonzero Bloch vector, and examples are given to illustrate that the local filtering transformation can help detect some bound states where the original entanglement criterion fails. Moreover, for a finite-dimensional quantum system in which one party is a qubit, we give an analytical form of the combined entanglement criterion.

International Conference on Big Data Computing and Communications (BigCom)•Aug 1, 2021•0 citations

Separability Criteria Based on the Weyl Operators

Xiaofen Huang, Tinggui Zhang, Ming‐Jing Zhao +1 more

Entanglement as a vital resource for information processing can be described by special properties of the quantum state. Using the well-known Weyl basis we propose a new Bloch decomposition of the quantum state and study its separability problem. This decomposition enables us to find an alternative characterization of the separability based on the correlation matrix. We show that the criterion is effective in detecting entanglement for the isotropic states, Bell-diagonal states and some PPT entangled states. We also use the Weyl operators to construct an detecting operator for quantum teleportation.

arXiv:2208.04789•Entropy•Aug 2, 2022•5 citations

Entanglement detection beyond the computable cross-norm or realignment criterion

Chengjie Zhang, Yong-Sheng Zhang, Shun Zhang +1 more

Separability problem, to decide whether a given state is entangled or not, is a fundamental problem in quantum information theory. We propose a powerful and computationally simple separability criterion, which allows us to detect the entanglement of many bound entangled states. The criterion is strictly stronger than the criterion based on Bloch representations, the computable cross-norm or realignment criterion and its optimal nonlinear entanglement witnesses. Furthermore, this criterion can be generalized to an analog of permutation separability criteria in the even-partite systems.

arXiv:0709.3766•Physical Review A•Jun 2, 2008•95 citations
We propose in this work a practical approach to address the longstanding and challenging problem of quantum separability, leveraging the correlation matrices of generic observables. General separability conditions are obtained by dint of constructing the measurement-induced Bloch space, which in essence come from the intrinsic constraints in the space of quantum state. The novel approach can not only reproduce various established entanglement criteria, it may as well brings about some new results, possessing obvious advantages for certain bound entangled states and the high dimensional Werner states. Moreover, it is found that criteria obtained in our approach can be directly transformed into entanglement witness operators.
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.
We propose a unifying approach to the separability problem using covariance matrices of locally measurable observables. From a practical point of view, our approach leads to strong entanglement criteria that allow us to detect the entanglement of many bound entangled states in higher dimensions and which are at the same time necessary and sufficient for two qubits. From a fundamental perspective, our approach leads to insights into the relations between several known entanglement criteria--such as the computable cross-norm and local uncertainty criteria--as well as their limitations.
A geometric understanding of entanglement is proposed based on local measurements. Taking recourse to the general structure of density matrices in the framework of Euclidean geometry, we first illustrate our approach for bipartite Werner states. It is demonstrated that separable states satisfy certain geometric constraints that entangled states do not. A separability criterion for multiparty Werner states of arbitrary dimension is derived. This approach can be used to determine separability across any bipartition of a general density matrix and leads naturally to a computable measure of entanglement for multiparty pure states. It is known that all density matrices within a certain distance of the normalized identity are separable. This distance is determined for a general setting of nnn qudits, each of dimension ddd.
Quantum properties, such as entanglement and coherence, are indispensable resources in various quantum information processing tasks. However, given a quantum state, it is not a simple question to identify whether it is entangled or not. We study the entanglement of quantum systems in arbitrary dimensions using the Bloch representation of density matrix. This approach enables us to consider quantum entanglement geometrically. We first analyze the effect of local Bloch vector on determining whether a quantum state is entangled or separable, and obtain an entanglement criterion related to local Bloch vector, which is stronger than the criterion that only considers the correlation matrix. This criterion is equivalent to the optimized computable cross norm criterion in [14]. Our proof is considered from the perspective of Bloch representation, and there is no need to know the matrix relignment in advance. This criterion also be extended to the problem of the separability of tripartite quantum states. We then combine the local filtering transformation with this entanglement criterion. After applying a suitable local filtering transformation, the quantum state has at most one nonzero Bloch vector, and examples are given to illustrate that the local filtering transformation can help detect some bound states where the original entanglement criterion fails. Moreover, for a finite-dimensional quantum system in which one party is a qubit, we give an analytical form of the combined entanglement criterion.
Entanglement as a vital resource for information processing can be described by special properties of the quantum state. Using the well-known Weyl basis we propose a new Bloch decomposition of the quantum state and study its separability problem. This decomposition enables us to find an alternative characterization of the separability based on the correlation matrix. We show that the criterion is effective in detecting entanglement for the isotropic states, Bell-diagonal states and some PPT entangled states. We also use the Weyl operators to construct an detecting operator for quantum teleportation.
Separability problem, to decide whether a given state is entangled or not, is a fundamental problem in quantum information theory. We propose a powerful and computationally simple separability criterion, which allows us to detect the entanglement of many bound entangled states. The criterion is strictly stronger than the criterion based on Bloch representations, the computable cross-norm or realignment criterion and its optimal nonlinear entanglement witnesses. Furthermore, this criterion can be generalized to an analog of permutation separability criteria in the even-partite systems.