Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.35758

Competing coherence geometries in positive maps: positivity hierarchies, atomicity, and optimal entanglement witnesses

Massimiliano F. Sacchi

quant-phmath-phSubmitted Oct 26, 2026• Announced Oct 27, 2026• 0 citations
arXivHTMLPDF

Abstract

We introduce a family of positive maps on qudits whose Choi operators combine two competing coherence patterns: independent exchange couplings and a collective set of diagonal couplings. For every mixed member of the family, we derive exact conditions for positivity, complete positivity, and all intermediate levels of k-positivity, and we determine the complete phase structure of decomposability and atomicity. The higher-positivity thresholds depend on the channel multiplicities, whereas the exact decomposability boundary is universal in scale-free coordinates. Its proof combines an explicit positive-plus-copositive decomposition with a matching family of positive-partial-transpose (PPT) states. The latter form PPT edge states whose detection region is an ellipse, or a disk after collective rescaling. An embedded-qutrit certificate shows that indecomposability and atomicity coincide throughout the mixed family. In contrast, the purely collective endpoint is decomposable over its entire positive interval. Finally, at maximal coherence, an explicit positive subtraction produces an atomic optimal entanglement witness with the spanning property and a strictly larger PPT- detection set. The study thus provides an exactly solvable setting in which k-positivity, decomposability, atomicity, PPT-edge-state geometry, and witness optimality can be compared in arbitrary local dimension.

AI Summary

The paper asks how positivity hierarchies, decomposability, atomicity, and witness optimality compare within an analytically tractable family of qudit positive maps. It extends a qutrit construction using Choi operators with uniform diagonal weight $a>0$, $p=d-r-1$ independent exchange couplings of strength $w$, and $r$ collective diagonal couplings of strength $z$ sharing $|11\rangle$. For mixed families, $1\le r\le d-2$, positivity holds exactly when $0\le w,z\le2a$. Complete positivity requires $w\le a$ and $z\le a/\sqrt r$; for $2\le k\le d-1$, $k$-positivity requires $w\le a$ and $z\le a/\sqrt{\min\{r,k-1\}}$. Decomposability holds exactly when $(w-a)_+^2+(z-a)_+^2\le a^2$, independently of the multiplicities. Outside this region, every positive member is atomic. The purely collective endpoint, $r=d-1$, is instead decomposable throughout its positive interval $0\le z\le2a$. The proofs combine product-vector optimization, active-block spectra, a rank-constrained matrix inequality, an explicit positive-plus-copositive decomposition, and matching PPT states. An embedded-qutrit Schmidt-number-two certificate establishes atomicity. The full-dimensional PPT construction yields edge states for positive state parameters, with elliptical detection regions that become disks after multiplicity rescaling. At $w=z=2a$, explicit positive subtraction produces an atomic optimal witness with the spanning property and strictly broader PPT detection. This refinement leaves the constructed edge-state family's detection region unchanged. The classification concerns this sparse, uniformly weighted architecture; additional coherence classes, nonuniform diagonal weights, and general coupling graphs remain proposed extensions.

Little sign of AI-generated textIncremental

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
22 pages, 2 figures

Related papers

Sparse positive maps on qutrits with exact nondecomposability thresholds and PPT-entanglement transitions

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

We study a family of sparse positive maps on qutrits for which positivity, decomposability, and PPT entanglement can all be analysed explicitly. The block structure of the associated Choi matrices reduces positivity to a Hermitian biquadratic form and leads to exact positivity boundaries for three representative parametric families. For the same families we determine the exact transition between decomposable and non-decomposable maps and construct associated PPT states of two classes. The first consists of witness-adapted deformations naturally tied to the non-decomposability analysis. The second consists of analytically tractable families whose full PPT-entangled branch is detected by fixed positive maps, yielding exact thresholds between separability and bound entanglement. For the trace-preserving subclass, we further 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.

quant-pharXiv:2606.19765•Quantum Science and Technology•Jun 19, 2026•3 citations

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

Massimiliano F. Sacchi

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.

quant-pharXiv:2607.12470•Physical Review A•Jul 15, 2026•1 citation

Some applications of Choi polynomials of linear maps

Minh Toan Ho, Thanh Hieu Le, Cong Trinh Le +1 more

