arXiv:2508.21348 · Open Systems & Information Dynamics

k-Positive Maps: New Characterizations and a Generation Method

Frederik vom Ende, Sumeet Khatri, Sergey Denisov

Published Dec 1, 2025• 1 citation

Abstract

We study [Formula: see text]-positive linear maps on matrix algebras and address two problems, (i) characterizations of [Formula: see text]-positivity and (ii) generation of nondecomposable [Formula: see text]-positive maps. On the characterization side, we derive optimization-based conditions equivalent to [Formula: see text]-positivity that (a) reduce to a simple check when [Formula: see text], (b) reveal a direct link to the spectral norm of certain order-3 tensors (aligning with known NP-hardness barriers for [Formula: see text]), and (c) recast [Formula: see text]-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 [Formula: see text]-positive map, produces one-parameter families that remain [Formula: see text]-positive and nondecomposable for small enough times. We illustrate this by generating such families for [Formula: see text] and [Formula: see text]. We also formulate a semidefinite 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 [Formula: see text]-positivity and a systematic way to sample [Formula: see text]-positive nondecomposable maps.

DOI: 10.1142/s1230161225500155

Related papers

Generating Non-Decomposable Maps with Differentiable Semidefinite Programming

Angela Rosy Morgillo, Davide Poderini, Fabio Anselmi +3 more

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 differentiable semidefinite programming (SDP) for generating positive non-decomposable maps under flexible structural constraints on their Choi matrices. The method combines SDP-based certificates of non-decomposability and positivity with gradient-based optimization, enabling a systematic search over maps with different input and output dimensions. Within this framework, we generate previously unknown numerical examples, identify a parametrized family of maps arising from masked Choi matrices, and construct real non-decomposable maps. We further show that the same approach can be adapted to explore open questions in quantum information theory, including the PPT square conjecture and recently proposed eigenvalue bounds for 2-positive trace-preserving maps.

quant-pharXiv:2605.14644May 15, 20260 citations

A factorization property of positive maps on C*-algebras

B. V. Rajarama Bhat, Hiroyuki Osaka

The purpose of this short paper is to clarify and present a general version of an interesting observation by [Piani and Mora, Phys. Rev. A 75 (2007) 012305], linking complete positivity of linear maps on matrix algebras to decomposability of their ampliations. Let [Formula: see text], [Formula: see text] be unital C*-algebras and let [Formula: see text] be positive linear maps from [Formula: see text] to [Formula: see text] [Formula: see text]. We obtain conditions under which any positive map [Formula: see text] from the minimal C*-tensor product [Formula: see text] to [Formula: see text], such that [Formula: see text], factorizes as [Formula: see text] for some positive map [Formula: see text]. In particular, we show that when [Formula: see text] are completely positive (CP) maps for some Hilbert spaces [Formula: see text] [Formula: see text], and [Formula: see text] is a pure CP map and [Formula: see text] is a CP map so that [Formula: see text] is also CP, then [Formula: see text] for some CP map [Formula: see text]. We show that a similar result holds in the context of positive linear maps when [Formula: see text] and [Formula: see text]. As an application, we extend IX Theorem of Ref. 4 (revisited recently by [Huber et al., Phys. Rev. Lett. 121 (2018) 200503]) to show that for any linear map [Formula: see text] from a unital C*-algebra [Formula: see text] to a C*-algebra [Formula: see text], if [Formula: see text] is decomposable for some [Formula: see text], where [Formula: see text] is the identity map on the algebra [Formula: see text] of [Formula: see text] matrices, then [Formula: see text] is CP.

International Journal of Quantum InformationAug 1, 20203 citations

Extremal Positive Maps on M3(ℂ) and Idempotent Matrices

Marek Miller, Robert Olkiewicz

