Related papers: On decomposable correlation matrices
The paper contains two main parts: in the first part, we analyze the general case of $p\geq 2$ matrices coupled in a chain subject to Cauchy interaction. Similarly to the Itzykson-Zuber interaction model, the eigenvalues of the Cauchy chain…
The decomposition of a matrix, as a product of factors with particular properties, is a much used tool in numerical analysis. Here we develop methods for decomposing a matrix $C$ into a product $X Y$, where the factors $X$ and $Y$ are…
Standard thresholding techniques for correlation matrices often destroy positive semidefiniteness. We investigate the construction of positive definite functions that vanish on specific sets $K \subseteq [-1,1)$, ensuring that the…
We present a symbolic decomposition of the Pearson chi-square statistic with unequal cell probabilities, by presenting Hadamard-type matrices whose columns are eigenvectors of the variance-covariance matrix of the cell counts. All of the…
We investigate separability and entanglement of mixed states in ${\cal C}^2\otimes{\cal C}^2\otimes{\cal C}^N$ three party quantum systems. We show that all states with positive partial transposes that have rank $\le N$ are separable. For…
We construct entangled states with positive partial transposes using indecomposable positive linear maps between matrix algebras. We also exhibit concrete examples of entangled states with positive partial transposes arising in this way,…
Quantum states that remain separable (i.e., not entangled) under any global unitary transformation are known as absolutely separable and form a convex set. Despite extensive efforts, the complete characterization of this set remains largely…
We present here an overview of our work concerning entanglement properties of composite quantum systems. The characterization of entanglement, i.e. the possibility to assert if a given quantum state is entangled with others and how much…
We characterize the optimal correlative capacity of entangled, separable, and classically correlated states. Introducing the notions of the infimum and supremum within majorization theory, we construct the least disordered separable state…
The entanglement-sharing properties of an infinite spin-chain are studied when the state of the chain is a pure, translation-invariant state with a matrix-product structure. We study the entanglement properties of such states by means of…
If a nonnegative selfadjoint linear relation $A$ in a Hilbert space and a closed subspace $\mathcal{S}$ are assumed to satisfy that the domain of $A$ is invariant under the orthogonal projector onto $\mathcal{S},$ then $A$ admits a…
We derive a product rule satisfied by restricted Schur polynomials. We focus mostly on the case that the restricted Schur polynomial is built using two matrices, although our analysis easily extends to more than two matrices. This product…
Positive maps that are not decomposable are a key resource in entanglement theory because they can detect bound entangled states, yet systematic methods for constructing them remain limited. We introduce an optimization framework based on…
Let $H$ and $K$ be (finite or infinite dimensional) complex Hilbert spaces. A characterization of positive completely bounded normal linear maps from ${\mathcal B}(H)$ into ${\mathcal B}(K)$ is given, which particularly gives a…
We offer a new structural basis for the theory of 3-connected graphs, providing a unique decomposition of every such graph into parts that are either quasi 4-connected, wheels, or thickened $K_{3,m}$'s. Our construction is explicit,…
In this paper we study the set of tensors that admit a special type of decomposition called an orthogonal tensor train decomposition. Finding equations defining varieties of low-rank tensors is generally a hard problem, however, the set of…
Some puzzles which arise in matrix models with multiple cuts are presented. They are present in the smoothed eigenvalue correlators of these models. First a method is described to calculate smoothed eigenvalue correlators in random matrix…
We identify five selected open problems in the theory of quantum information, which are rather simple to formulate, were well-studied in the literature, but are technically not easy. As these problems enjoy diverse mathematical connections,…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
A metric continuum $X$ is indecomposable if it cannot be put as the union of two of its proper subcontinua. A subset $R$ of $X$ is said to be continuumwise connected provided that for each pair of points $p,q\in R$, there exists a…