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.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.

Linear and Multilinear AlgebraAug 27, 202110 citations

Separability for weakly irreducible matrices

Daniel Cariello

This paper is devoted to the study of the separability problem in the field of Quantum information theory. We focus on the bipartite finite dimensional case and on two types of matrices: SPC and PPT matrices (see definitions 32 and 33). We prove that many results hold for both types. If these matrices have specific Hermitian Schmidt decompositions then they are separable in a very strong sense (see theorem 38 and corollary 39). We prove that both types have what we call \textbf{split decompositions} (see theorems 41 and 42). We also define the notion of weakly irreducible matrix (see definition 43), based on the concept of irreducible state defined recently in \cite{chen1}, \cite{chen} and \cite{chen2}.}{These split decomposition theorems imply that every SPC $($ PPT $)$ matrix can be decomposed into a sum of $s+1$ SPC $($ PPT $)$ matrices of which the first $s$ are weakly irreducible, by theorem 48, and the last one has a further split decomposition of lower tensor rank, by corollary 49. Thus the SPC $($ PPT $)$ matrix is decomposed in a finite number of steps into a sum of weakly irreducible matrices. Different components of this sum have support on orthogonal local Hilbert spaces, therefore the matrix is separable if and only if each component is separable. This reduces the separability problem for SPC $($ PPT $)$ matrices to the case of weakly irreducible SPC $($ PPT $)$ matrices. We also provide a complete description of weakly irreducible matrices of both types (see theorem 46).}{Using the fact that every positive semidefinite Hermitian matrix with tensor rank 2 is separable (see theorem 58), we found sharp inequalites providing separability for both types (see theorems 61 and 62).This paper is devoted to the study of the separability problem in the field of Quantum information theory. We focus on the bipartite finite dimensional case and on two types of matrices: SPC and PPT matrices (see definitions 32 and 33). We prove that many results hold for both types. If these matrices have specific Hermitian Schmidt decompositions then they are separable in a very strong sense (see theorem 38 and corollary 39). We prove that both types have what we call \textbf{split decompositions} (see theorems 41 and 42). We also define the notion of weakly irreducible matrix (see definition 43), based on the concept of irreducible state defined recently in \cite{chen1}, \cite{chen} and \cite{chen2}.}{These split decomposition theorems imply that every SPC $($PPT$)$ matrix can be decomposed into a sum of $s+1$ SPC $($PPT$)$ matrices of which the first $s$ are weakly irreducible, by theorem 48, and the last one has a further split decomposition of lower tensor rank, by corollary 49. Thus the SPC $($PPT$)$ matrix is decomposed in a finite number of steps into a sum of weakly irreducible matrices. Different components of this sum have support on orthogonal local Hilbert spaces, therefore the matrix is separable if and only if each component is separable. This reduces the separability problem for SPC $($PPT$)$ matrices to the case of weakly irreducible SPC $($PPT$)$ matrices. We also provide a complete description of weakly irreducible matrices of both types (see theorem 46).}{Using the fact that every positive semidefinite Hermitian matrix with tensor rank 2 is separable (see theorem 58), we found sharp inequalites providing separability for both types (see theorems 61 and 62).

Quantum Information and ComputationNov 1, 201411 citations

Rank-bmRpositive Hermitian approximation algorithms and positive Hermitian decompositions of Hermitian tensors

Bo Yang, Ying Li, Guyan Ni +1 more

The Hermitian tensor is regarded as an extension of the Hermitian matrix and can be used to represent a quantum mixed state. In quantum information, the problem of separability discrimination and decomposition of a quantum mixed state is still important and hard. In this paper, we deduce the gradient of the approximation function, and propose three algorithms: A negative gradient algorithm and a BFGS algorithm for rank- $R$ positive Hermitian approximation of Hermitian tensors, and a separability discrimination and decomposition algorithm for Hermitian tensors. According to the Taylor formula and the convexity analysis, we prove the effectiveness of the algorithm. Numerical examples also verify the correctness of the theoretical analysis and the effectiveness of algorithms. They show that the BFGS algorithm can be used for the separability discrimination and the positive Hermitian decomposition, as well as to obtain a rank-positive Hermitian decomposition. Compared with the semidefinite relaxation algorithm, the BFGS algorithm has the advantages of less running time and solving the decomposition of higher-order or higher-dimensional Hermitian tensors.The Hermitian tensor is regarded as an extension of the Hermitian matrix and can be used to represent a quantum mixed state. In quantum information, the problem of separability discrimination and decomposition of a quantum mixed state is still important and hard. In this paper, we deduce the gradient of the approximation function, and propose three algorithms: A negative gradient algorithm and a BFGS algorithm for rank-$R$ positive Hermitian approximation of Hermitian tensors, and a separability discrimination and decomposition algorithm for Hermitian tensors. According to the Taylor formula and the convexity analysis, we prove the effectiveness of the algorithm. Numerical examples also verify the correctness of the theoretical analysis and the effectiveness of algorithms. They show that the BFGS algorithm can be used for the separability discrimination and the positive Hermitian decomposition, as well as to obtain a rank-positive Hermitian decomposition. Compared with the semidefinite relaxation algorithm, the BFGS algorithm has the advantages of less running time and solving the decomposition of higher-order or higher-dimensional Hermitian tensors.

Scientia Sinica MathematicaMay 30, 20231 citation

Hermitian Tensors

Guyan Ni

An order $2m$ complex tensor $\cH$ is said to be Hermitian if \[\mathcal{H}_\ijm=\mathcal{H}_\jim ^*\mathrm{ for all }\ijm .\] It can be regarded as an extension of Hermitian matrix to higher order. A Hermitian tensor is also seen as a representation of a quantum mixed state. Motivated by the separability discrimination of quantum states, we investigate properties of Hermitian tensors including: unitary similarity relation, partial traces, nonnegative Hermitian tensors, Hermitian eigenvalues, rank-one Hermitian decomposition and positive Hermitian decomposition, and their applications to quantum states.An order $2m$ complex tensor $\cH$ is said to be Hermitian if \[\mathcal{H}_\ijm=\mathcal{H}_\jim ^*\mathrm{ for all }\ijm .\] It can be regarded as an extension of Hermitian matrix to higher order. A Hermitian tensor is also seen as a representation of a quantum mixed state. Motivated by the separability discrimination of quantum states, we investigate properties of Hermitian tensors including: unitary similarity relation, partial traces, nonnegative Hermitian tensors, Hermitian eigenvalues, rank-one Hermitian decomposition and positive Hermitian decomposition, and their applications to quantum states.

Feb 5, 20190 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.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.08985Physical Review AJul 6, 202015 citations

Separability for Weak Irreducible matrices

Daniel Cariello

This paper is devoted to the study of the separability problem in the field of Quantum information theory. We deal mainly with the bipartite finite dimensional case and with two types of matrices, one of them being the PPT matrices. We proved that many results holds for both types. If these matrices have specific Hermitian Schmidt decompositions then the matrices are separable in a very strong sense. We proved that both types have what we call split decompositions. We defined the notion of weak irreducible matrix, based on the concept of irreducible state defined recently. These split decomposition theorems together with the notion of weak irreducible matrix, imply that these matrices are weak irreducible or a sum of weak irreducible matrices of the same type. The separability problem for these types of matrices can be reduced to the set of weak irreducible matrices of the same type. We also provided a complete description of weak irreducible matrices of both types. Using the fact that every positive semidefinite Hermitian matrix with tensor rank 2 is separable, we found sharp inequalites providing separability for both types.This paper is devoted to the study of the separability problem in the field of Quantum information theory. We deal mainly with the bipartite finite dimensional case and with two types of matrices, one of them being the PPT matrices. We proved that many results holds for both types. If these matrices have specific Hermitian Schmidt decompositions then the matrices are separable in a very strong sense. We proved that both types have what we call split decompositions. We defined the notion of weak irreducible matrix, based on the concept of irreducible state defined recently. These split decomposition theorems together with the notion of weak irreducible matrix, imply that these matrices are weak irreducible or a sum of weak irreducible matrices of the same type. The separability problem for these types of matrices can be reduced to the set of weak irreducible matrices of the same type. We also provided a complete description of weak irreducible matrices of both types. Using the fact that every positive semidefinite Hermitian matrix with tensor rank 2 is separable, we found sharp inequalites providing separability for both types.

arXiv:1311.7275Nov 28, 20130 citations

(

PPT

)

matrix can be decomposed into a sum of

s+1

SPC

(

PPT

)

matrices of which the first

s

are weakly irreducible, by theorem 48, and the last one has a further split decomposition of lower tensor rank, by corollary 49. Thus the SPC

(

PPT

)

matrix is decomposed in a finite number of steps into a sum of weakly irreducible matrices. Different components of this sum have support on orthogonal local Hilbert spaces, therefore the matrix is separable if and only if each component is separable. This reduces the separability problem for SPC

(

PPT

)

matrices to the case of weakly irreducible SPC

(

PPT

)

matrices. We also provide a complete description of weakly irreducible matrices of both types (see theorem 46).}{Using the fact that every positive semidefinite Hermitian matrix with tensor rank 2 is separable (see theorem 58), we found sharp inequalites providing separability for both types (see theorems 61 and 62).

R

positive Hermitian approximation of Hermitian tensors, and a separability discrimination and decomposition algorithm for Hermitian tensors. According to the Taylor formula and the convexity analysis, we prove the effectiveness of the algorithm. Numerical examples also verify the correctness of the theoretical analysis and the effectiveness of algorithms. They show that the BFGS algorithm can be used for the separability discrimination and the positive Hermitian decomposition, as well as to obtain a rank-positive Hermitian decomposition. Compared with the semidefinite relaxation algorithm, the BFGS algorithm has the advantages of less running time and solving the decomposition of higher-order or higher-dimensional Hermitian tensors.

An order

2m

complex tensor $\cH$ is said to be Hermitian if \[\mathcal{H}_\ijm=\mathcal{H}_\jim ^*\mathrm{ for all }\ijm .\] It can be regarded as an extension of Hermitian matrix to higher order. A Hermitian tensor is also seen as a representation of a quantum mixed state. Motivated by the separability discrimination of quantum states, we investigate properties of Hermitian tensors including: unitary similarity relation, partial traces, nonnegative Hermitian tensors, Hermitian eigenvalues, rank-one Hermitian decomposition and positive Hermitian decomposition, and their applications to quantum states.

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.