Generating Non-Decomposable Maps with Differentiable Semidefinite Programming

• URL: http://arxiv.org/abs/2605.14644v1
• Date: Thu, 14 May 2026 10:01:29 GMT
• Title: Generating Non-Decomposable Maps with Differentiable Semidefinite Programming
• Abstract summary: We introduce an optimization framework for generating positive non-decomposable maps under flexible structural constraints.<n>We show that the same approach can be adapted to explore open questions in quantum information theory.
• Score: 0.6157382820537719
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Detecting bipartite entanglement with PnCP maps and non-negative polynomials [0.7036032466145112]
  We show how to generate PnCP maps based on the construction of certain positive non-Sum-of-Squares.<n>We numerically investigate their entanglement power, demonstrating notably that they are capable of detecting entangled states.
  arXiv  Detail & Related papers  (2026-05-28T18:00:06Z)
• Fitting Unknown Number of Hyperplanes with Manifold Optimization [57.48093263119306]
  Fitting unknown number of linearplanes to data is a fundamental yet challenging problem in machine learning.<n>Existing approaches often struggle with optimum optima or lack geometric consistency.
  arXiv  Detail & Related papers  (2026-05-27T14:02:20Z)
• Intrinsic Wasserstein Rates for Score-Based Generative Models on Smooth Manifolds [61.14405512940818]
  We show that Score-based generative models are trained in high-dimensional ambient spaces.<n>We use a ReLU implementation of nearest-projection coordinates via finite intrinsic anchors and Gauss Newton.
  arXiv  Detail & Related papers  (2026-05-15T10:20:05Z)
• A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning [52.452902154360565]
  We introduce Mean Curvature Boundary Points (MCBP), a novel geometric framework grounded in Geometric Machine Learning.<n>MCBP explicitly models the intrinsic curvature of the data manifold and computes pointwise mean curvature without requiring principled manifold parametrization.<n>Experiments on synthetic and real-world datasets demonstrate that MCBP consistently improves clustering performance.
  arXiv  Detail & Related papers  (2026-05-05T20:19:09Z)
• Some applications of Choi polynomials of linear maps [0.0]
  We find a connection between the positivity of Hermitian symmetric biquadratic forms and the structure of positive maps.<n>Our results contribute to the broader understanding of entanglement distillation and quantum information theory.
  arXiv  Detail & Related papers  (2026-04-29T16:00:08Z)
• Uncertainty Matters: Structured Probabilistic Online Mapping for Motion Prediction in Autonomous Driving [3.338005707097461]
  We propose a structured probabilistic formulation for online map generation.<n>It represents uncertainty as a combination of a low-rank component, which captures global spatial structure, and a diagonal component representing independent local noise.<n>Our approach establishes new state-of-the-art performance for map-based motion prediction, highlighting the critical role of uncertainty in planning tasks.
  arXiv  Detail & Related papers  (2026-03-20T15:56:48Z)
• Positive maps and extendibility hierarchies from copositive matrices [4.914288166307964]
  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.
  arXiv  Detail & Related papers  (2025-09-18T17:54:09Z)
• On the Stability of a non-hyperbolic nonlinear map with non-bounded set of non-isolated fixed points with applications to Machine Learning [31.263649000946014]
  This paper deals with the convergence analysis of the SUCPA (Semi Unsupervised through Prior Adaptation) algorithm. The convergence analysis is addressed as a dynamical system problem, by studying the local and global stability of the nonlinear map derived from the algorithm.
  arXiv  Detail & Related papers  (2024-01-05T20:04:40Z)
• Noninvertibility and non-Markovianity of quantum dynamical maps [0.0]
  We study the production of (non-)Markovian, invertible maps by the process of mixing noninvertible Pauli maps. We consider a related and potentially helpful issue: the identification of criteria of parameterized families of maps leading to the existence of a well-defined semigroup limit.
  arXiv  Detail & Related papers  (2023-06-22T10:00:11Z)
• Smooth Non-Rigid Shape Matching via Effective Dirichlet Energy Optimization [46.30376601157526]
  We introduce pointwise map smoothness via the Dirichlet energy into the functional map pipeline. We propose an algorithm for optimizing it efficiently, which leads to high-quality results in challenging settings.
  arXiv  Detail & Related papers  (2022-10-05T14:07:17Z)
• Near-optimal estimation of smooth transport maps with kernel sums-of-squares [81.02564078640275]
  Under smoothness conditions, the squared Wasserstein distance between two distributions could be efficiently computed with appealing statistical error upper bounds. The object of interest for applications such as generative modeling is the underlying optimal transport map. We propose the first tractable algorithm for which the statistical $L2$ error on the maps nearly matches the existing minimax lower-bounds for smooth map estimation.
  arXiv  Detail & Related papers  (2021-12-03T13:45:36Z)
• Unfolding Projection-free SDP Relaxation of Binary Graph Classifier via GDPA Linearization [59.87663954467815]
  Algorithm unfolding creates an interpretable and parsimonious neural network architecture by implementing each iteration of a model-based algorithm as a neural layer. In this paper, leveraging a recent linear algebraic theorem called Gershgorin disc perfect alignment (GDPA), we unroll a projection-free algorithm for semi-definite programming relaxation (SDR) of a binary graph. Experimental results show that our unrolled network outperformed pure model-based graph classifiers, and achieved comparable performance to pure data-driven networks but using far fewer parameters.
  arXiv  Detail & Related papers  (2021-09-10T07:01:15Z)
• Improving Metric Dimensionality Reduction with Distributed Topology [68.8204255655161]
  DIPOLE is a dimensionality-reduction post-processing step that corrects an initial embedding by minimizing a loss functional with both a local, metric term and a global, topological term. We observe that DIPOLE outperforms popular methods like UMAP, t-SNE, and Isomap on a number of popular datasets.
  arXiv  Detail & Related papers  (2021-06-14T17:19:44Z)
• Generating and detecting bound entanglement in two-qutrits using a family of indecomposable positive maps [0.0]
  We propose an indecomposable positive map for two-qutrit systems. A corresponding witness operator is constructed and shown to be weakly optimal. We find a new entangled state which is not detectable by certain other well-known entanglement detection criteria.
  arXiv  Detail & Related papers  (2020-08-29T12:52:27Z)

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.