Related papers: Separability for Weak Irreducible matrices

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…

We generalize the definition of strong positive partial transpose (SPPT) to the multipartite system. The tripartite case was first considered by X.-Y. Yu and H. Zhao [ Int. J. Theor. Phys.,54, 292, (2015)]. In this extension, unfortunately,…

Local versions of measurability have been around for a long time. Roughly, one splits the notion of $\mu $-completeness into pieces, and asks for a uniform ultrafilter over $\mu $ satisfying just some piece of $\mu $-completeness. Analogue…

We study geometrical aspects of entanglement, with the Hilbert--Schmidt norm defining the metric on the set of density matrices. We focus first on the simplest case of two two-level systems and show that a ``relativistic'' formulation leads…

This is the first of two papers to describe a matrix sparsification algorithm that takes a general real or complex matrix as input and produces a sparse output matrix of the same size. The non-zero entries in the output are chosen to…

Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…

In this paper, we mainly discuss the separability of $n$-partite quantum states from elements of density matrices. Practical separability criteria for different classes of $n$-qubit and $n$-qudit quantum states are obtained. Some of them…

The Schmidt decomposition is an important tool in the study of quantum systems especially for the quantification of the entanglement of pure states. However, the Schmidt decomposition is only unique for bipartite pure states, and some…

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…

In this paper we study several closely related fundamental problems for words and matrices. First, we introduce the Identity Correspondence Problem (ICP): whether a finite set of pairs of words (over a group alphabet) can generate an…

Let M be a matrix whose entries are power series in several variables and determinant det(M) does not vanish identically. The equation det(M)=0 defines a hypersurface singularity and the (co)-kernel of M is a maximally Cohen-Macaulay module…

In this paper, we study the nonnegative matrix factorization problem under the separability assumption (that is, there exists a cone spanned by a small subset of the columns of the input nonnegative data matrix containing all columns),…

We provide a constructive algorithm to find the best separable approximation to an arbitrary density matrix of a composite quantum system of finite dimensions. The method leads to a condition of separability and to a measure of…

The separability problem is formulated in terms of a characterization of a single entanglement witness. More specifically, we show that any (in general multipartite) state \varrho is separable if and only if a specially constructed…

We investigate compressibility of the dimension of positive semidefinite matrices while approximately preserving their pairwise inner products. This can either be regarded as compression of positive semidefinite factorizations of…

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…

We consider the problem of writing an arbitrary symmetric matrix as the difference of two positive semidefinite matrices. We start with simple ideas such as eigenvalue decomposition. Then, we develop a simple adaptation of the Cholesky that…

Given a connected undirected weighted graph, we are concerned with problems related to partitioning the graph. First of all we look for the closest disconnected graph (the minimum cut problem), here with respect to the Euclidean norm. We…

In this thesis the variational optimisation of the density matrix is discussed as a method in many-body quantum mechanics. This is a relatively unknown technique in which one tries to obtain the two-particle reduced density matrix directly…

After introducing the partially separable concept, we proved the equivalence between the partial separability of a given $m$-partite subsystem with $m$ qubits and the purity of states of this $m$-partite subsystem for a pure state in…