Related papers: A decomposition theorem for positive maps, and the…

In this semi-expository paper, we first explain key notions from current quantum information theory and criteria for them in a coherent way. These include separability/entanglement, Schmidt numbers of bi-partite states and block-positivity,…

This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…

We consider the convex set of ( unital ) positive ( completely ) maps from a $C^*$ algebra $\cla$ to a von-Neumann sub-algebra $\clm$ of $\clb(\clh)$, the algebra of bounded linear operators on a Hilbert space $\clh$ and study its extreme…

The classical Choquet theorem establishes a barycentric decomposition for elements in a compact convex subset of a locally convex topological vector space. This decomposition is achieved through a probability measure that is supported on…

Let M be a II_1 factor, A a masa in M and E the unique conditional expectation on A. Under some technical assumptions on the inclusion of A in M, which hold true for any semiregular masa of a separable factor, we show that for every…

Simon's factorization theorem is a celebrated tool in algebraic automata theory, providing bounded-depth decompositions of words with respect to morphisms into finite semigroups. We develop an analogue of Simon's theorem for \emph{forests}…

Theory of matrix factorizations is useful to study hypersurfaces in commutative algebra. To study noncommutative hypersurfaces, which are important objects of study in noncommutative algebraic geometry, we introduce a notion of…

Let $(R,{\frak{m}}_R)$ be a commutative noetherian local ring. Assuming that ${\frak{m}}_R=$$I\oplus J$ is a direct sum decomposition, where $I$ and $J$ are non-zero ideals of $R$, we describe the structure of the Tor algebra of $R$ in…

We initiate a study of linear maps on $M_n(\mathbb{C})$ that have the property that they factor through a tracial von Neumann algebra $(\mathcal{A,\tau})$ via operators $Z\in M_n(\mathcal{A})$ whose entries consist of positive elements from…

For a graph consider the pairs of disjoint matchings which union contains as many edges as possible, and define a parameter $\alpha$ which eqauls the cardinality of the largest matching in those pairs. Also, define $\betta$ to be the…

We provide a generalization of the reduction and Robertson positive maps in matrix algebras. They give rise to a new class of optimal entanglement witnesses. Their structural physical approximation is analyzed. As a byproduct we provide a…

We initiate and study the theory of ``real decomposable maps" between real operator systems. Formally, this is new even in the complex case, which hitherto has restricted itself to the case where the systems are complex C*-algebras. We…

We consider 2-positive almost order zero (disjointness preserving) maps on C*-algebras. Generalizing the argument of M. Choi for multiplicative domains, we give an internal characterization of almost order zero for 2-positive maps. It is…

We say a completely positive contractive map between two C*-algebras has order zero, if it sends orthogonal elements to orthogonal elements. We prove a structure theorem for such maps. As a consequence, order zero maps are in one-to-one…

A proof using the theory of completely positive maps is given to the fact that if $A \in M_2$, or $A \in M_3$ has a reducing eigenvalue, then every bounded linear operator $B$ with $W(B) \subseteq W(A)$ has a dilation of the form $I \otimes…

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…

We prove that the basis of cluster monomials of a skew-symmetric cluster algebra A of finite type is the atomic basis of A. This means that an element of A is positive if and only if it has a non-negative expansion in the basis of cluster…

We extend some results of [BF12] on subfactor projections to show that the projection of a free factor B to the free factor complex of the free factor A is well-defined with uniformly bound diameter, unless either A is contained in B or A…

We present a distributed anytime algorithm for performing MAP inference in graphical models. The problem is formulated as a linear programming relaxation over the edges of a graph. The resulting program has a constraint structure that…

Transfer maps and projection formulas are undoubtedly one of the key tools in the development and computation of (co)homology theories. In this note we develop an unified treatment of transfer maps and projection formulas in the…