Frederik vom Ende, Sumeet Khatri, Sergey Denisov (Sep 01 2025).
Abstract: 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 conditions equivalent to
k-positivity that (a) reduce to a simple check when
k=d, (b) reveal a direct link to the spectral norm of certain order-3 tensors (aligning with known NP-hardness barriers for
k<d), and (c) recast
k-positivity as a novel optimization problem over separable states, thereby connecting it explicitly to separability testing. On the generation side, we introduce a Lie-semigroup-based method that, starting from a single
k-positive map, produces one-parameter families that remain
k-positive and non-decomposable for small enough times. We illustrate this by generating such families for
d=3 and
d=4. We also formulate a semi-definite program (SDP) to test an equivalent form of the positive partial transpose (PPT) square conjecture (and do not find any violation of the latter). Our results provide practical computational tools for certifying
k-positivity and a systematic way to sample
k-positive non-decomposable maps.
