相关论文: On positive decomposable maps

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 present a general scheme that allows for construction of scalar separability criteria from positive but not completely positive maps. The concept is based on a decomposition of every positive map $\Lambda$ into a difference of two…

In this paper, we give a new class of reconstructible graphs, which is an extension of my paper `A class of reconstructible graphs'.

We study $k$-positive linear maps on matrix algebras and address two problems, (i) characterizations of $k$-positivity and (ii) generation of non-decomposable $k$-positive maps. On the characterization side, we derive optimization-based…

This paper has been superseded by quant-ph/0101003.

A matching $M$ in a graph $\Gamma$ is positive if $\Gamma$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of $\Gamma$ is an edge-partition $M_1,\ldots,M_p$…

This work is a continuation of [1]. As in the previous article, here we will describe some interesting ideas and a lot of new theorems in plane geometry related to them.

We construct a new class of positive indecomposable maps in the algebra of `d x d' complex matrices. These maps are characterized by the `weakest' positivity property and for this reason they are called atomic. This class provides a new…

Large networks are useful in a wide range of applications. Sometimes problem instances are composed of billions of entities. Decomposing and analyzing these structures helps us gain new insights about our surroundings. Even if the final…

If $R$ is a rational map, the Main Result is a uniformization Theorem for the space of decompositions of the iterates of $R$. Secondly, we show that Fatou conjecture holds for decomposable rational maps.

Structural decomposition methods, such as generalized hypertree decompositions, have been successfully used for solving constraint satisfaction problems (CSPs). As decompositions can be reused to solve CSPs with the same constraint scopes,…

It is shown that a trace invariant projection map, i.e. a positive unital idempotent map, of a finite dimensional C*-algebra into itself is non-decomposable if and only if it is atomic, or equivalently not the sum of a 2-positive and a…

The paper is taken out.

This paper corresponds to Section 8 of arXiv:1912.05774v3 [math.GT]. The contents until Section 7 are published in Annali di Matematica Pura ed Applicata as a separate paper. In that paper, it is proved that for any positive flow-spine P of…

In this article we provide necessary and sufficient conditions for a completely positive trace-preserving (CPT) map to be decomposable into a convex combination of unitary maps. Additionally, we set out to define a proper distance measure…

Let $D$ be a space of $2\times n$ matrices. Then the face of the cone of all completely positive maps from $M_2$ into $M_n$ given by $D$ is an exposed face of the bigger cone of all decomposable positive linear maps if and only if the set…

The purpose of this short note is to clarify and present a general version of an interesting observation by Piani and Mora (Physic. Rev. A 75, 012305 (2007)), linking complete positivity of linear maps on matrix algebras to decomposability…

Let $\Gamma=(V,E)$ be a finite simple graph. A matching $M \subseteq E$ is positive if there exists a weight function on $V$ such that the matching $M$ is characterized by those edges with positive weights. A positive matching decomposition…

We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.

This is a revised form of the previous paper in which we study cones of positive maps of B(H) into itself. We add the result that the dual cone of a symmetric mapping cone is itself a symmetric mapping cone. As applications we obtain…