A new method of analysing positive bistochastic maps on the algebra of complex matrices [Formula: see text] has been proposed. By identifying the set of such maps with a convex set of linear operators on [Formula: see text], one can employ techniques from the theory of compact semigroups to obtain results concerning asymptotic properties of positive maps. It turns out that the idempotent elements play a crucial role in classifying the convex set into subsets, in which representations of extremal positive maps are to be found. It has been shown that all positive bistochastic maps, extremal in the set of all positive maps of [Formula: see text], that are not Jordan isomorphisms of [Formula: see text] are represented by matrices that fall into two possible categories, determined by the simplest idempotent matrices: one by the zero matrix, and the other by a one-dimensional orthogonal projection. Some norm conditions for matrices representing possible extremal maps have been specified and examples of maps from both categories have been brought up, based on the results published previously.

arXiv:1510.04920Open Systems & Information DynamicsMar 1, 20164 citations

Complete Positivity of Two Class of Maps Involving Depolarizing and Transpose-Depolarizing Channels

Xiu-Hong Sun, Yuan Li

In this note, we mainly study the necessary and sufficient conditions for the complete positivity of generalizations of depolarizing and transpose-depolarizing channels. Specifically, we define [Formula: see text] and [Formula: see text], where [Formula: see text] (the set of all bounded linear operators on the finite-dimensional Hilbert space [Formula: see text] is given and [Formula: see text] is the transpose of [Formula: see text] in a fixed orthonormal basis of [Formula: see text] First, we show that [Formula: see text] is completely positive if and only if [Formula: see text] is a positive map, which is equivalent to [Formula: see text] Moreover, [Formula: see text] is a completely positive map if and only if [Formula: see text] and [Formula: see text] At last, we also get that [Formula: see text] is a completely positive map if and only if [Formula: see text] with [Formula: see text] for all [Formula: see text] where [Formula: see text] are eigenvalues of [Formula: see text].

Open Systems & Information DynamicsJun 1, 20212 citations

Positivity of linear maps under tensor powers

Alexander Müller‐Hermes, David Reeb, Michael M. Wolf

We investigate linear maps between matrix algebras that remain positive under tensor powers, i.e., under tensoring with n copies of themselves. Completely positive and completely co-positive maps are trivial examples of this kind. We show that for every n ∈ ℕ, there exist non-trivial maps with this property and that for two-dimensional Hilbert spaces there is no non-trivial map for which this holds for all n. For higher dimensions, we reduce the existence question of such non-trivial “tensor-stable positive maps” to a one-parameter family of maps and show that an affirmative answer would imply the existence of non-positive partial transpose bound entanglement. As an application, we show that any tensor-stable positive map that is not completely positive yields an upper bound on the quantum channel capacity, which for the transposition map gives the well-known cb-norm bound. We, furthermore, show that the latter is an upper bound even for the local operations and classical communications-assisted quantum capacity, and that moreover it is a strong converse rate for this task.

arXiv:1502.05630Journal of Mathematical PhysicsJul 23, 201551 citations

A Realignment-Based Obstruction to Two-Superpositive Decompositions of PPT Operators: An Explicit Rational Certificate and Tensor-Power Construction

Kias Henry

We present an explicit rational certificate for a positive-partial-transpose (PPT) state on C^15625 tensor C^15625 outside the cone C2 + partial_transpose(C2), where C2 denotes the cone of positive semidefinite operators of Schmidt number at most two. A 5x5 grid-state seed has realignment norm bounded below by 1028/909, proved by a 25x25 integer matrix certificate. Six tensor copies amplify this to (1028/909)^6 > 2, while the realignment norm is at most twice the trace on C2 + partial_transpose(C2). An explicit Choi witness consequently defines a linear map that is simultaneously 2-positive and 2-copositive but nondecomposable. The accompanying archive contains the mathematical preprint, LaTeX source, exact-arithmetic verification programs, and computational checks. This is an unrefereed proof manuscript. Independent expert verification and exhaustive prior-art assessment remain outstanding. The construction does not resolve the PPT-cubed conjecture or establish an improved quantum teleportation protocol.

Oct 28, 20260 citations