Related papers: Decomposability of Linear Maps under Tensor Produc…
We analyze a class of piecewise linear parabolic maps on the torus, namely those obtained by considering a linear map with double eigenvalue one and taking modulo one in each component. We show that within this two parameter family of maps,…
A measurable map between measure spaces is shown to have bounded compression if and only if its image via the measure-algebra functor is Lipschitz-continuous w.r.t. the measure-algebra distances. This provides a natural interpretation of…
Diagonalization, or eigenvalue decomposition, is very useful in many areas of applied mathematics, including signal processing and quantum physics. Matrix decomposition is also a useful tool for approximating matrices as the product of a…
We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…
Ergodic systems, being indecomposable are important part of the study of dynamical systems but if a system is not ergodic, it is natural to ask the following question: Is it possible to split it into ergodic systems in such a way that the…
One of the most fundamental questions in quantum information theory is PPT-entanglement of quantum states, which is an NP-hard problem in general. In this paper, however, we prove that all PPT $(\overline{\pi}_A\otimes \pi_B)$-invariant…
We analyze the decomposition of tensor products between infinite dimensional (unitary) and finite-dimensional (non-unitary) representations of SL(2,R). Using classical results on indefinite inner product spaces, we derive explicit…
We investigate the relation between multilinear mappings and multipartite states. We show that the isomorphism between multilinear mapping and tensor product completely characterizes decomposable multipartite states in a mathematically…
We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…
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,…
This chapter studies the problem of decomposing a tensor into a sum of constituent rank one tensors. While tensor decompositions are very useful in designing learning algorithms and data analysis, they are NP-hard in the worst-case. We will…
Tensor decomposition methods are widely used for model compression and fast inference in convolutional neural networks (CNNs). Although many decompositions are conceivable, only CP decomposition and a few others have been applied in…
The new paper will be submitted.
We address two sets of long-standing open questions in probability theory, from a computational complexity perspective: divisibility of stochastic maps, and divisibility and decomposability of probability distributions. We prove that finite…
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…
A symmetric tensor is called copositive if it generates a multivariate form taking nonnegative values over the nonnegative orthant. Copositive tensors have found important applications in polynomial optimization and tensor complementarity…
We study the decomposability and the subdifferential of the tensor nuclear norm. Both concepts are well understood and widely applied in matrices but remain unclear for higher-order tensors. We show that the tensor nuclear norm admits a…
Correlation matrices (positive semidefinite matrices with ones on the diagonal) are of fundamental interest in quantum information theory. In this work we introduce and study the set of $r$-decomposable correlation matrices: those that can…
An element of a group is \emph{reversible} if it is conjugate to its own inverse, and it is \emph{strongly reversible} if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be…
Nuclear C*-algebras enjoy a number of approximation properties, most famously the completely positive approximation property. This was recently sharpened to arrange for the incoming maps to be sums of order-zero maps. We show that, in…