This paper investigates the properties of Choi polynomials and their fundamental role in the theory of positive linear maps between matrix algebras. By focusing on Hermitian symmetric biquadratic forms, we establish a connection between the positivity of these forms and the structure of positive maps. We specifically explore the construction of indecomposable positive maps in matrix algebras, and their application as entanglement witnesses. Our analysis extends to the detection of Positive Partial Transpose (PPT) entangled states and the classification of edge PPT states in $M_m(\mathbb{C}) \otimes M_n(\mathbb{C})$. Our results provide a refined framework for identifying non-separable states that escape the standard PPT criterion, contributing to the broader understanding of entanglement distillation and quantum information theory.

quant-pharXiv:2604.27034•Linear Algebra and its Applications•Apr 30, 2026•3 citations

Entanglement Breaking of All-Partition Compositions of a PPT Edge-State Channel Family

Kias Henry

We exhibit an all-dimensional family of entanglement-breaking compositions built from distinct non-entanglement-breaking PPT edge-state channels of Sacchi type. For arbitrary subsets defining the two partitions, arbitrary positive family parameters, and any positive diagonal intermediate filter, the resulting Choi operator admits an explicit separable decomposition. A complete-positive matrix factorization handles the doubled-coherence blocks, leading to a pairwise entanglement-breaking class of normalized CPTP PPT channels. This is a theorem about a specific family with a common distinguished basis index, not a proof of the unrestricted PPT-cubed conjecture or a classification of general PPT compositions. Exact-rational and independent channel-level checks are included. Historical priority and external peer review remain open.

•Nov 5, 2026•0 citations

Diagonal-unitary twirls of composites of PPT maps through a qutrit

Tejasvi Singh Tomar

Let Φ: Md → M3 and Ψ: M3 → Md be completely positive and completely copositive (PPT) maps, and let W be the Choi matrix of Ψ ∘ Φ. The PPT2 conjecture asserts that W is separable. We study the twirl of W by the group of local diagonal unitaries D ⊗ D̄, whose separability is equivalent to the statement that no diagonal-unitary-covariant witness detects W. The twirl is determined by Aij = ⟨ij|W|ij⟩ and the coherence matrix Bik = ⟨ii|W|kk⟩. We prove that for every d the twirl is separable whenever rank B ≤ 2. The proof factors W through Gram data Ta = Ga*Ha, classifies the two-dimensional spaces span{Ta} into five types, and combines a peeling lemma with known separability criteria for low-rank PPT states and, for two of the five types, with the theorem that composites of PPT maps through a qubit are entanglement breaking. A peel at an index c writes Ψ (or Φ) as the sum of an entanglement-breaking part and a PPT remainder whose coherence vanishes at c. Chains of peels, interleaved with the removal of zero rows of B, close further cases at every coherence rank, and for d = 4 a single peel suffices. For every d ≥ 3 the twirl plus the diagonal operator ((d − 3)/2) ∑i Bii|ii⟩⟨ii| is separable. At d = 4, if the compression of the Choi matrix of Φ or of Ψ* to a set of at least two outer indices is a sum of product states with linearly independent outer factors, then Φ, respectively Ψ, is entanglement breaking. At d = 4 and coherence rank 3 with a linear relation ∑a λaTa = 0 in which some λa vanishes, the twirl is separable, and Ψ ∘ Φ is entanglement breaking when exactly one λa vanishes. A cycle criterion for an arbitrary factorization B = FF* yields explicit product-state certificates. Numerically, this criterion certifies the twirl at each of the 42 generic configurations without peels produced by our random semidefinite searches at d = 4. At some pairs of extreme PPT maps it fails for every factorization of B. In particular, for every choice of Kraus operators, it fails when the columns of F are the diagonals of the products of a Kraus operator of Ψ with one of Φ. The twirl is nevertheless separable at these pairs: the Choi matrices of Φ and of Ψ* are supported on S ⊗ ℂ3 and S′ ⊗ ℂ3 for three-dimensional subspaces S, S′ ⊆ ℂd, and the known case M3 → M3 → M3 of the PPT2 conjecture applies. For d ≤ 4 and every coherence rank, the twirl is separable for every composite Φ* ∘ Ξ ∘ Φ in which Ξ is a sum of conjugations by positive semidefinite matrices. This follows from a criterion of Johnston and MacLean for completely positive coherence matrices. For d ≤ 4 we extend their criterion to coherence matrices that become entrywise nonnegative under conjugation by a diagonal unitary, provided that, around each cycle of the support graph of B, the product of the entries of A is the same in both directions. We also show that the number of product terms in a separable decomposition of the twirl can exceed the coherence rank, even for entanglement-breaking pairs through a qutrit. Finally, given the theorem that composites of PPT maps through a qubit are entanglement breaking, we show that W + (1/5) Φ*(I)⊤ ⊗ Ψ(I) is separable for every d, that for d ≥ 4 no pair-independent average of certificates from this theorem lowers the constant 1/5, even with PPT2 for maps on M3 and the separability of PPT states on ℂ2 ⊗ ℂ3, and that certificates adapted to the pair go beyond it: exact rational certificates show that W − (1/20) Φ*(I)⊤ ⊗ Ψ(I) is separable for an explicit pair at d = 4, and that W + (1/10) Φ*(I)⊤ ⊗ Ψ(I) is separable for an explicit Φ: M4 → M3 and every PPT map Ψ. Given the same theorem, for Φ: M3 → M3 a constant below 1/5 works uniformly: there is c < 1/5 such that W + c Φ*(I)⊤ ⊗ Ψ(I) is separable for every such Φ and every PPT map Ψ: M3 → Mn. Version 2 adds Theorem 10.19: no PPT channel M₃ → M₃ is rigid, so Λ(3) < 1/5. Given the theorem that composites of PPT maps through a qubit are entanglement breaking, it follows that a single constant below 1/5 applies to every pair of PPT maps M₃ → M₃ → Mₙ (Corollary 10.20). Exact certificates, checked in Lean, show that the constant of certificates adapted to one factor is at most 1/10 at two explicit points built from the Tiles unextendible product basis (Remark 10.21). The accompanying Lean code now contains 2688 theorems, 1833 of which are checked by Lean's kernel alone. Mathematics Subject Classification (2020): 81P40; 15A69, 47L07.

