Related papers: On decomposable correlation matrices
We consider nonnegative r-potent matrices with finite dimensions and study their decomposability. We derive the precise conditions under which an r-potent matrix is decomposable. We further determine a general structure for the r-potent…
Parties connected to independent sources through a network can generate correlations among themselves. Notably, the space of feasible correlations for a given network, depends on the physical nature of the sources and the measurements…
Correlation matrices are the sub-class of positive definite real matrices with all entries on the diagonal equal to unity. Earlier work has exhibited a parametrisation of the corresponding Cholesky factorisation in terms of partial…
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 study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
Schur decompositions and the corresponding Schur forms of a single matrix, a pair of matrices, or a collection of matrices associated with the periodic eigenvalue problem are frequently used and studied. These forms are upper-triangular…
The density matrix of a non-relativistic quantum system, divided into $N$ sub-systems, is rewritten in terms of the set of all partitioned density matrices for the system. For the case where the different sub-systems are distinguishable, we…
In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive…
We study families of positive and completely positive maps acting on a bipartite system $\mathbb{C}^M\otimes \mathbb{C}^N$ (with $M\leq N$). The maps have a property that when applied to any state (of a given entanglement class) they result…
We introduce a new decomposition of a graphs into quasi-4-connected components, where we call a graph quasi-4-connected if it is 3-connected and it only has separations of order 3 that remove a single vertex. Moreover, we give a cubic time…
A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…
We introduce a generalization of the set of completely positive matrices that we call "pairwise completely positive" (PCP) matrices. These are pairs of matrices that share a joint decomposition so that one of them is necessarily positive…
Started from local universal isotropic disentanglement, a threshold inequality on reduction factors is proposed, which is necessary and sufficient for this type of disentanglement processes. Furthermore, we give the conditions realizing…
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of ``components.'' Typically, these components are linear combinations of the rows and columns of the matrix, and are thus…
Quantum entanglement is the core resource in quantum information processing and quantum computing. It is an significant challenge to effectively characterize the entanglement of quantum states. Recently, elegant separability criterion is…
We propose necessary and sufficient conditions for an integer matrix to be decomposable in terms of its Hermite normal form. Specifically, to each integer matrix of maximal row rank without columns of zeros, we associate a symmetric whole…
In order to compute the Schmidt decomposition of $A\in M_k\otimes M_m$, we must consider an associated self-adjoint map. Here, we show that if $A$ is positive under partial transposition (PPT) or symmetric with positive coefficients (SPC)…
We derive fundamental constraints for the Schur complement of positive matrices, which provide an operator strengthening to recently established information inequalities for quantum covariance matrices, including strong subadditivity. This…
We present a calculation of the correlator <0|T^{++}(r) T^{++}(0) |0> in N=1 SYM theory in 2+1 dimensions. In the calculation, we use supersymmetric discrete light-cone quantization (SDLCQ), which preserves the supersymmetry at every step…
Let H be a positive semidefinite matrix partitioned into Hermitian blocks. Then, up to a direct sum operation, H is the average of matrices isometrically congruent to its partial trace. A few corollaries are given, related to important…