Related papers: On decomposable correlation matrices
We prove that over a commutative semiring every symmetric strongly invertible matrix with nonnegative numerical range has a Cholesky decomposition.
We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…
One of the most important questions in quantum information theory is the so-called separability problem. It involves characterizing the set of separable (or, equivalently entangled) states among mixed states of a multipartite quantum…
In this paper we establish links between, and new results for, three problems that are not usually considered together. The first is a matrix decomposition problem that arises in areas such as statistical modeling and signal processing:…
Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…
The determination of the cross correlation between an $m$-sequence and its decimated sequence has been a long-standing research problem. Considering a ternary $m$-sequence of period $3^{3r}-1$, we determine the cross correlation…
We consider the problem of computation of the correlation functions for the z-measures with the deformation (Jack) parameters 2 or 1/2. Such measures on partitions are originated from the representation theory of the infinite symmetric…
We study the problem when every matrix over a division ring is representable as either the product of traceless matrices or the product of semi-traceless matrices, and also give some applications of such decompositions. Specifically, we…
This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…
We give a characterization for the extreme points of the convex set of correlation matrices with a countable index set. A Hermitian matrix is called a correlation matrix if it is positive semidefinite with unit diagonal entries. Using the…
Employing a recently proposed separability criterion we develop analytical lower bounds for the concurrence and for the entanglement of formation of bipartite quantum systems. The separability criterion is based on a nondecomposable…
We consider the matrix-valued generalizations of bipartite tensor product quantum correlations and bipartite infinite-dimensional tensor product quantum correlations, respectively. These sets are denoted by $C_q^{(n)}(m,k)$ and…
Both completely positive and completely copositive maps stay decomposable under tensor powers, i.e under tensoring the linear map with itself. But are there other examples of maps with this property? We show that this is not the case: Any…
The idea of decomposing a matrix into a product of structured matrices such as triangular, orthogonal, diagonal matrices is a milestone of numerical computations. In this paper, we describe six new classes of matrix decompositions,…
In polarization optics, an important role play Mueller matrices -- real four-dimensional matrices which describe the effect of action of optical elements on the polarization state of the light, described by 4-dimensional Stokes vectors. An…
A family of separability criteria based on correlation matrix (tensor) is provided. Interestingly, it unifies several criteria known before like e.g. CCNR or realignment criterion, de Vicente criterion and derived recently separability…
The generalized Bloch decomposition of a bipartite quantum state gives rise to a correlation matrix whose singular values provide rich information about non-local properties of the state, such as the dimensionality of entanglement. While…
Diagonalization, or eigenvalue decomposition, is very useful in many areas of applied mathematics, including signal processing and quantum physics. Matrix decomposition is also a useful tool for approximating matrices as the product of a…
A unimodular $2\times 2$ matrix with entries in a commutative $R$ is called extendable (resp.\ simply extendable) if it extends to an invertible $3\times 3$ matrix (resp.\ invertible $3\times 3$ matrix whose $(3,3)$ entry is $0$). We obtain…
Orthogonal matrices which are linear combinations of permutation matrices have attracted enormous attention in quantum information and computation. In this paper, we provide a complete parametric characterization of all complex, real and…