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

Quantum entanglement and separable matrices

Jiawang Nie

Published Jan 1, 2016• 0 citations
OpenAlex

Abstract

A real symmetric matrix is separable if it can be written as a sum of Kronecker products of positive semidefinite matrices. This talk concerns how to check if a matrix is separable or not. We propose a numerical algorithm, based on Lasserre type semidefinite relaxations, for solving the question. To check the separability of a matrix, we construct a hierarchy of semidefinite relaxations. If it is not separable, we can get a mathematical certificate for that; if it is, we can get a decomposition for the separability. This is a joint work with Xinzhen Zhang.

Related papers

Entanglement and the truncated moment problem

Fabian Bohnet-Waldraff, Daniel Braun, O. Giraud

We map the quantum entanglement problem onto the mathematically well-studied truncated moment problem. This yields a necessary and sufficient condition for separability that can be checked by a hierarchy of semidefinite programs. The algorithm always gives a certificate of entanglement if the state is entangled. If the state is separable, typically a certificate of separability is obtained in a finite number of steps and an explicit decomposition into separable pure states can be extracted.

arXiv:1704.02277•Physical Review A•Sep 11, 2017•24 citations

Separability of symmetric states and vandermonde decomposition

Lilong Qian, Lin Chen, Delin Chu

Abstract Symmetry is one of the central mysteries of quantum mechanics and plays an essential role in multipartite entanglement. In this paper, we consider the separability problem of quantum states in the symmetric space. We establish the relation between the separability of multiqubit symmetric states and the decomposability of Hermitian positive semidefinite matrices. This relation allows us to exchange concepts and ideas between quantum entanglement and Vandermonde decomposition. As an application, we build a suite of tools to investigate the decomposability and show the power of this relation both in theoretical and numerical aspects. For theoretical results, we establish the witness for the decomposability similar to the entanglement witness and characterize the decomposability of some subclasses of matrices. Furthermore, we provide the necessary conditions for the decomposability. Besides, we suggest a numerical algorithm to check whether a given matrix is decomposable. The numerical examples are tested to show the effectiveness.

New Journal of Physics•Feb 10, 2020•4 citations

Separability of Hermitian tensors and PSD decompositions

Mareike Dressler, Jiawang Nie, Zi Yang

Hermitian tensors are natural generalizations of Hermitian matrices, while possessing rather different properties. A Hermitian tensor is separable if it has a Hermitian decomposition with only positive coefficients, i.e. it is a sum of rank-1 psd Hermitian tensors. This paper studies how to detect the separability of Hermitian tensors. It is equivalent to the long-standing quantum separability problem in quantum physics, which asks to tell if a given quantum state is entangled or not. We formulate this as a truncated moment problem and then provide a semidefinite relaxation algorithm to solve it. Moreover, we study psd decompositions of separable Hermitian tensors. When the psd rank is low, we first flatten them into cubic order tensors and then apply tensor decomposition methods to compute psd decompositions. We prove that this method works well if the psd rank is low. In computation, this flattening approach can detect the separability for much larger-sized Hermitian tensors. This method is a good starting point to determine psd ranks of separable Hermitian tensors.

arXiv:2011.08132•Linear and Multilinear Algebra•Aug 27, 2021•11 citations

Separability discrimination and decomposition of m -partite quantum mixed states

Ying Li, Guyan Ni

We propose an $E$-truncated $K$-moment and semidefinite relaxations (ETKM-SDR) method to check whether an $m$-partite quantum mixed state is separable and give a decomposition for it if it is. We first convert the separability discrimination problem of mixed states to the positive Hermitian decomposition problem of Hermitian tensors. Then, employing the $E$-truncated $K$-moment method, we obtain an optimization model for discriminating separability. Moreover, by applying the semidefinite relaxation method, we get a hierarchy of semidefinite relaxation optimization models and propose an algorithm for detecting the separability of mixed states. The algorithm can also be used for symmetric and nonsymmetric decomposition of separable mixed states. By numerical examples, we find that not all symmetric separable states have symmetric decompositions.

arXiv:1912.08985•Physical Review A•Jul 6, 2020•15 citations

A matrix realignment method for recognizing entanglement

K. Chen, Ling-An Wu

Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any separable state, the sum of the singular values of the matrix should be less than or equal to $1$. This condition provides a very simple, computable necessary criterion for separability, and shows powerful ability to identify most bound entangled states discussed in the literature. As a byproduct of the criterion, we give an estimate for the degree of entanglement of the quantum state.

