Related papers: Decomposing nuclear maps
We study how iterated and composed completely positive maps act on operator-valued kernels. Each kernel is realized inside a single Hilbert space where composition corresponds to applying bounded creation operators to feature vectors. This…
In this paper we prove existence of matings between a large class of renormalizable cubic polynomials with one fixed critical point and another cubic polynomial having two fixed critical points. The resulting mating is a Newton map. Our…
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 study a class of parametrizations of convex cones of positive semidefinite matrices with prescribed zeros. Each such cone corresponds to a graph whose non-edges determine the prescribed zeros. Each parametrization in this class is a…
Both completely positive and completely copositive maps stay decomposable under tensor powers, i.e under tensoring the linear map with itself. But are there other examples of maps with this property? We show that this is not the case: Any…
We show that a bounded, linear map between C*-algebras is a weighted $\ast$-homomorphism (the central compression of a $\ast$-homomorphism) if and only if it preserves zero-products, range-orthogonality, and domain-orthogonality. It follows…
This article proves the existence of completely positive quasimultiplicative maps from the group algebra of imprimitive reflection groups to the set of bounded operators, and uses those linear maps to define creation and annihilation…
Consider a unital C*-algebra A, a von Neumann algebra M, a unital sub-C*-algebra C of A and a unital *-homomorphism $\pi$ from C to M. Let u: A --> M be a decomposable map (i.e. a linear combination of completely positive maps) which is a…
We define extension maps as maps that extend a system (through adding ancillary systems) without changing the state in the original system. We show, using extension maps, why a completely positive operation on an initially entangled system…
The possibilities for new or unusual kinds of topological, locally linear periodic maps of non-prime order on closed, simply connected 4-manifolds with positive definite intersection pairings are explored. On the one hand, certain…
Wigner's theorem characterizes isometries of the set of all rank one projections on a Hilbert space. In metric geometry nonexpansive maps and noncontractive maps are well studied generalizations of isometries. We show that under certain…
In this paper, we propose an inexact proximal Newton-type method for nonconvex composite problems. We establish the global convergence rate of the order $\mathcal{O}(k^{-1/2})$ in terms of the minimal norm of the KKT residual mapping and…
Two notions for linear maps (operational convex combinations and operational exetreme points) are introduced. The set S of ucp maps on the n times n matrix algebra is the operational convex combinations of the identity map. An operational…
052<p type="texpara" tag="Body Text" et="abstract" >A completely $n$ -positive linear map from a locally $C^{\ast}$-algebra $A$ to another locally $C^{\ast}$-algebra $B $is an $n\times n$ matrix whose elements are continuous linear maps…
The order relation on the set of completely n-positive linear maps from a pro-C*-algebra A to L(H), the C*-algebra of bounded linear operators on a Hilbert space H, is characterized in terms of the representation associated with each…
We establish a result which states that regularizing an inverse problem with the gauge of a convex set $C$ yields solutions which are linear combinations of a few extreme points or elements of the extreme rays of $C$. These can be…
The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions.…
The decomposition of undirected graphs simplifies complex problems by breaking them into solvable subgraphs, following the philosophy of divide and conquer. This paper investigates the relationship between atom decomposition and the maximum…
We provide convergent hierarchies for the cone C of copositive matrices and its dual, the cone of completely positive matrices. In both cases the corresponding hierarchy consists of nested spectrahedra and provide outer (resp. inner)…
We show how our recent results on compositions of d.c. functions (and mappings) imply positive results on extensions of d.c. functions (and mappings). Examples answering two natural relevant questions are presented. Two further theorems,…