Sparse anisotropic positive maps for qutrit entanglement: exact indecomposability and PPT geometry

• URL: http://arxiv.org/abs/2607.12470v1
• Date: Tue, 14 Jul 2026 07:55:02 GMT
• Title: Sparse anisotropic positive maps for qutrit entanglement: exact indecomposability and PPT geometry
• Abstract summary: We introduce and analyze an exactly solvable family of sparse bistochastic positive maps on qutrits.<n>We show that positivity holds exactly on the square $0le w,zle2/3$, complete positivity on the smaller square $0le w,zle2/3$, and decomposability is lost precisely outside a quarter circle in the corner.<n>Although $W_*$ is not optimal, we give an explicit optimal refinement whose detection region on this family is strictly larger.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Positive but not completely positive maps provide one of the most direct ways to detect entanglement beyond the positive-partial-transpose (PPT) criterion. We introduce and analyze an exactly solvable two-parameter family of sparse bistochastic positive maps on qutrits, in which two coherence channels are independently tuned by parameters $w$ and $z$. The sparse structure makes the full phase diagram analytic: positivity holds exactly on the square $0\le w,z\le2/3$, complete positivity on the smaller square $0\le w,z\le1/3$, and decomposability is lost precisely outside a quarter circle in the corner $w,z\ge1/3$. The indecomposable region is certified by explicit PPT entangled state adapted to the same witness geometry. At the endpoint $W_*=W(2/3,2/3)$ we construct a four-parameter family of PPT edge states of rank type $(5,5)$, derive their analytic detection region, and show that the corresponding rays are exposed faces of the PPT cone. Finally, although $W_*$ is not optimal, we give an explicit optimal refinement whose detection region on this family is strictly larger. The result is an analytically tractable qutrit setting in which positivity, indecomposability, PPT entanglement, optimality, and exposed convex geometry can be studied in a single framework.

Related papers

• Common-Center Geometry and Certified Radial Reconstruction for Energy-Form Full Conformal Regions [5.188221150628459]
  This note focuses on the geometry of conformal prediction (FullCP) regions generated by an empirical energy-form pairwise score.<n>For $12$ and $mge2$, explicit data-checkable derivative bounds give Lipschitz control of the radial exits and exact conformal radial function.
  arXiv  Detail & Related papers  (2026-08-25T07:38:04Z)
• Sparse positive maps on qutrits with exact nondecomposability thresholds and PPT-entanglement transitions [0.6157382820537719]
  We study a family of sparse positive maps on qutrits for which positivity, decomposability, and PPT entanglement can all be analysed explicitly.<n>For the same families we determine the exact transition between decomposable and non-decomposable maps.<n>For the trace-preserving subclass, we compare positivity with a recent eigenvalue bound for 2-positive maps, thereby making the gap between positivity and higher-order positivity fully explicit within this family.
  arXiv  Detail & Related papers  (2026-06-18T03:56:21Z)
• Optimal Dimension-Free Sampling for Regularized Classification [56.72526267755301]
  We prove optimal sampling bounds achieving $(1pmvarepsilon)$-relative error for a broad class of Lipschitz continuous classification loss functions.<n>This includes important functions such as logistic and sigmoid loss, hinge loss, and ReLU loss, as prominent and popular representative examples.
  arXiv  Detail & Related papers  (2026-05-22T15:05:33Z)
• 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)
• On the Sparsifiability of Correlation Clustering: Approximation Guarantees under Edge Sampling [6.908972852063454]
  Correlation Clustering (CC) is a fundamental unsupervised learning primitive.<n>We study how much edge information is needed to retain LP-based guarantees.<n>We show via Yao's minimax principle that without pseudometric structure, any algorithm observing $o(n)$ uniformly random edges incurs an approximation ratio.
  arXiv  Detail & Related papers  (2026-02-14T09:12:15Z)
• $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)
• $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)
• 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)
• Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
  We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann. We show how our results have immediate applications to the modern theory of polarization.
  arXiv  Detail & Related papers  (2022-05-30T18:01:34Z)
• Pessimism in the Face of Confounders: Provably Efficient Offline Reinforcement Learning in Partially Observable Markov Decision Processes [99.26864533035454]
  We study offline reinforcement learning (RL) in partially observable Markov decision processes. We propose the underlineProxy variable underlinePessimistic underlinePolicy underlineOptimization (textttP3O) algorithm. textttP3O is the first provably efficient offline RL algorithm for POMDPs with a confounded dataset.
  arXiv  Detail & Related papers  (2022-05-26T19:13:55Z)
• SU$(3)_1$ Chiral Spin Liquid on the Square Lattice: a View from Symmetric PEPS [55.41644538483948]
  Quantum spin liquids can be faithfully represented and efficiently characterized within the framework of Projectedangled Pair States (PEPS) Characteristic features are revealed by the entanglement spectrum (ES) on an infinitely long cylinder. Special features in the ES are shown to be in correspondence with bulk anyonic correlations, indicating a fine structure in the holographic bulk-edge correspondence.
  arXiv  Detail & Related papers  (2019-12-31T16:30:25Z)

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.