Related papers: Separability of Hermitian Tensors and PSD Decompos…
Hermitian tensors are generalizations of Hermitian matrices, but they have very different properties. Every complex Hermitian tensor is a sum of complex Hermitian rank-1 tensors. However, this is not true for the real case. We study basic…
The separability detecting problem of mixed states is one of the fundamental problems in quantum information theory. In the last 20 years, almost all methods are based on the sufficient or necessary conditions for entanglement. However, in…
One of the most challenging problems in quantum physics is to quantify the entanglement of $d$-partite states and their separability. We show here that these problems are best addressed using tensors. The geometric measure of entanglement…
We give a direct tensor decomposition for any density matrix into Hermitian operators. Based upon the decomposition we study when the mixed states are separable and generalize the separability indicators to multi-partite states and show…
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…
Conjugate partial-symmetric (CPS) tensor is a generalization of Hermitian matrices. For the CPS tensor decomposition some properties are presented. For real CPS tensors in particular, we note the subtle difference from the complex case of…
The approximation of matrices to the sum of tensor products of Hermitian matrices is studied. A minimum decomposition of matrices on tensor space $H_1\otimes H_2$ in terms of the sum of tensor products of Hermitian matrices on $H_1$ and…
We consider the problem of separability: decide whether a Hermitian operator on a finite dimensional Hilbert tensor product is separable or entangled. We show that the tensor convolution defined for certain mappings on an almost arbitrary…
Conjugate partial-symmetric (CPS) tensors are the high-order generalization of Hermitian matrices. As the role played by Hermitian matrices in matrix theory and quadratic optimization, CPS tensors have shown growing interest recently in…
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…
We define lower triangular tensors, and show that all diagonal entries of such a tensor are eigenvalues of that tensor. We then define lower triangular sub-symmetric tensors, and show that the number of independent entries of a lower…
A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. We consider the completely positive tensor decomposition problem. A semidefinite algorithm is presented for checking whether a…
Let T be a general complex tensor of format $(n_1,...,n_d)$. When the fraction $\prod_in_i/[1+\sum_i(n_i-1)]$ is an integer, and a natural inequality (called balancedness) is satisfied, it is expected that T has finitely many minimal…
A real symmetric matrix (resp., tensor) is said to be copositive if the associated quadratic (resp., homogeneous) form is greater than or equal to zero over the nonnegative orthant. The problem of detecting their copositivity is NP-hard.…
One of the main issues in computing a tensor decomposition is how to choose the number of rank-one components, since there is no finite algorithms for determining the rank of a tensor. A commonly used approach for this purpose is to find a…
We study concircular tensors in spaces of constant curvature and then apply the results obtained to the problem of the orthogonal separation of the Hamilton-Jacobi equation on these spaces. Any coordinates which separate the geodesic…
This chapter studies the problem of decomposing a tensor into a sum of constituent rank one tensors. While tensor decompositions are very useful in designing learning algorithms and data analysis, they are NP-hard in the worst-case. We will…
We provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…
By combining a parameterized Hermitian matrix, the realignment matrix of the bipartite density matrix $\rho$ and the vectorization of its reduced density matrices, we present a family of separability criteria, which are stronger than the…
This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…