$k$-Positive Maps: New Characterizations and a Generation Method

• URL: http://arxiv.org/abs/2508.21348v1
• Date: Fri, 29 Aug 2025 06:22:57 GMT
• Title: $k$-Positive Maps: New Characterizations and a Generation Method
• Authors: Frederik vom Ende, Sumeet Khatri, Sergey Denisov,
• Abstract summary: We study $k$-positive linear maps on matrix algebras and address two problems characterizations of $k$-positivity and generation of non-decomposable $k$-positive maps.<n>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.<n>On the generation side, we introduce a Lie-semigroup-based method that, starting from a single $k$
• Score: 0.9685837672183747
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Fractional $k$-positivity: a continuous refinement of the $k$-positive scale [0.0]
  We introduce a real- parameter refinement of the classical integer hierarchies underlying Schmidt number, block-positivity, and $k$-positivity for maps between matrix algebras.<n>We prove a emphfractional Kraus theorem: $$-superpositive maps are precisely the completely positive maps admitting a Kraus decomposition.<n>For non-integer $$ the cones $mathsf P_$ fail stability under CP post-composition, highlighting a sharp structural transition away from the integer theory.
  arXiv  Detail & Related papers  (2026-02-13T08:57:22Z)
• $k$-Positivity and high-dimensional bound entanglement under symplectic group symmetry [6.52489063705362]
  We study the structure of $k$-positivity and Schmidt numbers for classes of linear maps and bipartite quantum states exhibiting symplectic group symmetry.<n>Our results offer a natural and analytically tractable framework in which both strong forms of positive indecomposability and high degrees of PPT entanglement can be studied systematically.
  arXiv  Detail & Related papers  (2026-02-10T15:03:58Z)
• Schwarz maps with symmetry [0.0]
  Theory of symmetry of quantum mechanical systems is applied to study the structure and properties of several classes of relevant maps in quantum information theory.<n>We develop the general structure that equivariant maps $:mathcal A to mathcal B$ between $Cast$-algebras satisfy.<n>We then undertake a systematic study of unital, Hermiticity-preserving maps that are equivariant under natural unitary group actions.
  arXiv  Detail & Related papers  (2026-01-05T17:11:03Z)
• Projection by Convolution: Optimal Sample Complexity for Reinforcement Learning in Continuous-Space MDPs [56.237917407785545]
  We consider the problem of learning an $varepsilon$-optimal policy in a general class of continuous-space Markov decision processes (MDPs) having smooth Bellman operators. Key to our solution is a novel projection technique based on ideas from harmonic analysis. Our result bridges the gap between two popular but conflicting perspectives on continuous-space MDPs.
  arXiv  Detail & Related papers  (2024-05-10T09:58:47Z)
• On a Neural Implementation of Brenier's Polar Factorization [24.48716080522871]
  In 1991, Brenier proved a theorem that generalizes the polar decomposition for square matrices factored as PSD $times$ unitary -- to any vector field $F:mathbbRdright mathbbRdarrow.<n>We propose a practical implementation of the polar factorization theorem, and explore possible uses within machine learning.
  arXiv  Detail & Related papers  (2024-03-05T15:59:54Z)
• Near-optimal fitting of ellipsoids to random points [68.12685213894112]
  A basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis. We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some $n = Omega(, d2/mathrmpolylog(d),)$. Our proof demonstrates feasibility of the least squares construction of Saunderson et al. using a convenient decomposition of a certain non-standard random matrix.
  arXiv  Detail & Related papers  (2022-08-19T18:00:34Z)
• Best Policy Identification in Linear MDPs [70.57916977441262]
  We investigate the problem of best identification in discounted linear Markov+Delta Decision in the fixed confidence setting under a generative model. The lower bound as the solution of an intricate non- optimization program can be used as the starting point to devise such algorithms.
  arXiv  Detail & Related papers  (2022-08-11T04:12:50Z)
• Supervised Training of Conditional Monge Maps [107.78770597815242]
  Optimal transport (OT) theory describes general principles to define and select, among many possible choices, the most efficient way to map a probability measure onto another. We introduce CondOT, a multi-task approach to estimate a family of OT maps conditioned on a context variable. We demonstrate the ability of CondOT to infer the effect of an arbitrary combination of genetic or therapeutic perturbations on single cells.
  arXiv  Detail & Related papers  (2022-06-28T19:34:44Z)
• Projection-free Graph-based Classifier Learning using Gershgorin Disc Perfect Alignment [59.87663954467815]
  In graph-based binary learning, a subset of known labels $hatx_i$ are used to infer unknown labels. When restricting labels $x_i$ to binary values, the problem is NP-hard. We propose a fast projection-free method by solving a sequence of linear programs (LP) instead.
  arXiv  Detail & Related papers  (2021-06-03T07:22:48Z)
• Learning elliptic partial differential equations with randomized linear algebra [2.538209532048867]
  We show that one can construct an approximant to $G$ that converges almost surely. The quantity $0Gamma_epsilonleq 1$ characterizes the quality of the training dataset.
  arXiv  Detail & Related papers  (2021-01-31T16:57:59Z)
• Optimal Robust Linear Regression in Nearly Linear Time [97.11565882347772]
  We study the problem of high-dimensional robust linear regression where a learner is given access to $n$ samples from the generative model $Y = langle X,w* rangle + epsilon$ We propose estimators for this problem under two settings: (i) $X$ is L4-L2 hypercontractive, $mathbbE [XXtop]$ has bounded condition number and $epsilon$ has bounded variance and (ii) $X$ is sub-Gaussian with identity second moment and $epsilon$ is
  arXiv  Detail & Related papers  (2020-07-16T06:44:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.