•Oct 25, 2026•1 citation

Open Families of High-Schmidt-Number PPT Channels with Interior Entanglement-Breaking Triple Compositions

Kias Henry

We construct, in every local dimension d≥6, nonempty open families of triples of CPTP channels whose Choi matrices and partial transposes are strictly positive, each with Schmidt number at least d−floor(sqrt(2d−1)) and individually non-entanglement-breaking, but whose triple compositions lie in the interior of the entanglement-breaking cone. The proof combines Johnston–Lovitz high-Schmidt-number PPT states with an explicit separable-order sandwich lemma. We also give a conservative exact rational interval for robustness of a fixed 10→6→10 PPT-channel pair, with independently auditable integer Kraus matrices and numerical checks. This is an existence and sufficient-condition result, not a solution of the general PPT-cubed conjecture or a universal triple-composition theorem. Historical priority and expert peer review remain pending.

•Nov 5, 2026•0 citations
We introduce a family of positive maps on qudits whose Choi operators combine two competing coherence patterns: independent exchange couplings and a collective set of diagonal couplings. For every mixed member of the family, we derive exact conditions for positivity, complete positivity, and all intermediate levels of k-positivity, and we determine the complete phase structure of decomposability and atomicity. The higher-positivity thresholds depend on the channel multiplicities, whereas the exact decomposability boundary is universal in scale-free coordinates. Its proof combines an explicit positive-plus-copositive decomposition with a matching family of positive-partial-transpose (PPT) states. The latter form PPT edge states whose detection region is an ellipse, or a disk after collective rescaling. An embedded-qutrit certificate shows that indecomposability and atomicity coincide throughout the mixed family. In contrast, the purely collective endpoint is decomposable over its entire positive interval. Finally, at maximal coherence, an explicit positive subtraction produces an atomic optimal entanglement witness with the spanning property and a strictly larger PPT- detection set. The study thus provides an exactly solvable setting in which k-positivity, decomposability, atomicity, PPT-edge-state geometry, and witness optimality can be compared in arbitrary local dimension.
The paper asks how positivity hierarchies, decomposability, atomicity, and witness optimality compare within an analytically tractable family of qudit positive maps. It extends a qutrit construction using Choi operators with uniform diagonal weight a>0a>0a>0, p=d−r−1p=d-r-1p=d−r−1 independent exchange couplings of strength www, and rrr collective diagonal couplings of strength zzz sharing ∣11⟩|11\rangle∣11⟩.
For mixed families, 1≤r≤d−21\le r\le d-21≤r≤d−2, positivity holds exactly when 0≤w,z≤2a0\le w,z\le2a0≤w,z≤2a. Complete positivity requires w≤aw\le aw≤a and z≤a/rz\le a/\sqrt rz≤a/r​; for 2≤k≤d−12\le k\le d-12≤k≤d−1, kkk-positivity requires w≤aw\le aw≤a and z≤a/min⁡{r,k−1}z\le a/\sqrt{\min\{r,k-1\}}z≤a/min{r,k−1}​. Decomposability holds exactly when (w−a)+2+(z−a)+2≤a2(w-a)_+^2+(z-a)_+^2\le a^2(w−a)+2​+(z−a)+2​≤a2, independently of the multiplicities. Outside this region, every positive member is atomic. The purely collective endpoint, r=d−1r=d-1r=d−1, is instead decomposable throughout its positive interval 0≤z≤2a0\le z\le2a0≤z≤2a.
The proofs combine product-vector optimization, active-block spectra, a rank-constrained matrix inequality, an explicit positive-plus-copositive decomposition, and matching PPT states. An embedded-qutrit Schmidt-number-two certificate establishes atomicity. The full-dimensional PPT construction yields edge states for positive state parameters, with elliptical detection regions that become disks after multiplicity rescaling.
At w=z=2aw=z=2aw=z=2a, explicit positive subtraction produces an atomic optimal witness with the spanning property and strictly broader PPT detection. This refinement leaves the constructed edge-state family's detection region unchanged. The classification concerns this sparse, uniformly weighted architecture; additional coherence classes, nonuniform diagonal weights, and general coupling graphs remain proposed extensions.
We study a family of sparse positive maps on qutrits for which positivity, decomposability, and PPT entanglement can all be analysed explicitly. The block structure of the associated Choi matrices reduces positivity to a Hermitian biquadratic form and leads to exact positivity boundaries for three representative parametric families. For the same families we determine the exact transition between decomposable and non-decomposable maps and construct associated PPT states of two classes. The first consists of witness-adapted deformations naturally tied to the non-decomposability analysis. The second consists of analytically tractable families whose full PPT-entangled branch is detected by fixed positive maps, yielding exact thresholds between separability and bound entanglement. For the trace-preserving subclass, we further 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.
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 www and zzz. The sparse structure makes the full phase diagram analytic: positivity holds exactly on the square 0≤w,z≤2/30\le w,z\le2/30≤w,z≤2/3, complete positivity on the smaller square 0≤w,z≤1/30\le w,z\le1/30≤w,z≤1/3, and decomposability is lost precisely outside a quarter circle in the corner w,z≥1/3w,z\ge1/3w,z≥1/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)W_*=W(2/3,2/3)W∗​=W(2/3,2/3) we construct a four-parameter family of PPT edge states of rank type (5,5)(5,5)(5,5), derive their analytic detection region, and show that the corresponding rays are exposed faces of the PPT cone. Finally, although W∗W_*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.
This paper investigates the properties of Choi polynomials and their fundamental role in the theory of positive linear maps between matrix algebras. By focusing on Hermitian symmetric biquadratic forms, we establish a connection between the positivity of these forms and the structure of positive maps. We specifically explore the construction of indecomposable positive maps in matrix algebras, and their application as entanglement witnesses. Our analysis extends to the detection of Positive Partial Transpose (PPT) entangled states and the classification of edge PPT states in Mm(C)⊗Mn(C)M_m(\mathbb{C}) \otimes M_n(\mathbb{C})Mm​(C)⊗Mn​(C). Our results provide a refined framework for identifying non-separable states that escape the standard PPT criterion, contributing to the broader understanding of entanglement distillation and quantum information theory.
We exhibit an all-dimensional family of entanglement-breaking compositions built from distinct non-entanglement-breaking PPT edge-state channels of Sacchi type. For arbitrary subsets defining the two partitions, arbitrary positive family parameters, and any positive diagonal intermediate filter, the resulting Choi operator admits an explicit separable decomposition. A complete-positive matrix factorization handles the doubled-coherence blocks, leading to a pairwise entanglement-breaking class of normalized CPTP PPT channels. This is a theorem about a specific family with a common distinguished basis index, not a proof of the unrestricted PPT-cubed conjecture or a classification of general PPT compositions. Exact-rational and independent channel-level checks are included. Historical priority and external peer review remain open.
Let Φ: Md → M3 and Ψ: M3 → Md be completely positive and completely copositive (PPT) maps, and let W be the Choi matrix of Ψ ∘ Φ. The PPT2 conjecture asserts that W is separable. We study the twirl of W by the group of local diagonal unitaries D ⊗ D̄, whose separability is equivalent to the statement that no diagonal-unitary-covariant witness detects W. The twirl is determined by Aij = ⟨ij|W|ij⟩ and the coherence matrix Bik = ⟨ii|W|kk⟩. We prove that for every d the twirl is separable whenever rank B ≤ 2. The proof factors W through Gram data Ta = Ga*Ha, classifies the two-dimensional spaces span{Ta} into five types, and combines a peeling lemma with known separability criteria for low-rank PPT states and, for two of the five types, with the theorem that composites of PPT maps through a qubit are entanglement breaking. A peel at an index c writes Ψ (or Φ) as the sum of an entanglement-breaking part and a PPT remainder whose coherence vanishes at c. Chains of peels, interleaved with the removal of zero rows of B, close further cases at every coherence rank, and for d = 4 a single peel suffices. For every d ≥ 3 the twirl plus the diagonal operator ((d − 3)/2) ∑i Bii|ii⟩⟨ii| is separable. At d = 4, if the compression of the Choi matrix of Φ or of Ψ* to a set of at least two outer indices is a sum of product states with linearly independent outer factors, then Φ, respectively Ψ, is entanglement breaking. At d = 4 and coherence rank 3 with a linear relation ∑a λaTa = 0 in which some λa vanishes, the twirl is separable, and Ψ ∘ Φ is entanglement breaking when exactly one λa vanishes. A cycle criterion for an arbitrary factorization B = FF* yields explicit product-state certificates. Numerically, this criterion certifies the twirl at each of the 42 generic configurations without peels produced by our random semidefinite searches at d = 4. At some pairs of extreme PPT maps it fails for every factorization of B. In particular, for every choice of Kraus operators, it fails when the columns of F are the diagonals of the products of a Kraus operator of Ψ with one of Φ. The twirl is nevertheless separable at these pairs: the Choi matrices of Φ and of Ψ* are supported on S ⊗ ℂ3 and S′ ⊗ ℂ3 for three-dimensional subspaces S, S′ ⊆ ℂd, and the known case M3 → M3 → M3 of the PPT2 conjecture applies. For d ≤ 4 and every coherence rank, the twirl is separable for every composite Φ* ∘ Ξ ∘ Φ in which Ξ is a sum of conjugations by positive semidefinite matrices. This follows from a criterion of Johnston and MacLean for completely positive coherence matrices. For d ≤ 4 we extend their criterion to coherence matrices that become entrywise nonnegative under conjugation by a diagonal unitary, provided that, around each cycle of the support graph of B, the product of the entries of A is the same in both directions. We also show that the number of product terms in a separable decomposition of the twirl can exceed the coherence rank, even for entanglement-breaking pairs through a qutrit. Finally, given the theorem that composites of PPT maps through a qubit are entanglement breaking, we show that W + (1/5) Φ*(I)⊤ ⊗ Ψ(I) is separable for every d, that for d ≥ 4 no pair-independent average of certificates from this theorem lowers the constant 1/5, even with PPT2 for maps on M3 and the separability of PPT states on ℂ2 ⊗ ℂ3, and that certificates adapted to the pair go beyond it: exact rational certificates show that W − (1/20) Φ*(I)⊤ ⊗ Ψ(I) is separable for an explicit pair at d = 4, and that W + (1/10) Φ*(I)⊤ ⊗ Ψ(I) is separable for an explicit Φ: M4 → M3 and every PPT map Ψ. Given the same theorem, for Φ: M3 → M3 a constant below 1/5 works uniformly: there is c < 1/5 such that W + c Φ*(I)⊤ ⊗ Ψ(I) is separable for every such Φ and every PPT map Ψ: M3 → Mn. Version 2 adds Theorem 10.19: no PPT channel M₃ → M₃ is rigid, so Λ(3) < 1/5. Given the theorem that composites of PPT maps through a qubit are entanglement breaking, it follows that a single constant below 1/5 applies to every pair of PPT maps M₃ → M₃ → Mₙ (Corollary 10.20). Exact certificates, checked in Lean, show that the constant of certificates adapted to one factor is at most 1/10 at two explicit points built from the Tiles unextendible product basis (Remark 10.21). The accompanying Lean code now contains 2688 theorems, 1833 of which are checked by Lean's kernel alone. Mathematics Subject Classification (2020): 81P40; 15A69, 47L07.
We construct, in every local dimension d≥6, nonempty open families of triples of CPTP channels whose Choi matrices and partial transposes are strictly positive, each with Schmidt number at least d−floor(sqrt(2d−1)) and individually non-entanglement-breaking, but whose triple compositions lie in the interior of the entanglement-breaking cone. The proof combines Johnston–Lovitz high-Schmidt-number PPT states with an explicit separable-order sandwich lemma. We also give a conservative exact rational interval for robustness of a fixed 10→6→10 PPT-channel pair, with independently auditable integer Kraus matrices and numerical checks. This is an existence and sufficient-condition result, not a solution of the general PPT-cubed conjecture or a universal triple-composition theorem. Historical priority and expert peer review remain pending.