arXiv:quant-ph/0205017•Quantum Information and Computation•May 1, 2003•484 citations

Entanglement witnesses and semidefinite programming

Pablo A. Parrilo, Andrew C. Doherty, Federico M. Spedalieri

We study the application of sums of squares decompositions and semidefinite programming in the formulation of computational criteria for distinguishing entangled from separable quantum states. A hierarchy of tests is obtained, the simplest of which corresponds to the well-known positive partial transpose (PPT) sufficient criterion, with the more complicated tests being strictly stronger. The duality structure of the problem allows us to provide an explicit construction of the entanglement witnesses corresponding to our tests.

IEEE Conference on Decision and Control (CDC)•Jan 23, 2004•2 citations
A real symmetric matrix is separable if it can be written as a sum of Kronecker products of positive semidefinite matrices. This talk concerns how to check if a matrix is separable or not. We propose a numerical algorithm, based on Lasserre type semidefinite relaxations, for solving the question. To check the separability of a matrix, we construct a hierarchy of semidefinite relaxations. If it is not separable, we can get a mathematical certificate for that; if it is, we can get a decomposition for the separability. This is a joint work with Xinzhen Zhang.
Abstract Symmetry is one of the central mysteries of quantum mechanics and plays an essential role in multipartite entanglement. In this paper, we consider the separability problem of quantum states in the symmetric space. We establish the relation between the separability of multiqubit symmetric states and the decomposability of Hermitian positive semidefinite matrices. This relation allows us to exchange concepts and ideas between quantum entanglement and Vandermonde decomposition. As an application, we build a suite of tools to investigate the decomposability and show the power of this relation both in theoretical and numerical aspects. For theoretical results, we establish the witness for the decomposability similar to the entanglement witness and characterize the decomposability of some subclasses of matrices. Furthermore, we provide the necessary conditions for the decomposability. Besides, we suggest a numerical algorithm to check whether a given matrix is decomposable. The numerical examples are tested to show the effectiveness.
Hermitian tensors are natural generalizations of Hermitian matrices, while possessing rather different properties. A Hermitian tensor is separable if it has a Hermitian decomposition with only positive coefficients, i.e. it is a sum of rank-1 psd Hermitian tensors. This paper studies how to detect the separability of Hermitian tensors. It is equivalent to the long-standing quantum separability problem in quantum physics, which asks to tell if a given quantum state is entangled or not. We formulate this as a truncated moment problem and then provide a semidefinite relaxation algorithm to solve it. Moreover, we study psd decompositions of separable Hermitian tensors. When the psd rank is low, we first flatten them into cubic order tensors and then apply tensor decomposition methods to compute psd decompositions. We prove that this method works well if the psd rank is low. In computation, this flattening approach can detect the separability for much larger-sized Hermitian tensors. This method is a good starting point to determine psd ranks of separable Hermitian tensors.
We propose an EEE-truncated KKK-moment and semidefinite relaxations (ETKM-SDR) method to check whether an mmm-partite quantum mixed state is separable and give a decomposition for it if it is. We first convert the separability discrimination problem of mixed states to the positive Hermitian decomposition problem of Hermitian tensors. Then, employing the EEE-truncated KKK-moment method, we obtain an optimization model for discriminating separability. Moreover, by applying the semidefinite relaxation method, we get a hierarchy of semidefinite relaxation optimization models and propose an algorithm for detecting the separability of mixed states. The algorithm can also be used for symmetric and nonsymmetric decomposition of separable mixed states. By numerical examples, we find that not all symmetric separable states have symmetric decompositions.
Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any separable state, the sum of the singular values of the matrix should be less than or equal to 111. This condition provides a very simple, computable necessary criterion for separability, and shows powerful ability to identify most bound entangled states discussed in the literature. As a byproduct of the criterion, we give an estimate for the degree of entanglement of the quantum state.
We study the application of sums of squares decompositions and semidefinite programming in the formulation of computational criteria for distinguishing entangled from separable quantum states. A hierarchy of tests is obtained, the simplest of which corresponds to the well-known positive partial transpose (PPT) sufficient criterion, with the more complicated tests being strictly stronger. The duality structure of the problem allows us to provide an explicit construction of the entanglement witnesses corresponding to our tests.