Positive maps and extendibility hierarchies from copositive matrices

• URL: http://arxiv.org/abs/2509.15201v3
• Date: Thu, 06 Nov 2025 16:29:30 GMT
• Title: Positive maps and extendibility hierarchies from copositive matrices
• Authors: Aabhas Gulati, Ion Nechita, Sang-Jun Park,
• Abstract summary: This work introduces and systematically studies a new convex cone of PCOP (pairwise copositive)<n>We establish that this cone is dual to the cone of PCP (pairwise completely positive) and, critically, provides a complete characterization for the positivity of the broad class of covariant maps.
• Score: 4.914288166307964
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: This work introduces and systematically studies a new convex cone of PCOP (pairwise copositive). We establish that this cone is dual to the cone of PCP (pairwise completely positive) and, critically, provides a complete characterization for the positivity of the broad class of covariant maps. We provide a way to lift matrices from the cone of COP to PCOP, thereby creating a powerful bridge between the theory of copositive forms and the positive maps. We develop an analogous framework for decomposable maps, introducing the cone PDEC. As a primary application of this framework, we define a novel family of linear maps $\Phi_t^G$ parameterized by a graph $G$ and a real parameter $t$. We derive exact thresholds on $t$ that determine when these maps are positive or decomposable, linking these properties to fundamental graph-theoretic parameters. This construction yields vast new families of positive indecomposable maps, for which we provide explicit examples derived from infinite classes of graphs, most notably rank 3 strongly regular graphs such as Paley graphs. On the dual side, we investigate the entanglement properties of large classes of (symmetric) states. We prove that the SOS hierarchies used in polynomial optimization to approximate the cone of copositive matrices correspond precisely to dual cones of witnesses for different levels of the PPT bosonic extendibility hierarchy}-. In the setting of the DPS hierarchy for separability, we construct a large family of optimal entanglement witnesses that are not certifiable by any level of the PPT bosonic extendibility hierarchy, answering a long standing open question from [DPS04]. Leveraging the duality, we also provide an explicit construction of (mixture of) bipartite Dicke states that are simultaneously entangled and $K_r$-PPT bosonic extendible for any desired hierarchy level $r \geq 2$ and local dimension $n \geq 5$.

Related papers

• PointCoT: A Multi-modal Benchmark for Explicit 3D Geometric Reasoning [82.55361351483005]
  We present PointCoT, a novel framework that empowers MLLMs with explicit Chain-of-Thought (CoT) reasoning for 3D data.<n>By leveraging a dual-stream multi-modal architecture, our method synergizes semantic appearance with geometric truth.
  arXiv  Detail & Related papers  (2026-02-27T11:47:45Z)
• 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)
• Group Representational Position Encoding [66.33026480082025]
  We present GRAPE, a unified framework for positional encoding based on group actions.<n>Two families of mechanisms: (i) multiplicative rotations (Multiplicative GRAPE) in $mathrmSO(d)$ and (ii) additive logit biases (Additive GRAPE) arising from unipotent actions in the general linear group $mathrmGL$.
  arXiv  Detail & Related papers  (2025-12-08T18:39:13Z)
• $k$-Positive Maps: New Characterizations and a Generation Method [0.9685837672183747]
  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$
  arXiv  Detail & Related papers  (2025-08-29T06:22:57Z)
• Generalized Gradient Norm Clipping & Non-Euclidean $(L_0,L_1)$-Smoothness [51.302674884611335]
  This work introduces a hybrid non-Euclidean optimization method which generalizes norm clipping by combining steepest descent and conditional gradient approaches.<n>We discuss how to instantiate the algorithms for deep learning and demonstrate their properties on image classification and language modeling.
  arXiv  Detail & Related papers  (2025-06-02T17:34:29Z)
• Linear maps as sufficient criteria for entanglement depth and compatibility in many-body systems [0.0]
  We extend results presented in [Phys. Rev A 93, 042335], where sufficient separability criteria for bipartite systems were derived. We derive criteria to detect arbitrary $(N-n)$-entanglement depth tailored to states in close vicinity of the completely depolarized state. We also provide separability (or $1$- entanglement depth) conditions in the symmetric sector, including for diagonal states.
  arXiv  Detail & Related papers  (2022-11-05T10:42:24Z)
• ExpressivE: A Spatio-Functional Embedding For Knowledge Graph Completion [78.8942067357231]
  ExpressivE embeds pairs of entities as points and relations as hyper-parallelograms in the virtual triple space. We show that ExpressivE is competitive with state-of-the-art KGEs and even significantly outperforms them on W18RR.
  arXiv  Detail & Related papers  (2022-06-08T23:34:39Z)
• Compositions and tensor products of linear maps between matrix algebras [0.0]
  We first explain key notions from current quantum information theory and criteria for them in a coherent way. These include separability/entanglement, Schmidt numbers of bi-partite states and block-positivity. We show that the description of the dual cone with tensor products is possible only when the involving cones are mapping cones.
  arXiv  Detail & Related papers  (2022-04-05T23:14:58Z)
• Dist2Cycle: A Simplicial Neural Network for Homology Localization [66.15805004725809]
  Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations. We propose a graph convolutional model for learning functions parametrized by the $k$-homological features of simplicial complexes.
  arXiv  Detail & Related papers  (2021-10-28T14:59:41Z)
• Annihilating Entanglement Between Cones [77.34726150561087]
  We show that Lorentz cones are the only cones with a symmetric base for which a certain stronger version of the resilience property is satisfied. Our proof exploits the symmetries of the Lorentz cones and applies two constructions resembling protocols for entanglement distillation.
  arXiv  Detail & Related papers  (2021-10-22T15:02:39Z)
• The PPT$^2$ conjecture holds for all Choi-type maps [1.5229257192293197]
  We prove that the PPT$2$ conjecture holds for linear maps between matrix algebras which are covariant under the action of the diagonal unitary group. Our proof relies on a generalization of the matrix-theoretic notion of factor width for pairwise completely positive matrices, and a complete characterization in the case of factor width two.
  arXiv  Detail & Related papers  (2020-11-07T17:00:22Z)
• A deep network construction that adapts to intrinsic dimensionality beyond the domain [79.23797234241471]
  We study the approximation of two-layer compositions $f(x) = g(phi(x))$ via deep networks with ReLU activation. We focus on two intuitive and practically relevant choices for $phi$: the projection onto a low-dimensional embedded submanifold and a distance to a collection of low-dimensional sets.
  arXiv  Detail & Related papers  (2020-08-06T09:50:29Z)
• Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices [0.0]
  Cospectrality is a powerful generalization of exchange symmetry and can be applied to all real-valued symmetric matrices. We show that the powers of a matrix with cospectral vertices induce further local relations on its eigenvectors. Our work paves the way for flexibly exploiting hidden structural symmetries in the design of generic complex network-like systems.
  arXiv  Detail & Related papers  (2020-07-15T10:54:31Z)
• Decomposable Pauli diagonal maps and Tensor Squares of Qubit Maps [91.3755431537592]
  We show that any positive product of a qubit map with itself is decomposable. We characterize the cone of decomposable ququart Pauli diagonal maps.
  arXiv  Detail & Related papers  (2020-06-25T16:39:32Z)

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.