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:2011.03809 · Annales Henri Poincaré

The PPT$$^2$$ Conjecture Holds for All Choi-Type Maps

Satvik Singh, Ion Nechita

Published Mar 6, 2022• 19 citations
arXivHTMLPDF

Abstract

Abstract We prove that the PPT $$^2$$ 2 conjecture holds for linear maps between matrix algebras which are covariant under the action of the diagonal unitary group. Many salient examples, like the Choi-type maps, depolarizing maps, dephasing maps, amplitude damping maps, and mixtures thereof, lie in this class. 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.

DOI
10.1007/s00023-022-01166-0

Related papers

Diagonal unitary and orthogonal symmetries in quantum theory

Satvik Singh, Ion Nechita

We analyze bipartite matrices and linear maps between matrix algebras, which are respectively, invariant and covariant, under the diagonal unitary and orthogonal groups' actions. By presenting an expansive list of examples from the literature, which includes notable entries like the Diagonal Symmetric states and the Choi-type maps, we show that this class of matrices (and maps) encompasses a wide variety of scenarios, thereby unifying their study. We examine their linear algebraic structure and investigate different notions of positivity through their convex conic manifestations. In particular, we generalize the well-known cone of completely positive matrices to that of triplewise completely positive matrices and connect it to the separability of the relevant invariant states (or the entanglement breaking property of the corresponding quantum channels). For linear maps, we provide explicit characterizations of the stated covariance in terms of their Kraus, Stinespring, and Choi representations, and systematically analyze the usual properties of positivity, decomposability, complete positivity, and the like. We also describe the invariant subspaces of these maps and use their structure to provide necessary and sufficient conditions for separability of the associated invariant bipartite states.

arXiv:2010.07898•Quantum•Aug 9, 2021•34 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

The PPT² conjecture holds for spin-factor maps

Tejasvi Singh Tomar

The PPT2 conjecture asserts that the composition of two completely positive and completely copositive maps is entanglement breaking. A counterexample in dimension ten has recently been announced, and for maps on M4 the conjecture is open. Let 𝒮 ⊂ M4 be the real span of the identity γ0 and five pairwise anticommuting Hermitian unitaries γ1, …, γ5. It is a spin factor whose positive cone is a Lorentz cone. We prove the conjecture for all compositions Ψ∘Φ of completely positive maps Φ: M4 → Mk and Ψ: Mk → M4, with k arbitrary, such that the ranges of Ψ and of the adjoint Φ* lie in invertible congruences of the complex span of 𝒮. Such maps are automatically completely copositive, and the class contains maps whose Choi matrices are entangled. A theorem of Hildebrand on separability for pairs of Lorentz cones reduces the claim to one trace inequality between the coefficient matrices of the two Choi matrices. We derive this inequality from the operator inequality Σj=15FjF0−1Fj ⪯ F0, valid whenever Σμ=05Fμ ⊗ γμ ⪰ 0 and F0 ≻ 0, which in turn follows from the Kadison–Schwarz inequality. As a corollary, Ψ∘Φ is entanglement breaking whenever Ψ is such a map and Φ is a completely positive map with Kraus operators of rank at most two. Mathematics Subject Classification (2020): 81P40; 47L07, 15A69, 46L07.

•Oct 19, 2026•0 citations

On the minimal dimension of range-criterion counterexamples to the PPT² conjecture

Tejasvi Singh Tomar

The PPT² conjecture asserts that the composition of two completely positive and completely copositive (PPT) maps is entanglement breaking. A recent counterexample uses two maps through a six-dimensional middle algebra between ten-dimensional outer algebras, and certifies entanglement by the range criterion: the range of the composite Choi matrix contains no product vector. We ask how small such a certificate can be. For PPT maps Φ: Mₘ → Mₖ and Ψ: Mₖ → Mₙ with Ψ ∘ Φ ≠ 0 we prove, with computer-assisted steps, that the range of the Choi matrix of Ψ ∘ Φ contains a product vector whenever max(m, k, n) ≤ 6 and either k ≤ 5 or an outer dimension is at most five. If both outer dimensions are four, this holds for every middle dimension k. In dimension six only the reduced type (6, 6, 6) remains, and we bound its Choi ranks. The proofs use that, after a reduction, a product-free composite range forbids Kraus operators of rank at most two, that the rank-loss loci of a PPT map are finite unions of linear subspaces with generically constant range on each subspace, a rank inequality for PPT maps at product vectors in the kernel of their Choi matrices, top Chern classes at middle dimensions four and five, an excess intersection on Gr(3, 6) at middle dimension six, and, for the type (5, 6, 5), the Euler characteristic of a sheaf on a multiple line in ℙ². For the known example we show that the quadratic Veronese images of the rank-loss directions of its base map and of their kernel vectors are Gale dual by the Cayley–Bacharach theorem, and that the kernel conditions determine the Kraus spaces of both factors. If the rank-loss scheme of the base map is reduced and of the expected dimension zero, then among the lifts through arbitrary Schur functors with nonzero composite only those through exterior powers give an unextendible product set of kernel product vectors, and these only when one of the three dimensions is at least ten. For a general base map, the member of the family with outer dimension six is one product vector short of the range criterion, and its factors are rigid. For such base maps on M₄ that are not entanglement breaking, a compression of the lift to outer dimensions 4 ≤ D ≤ 9 keeps at most 2D − 4 of the twenty kernel product vectors. Finally, symmetry under a compact connected group acting irreducibly on both outer spaces, or under SU(2) acting without multiplicities on one of them, puts a product vector into the range. Mathematics Subject Classification (2020): 81P40; 15A69, 14M15, 14C17, 47L07.

•Oct 24, 2026•0 citations

Tomiyama-type maps with a diagonal perturbation

Anindita Bera, Bihalan Bhattacharya, Dariusz Chruściński

We investigate a two-parameter family of linear maps on matrix algebras, constructed as diagonal perturbations of classical Tomiyama maps. Employing the Choi matrix method alongside block-positivity techniques, we derive explicit necessary and sufficient conditions for positivity, complete positivity, and k-positivity across arbitrary dimensions. These conditions provide a transparent geometric characterization of the positivity regions within the parameter space.

math.RACross-listedarXiv:2604.18600•Apr 10, 2026•1 citation

Schwarz maps with symmetry

Alfonso García-Velo, Alberto Ibort

The theory of symmetry of quantum mechanical systems is applied to study the structure and properties of several classes of relevant maps in quantum information theory: CPTP, PPT and Schwarz maps. First, we develop the general structure that equivariant maps $Φ:\mathcal A \to \mathcal B$ between $C^\ast$-algebras satisfy. Then, we undertake a systematic study of unital, Hermiticity-preserving maps that are equivariant under natural unitary group actions. Schwarz maps satisfy Kadison's inequality $Φ(X^\ast X) \geq Φ(X)^\ast Φ(X)$ and form an intermediate class between positive and completely positive maps. We completely classify $U(n)$-equivariant on $M_n(\mathbb C)$ and determine those that are completely positive and Schwarz. Partial classifications are then obtained for the weaker $DU(n)$-equivariance (diagonal unitary symmetry) and for tensor-product symmetries $U(n_1) \otimes U(n_2)$. In each case, the parameter regions where $Φ$ is Schwarz or completely positive are described by explicit algebraic inequalities, and their geometry is illustrated. Finally, we further show that the $U(n)$-equivariant family satisfies $\mathrm{PPT} \iff \mathrm{EB}$, while the $DU(2)$, symmetric $DU(3)$, $U(2) \otimes U(2)$ and $U(2) \otimes U(3)$, families obey the $\mathrm{PPT}^2$ conjecture through a direct symmetry argument. These results reveal how group symmetry controls the structure of non-completely positive maps and provide new concrete examples where the $\mathrm{PPT}^2$ property holds.

quant-pharXiv:2601.02282•Jan 6, 2026•1 citation
The PPT2^22 Conjecture Holds for All Choi-Type Maps
Abstract We prove that the PPT 2^22 2 conjecture holds for linear maps between matrix algebras which are covariant under the action of the diagonal unitary group. Many salient examples, like the Choi-type maps, depolarizing maps, dephasing maps, amplitude damping maps, and mixtures thereof, lie in this class. 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.
We analyze bipartite matrices and linear maps between matrix algebras, which are respectively, invariant and covariant, under the diagonal unitary and orthogonal groups' actions. By presenting an expansive list of examples from the literature, which includes notable entries like the Diagonal Symmetric states and the Choi-type maps, we show that this class of matrices (and maps) encompasses a wide variety of scenarios, thereby unifying their study. We examine their linear algebraic structure and investigate different notions of positivity through their convex conic manifestations. In particular, we generalize the well-known cone of completely positive matrices to that of triplewise completely positive matrices and connect it to the separability of the relevant invariant states (or the entanglement breaking property of the corresponding quantum channels). For linear maps, we provide explicit characterizations of the stated covariance in terms of their Kraus, Stinespring, and Choi representations, and systematically analyze the usual properties of positivity, decomposability, complete positivity, and the like. We also describe the invariant subspaces of these maps and use their structure to provide necessary and sufficient conditions for separability of the associated invariant bipartite states.
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.
The PPT2 conjecture asserts that the composition of two completely positive and completely copositive maps is entanglement breaking. A counterexample in dimension ten has recently been announced, and for maps on M4 the conjecture is open. Let 𝒮 ⊂ M4 be the real span of the identity γ0 and five pairwise anticommuting Hermitian unitaries γ1, …, γ5. It is a spin factor whose positive cone is a Lorentz cone. We prove the conjecture for all compositions Ψ∘Φ of completely positive maps Φ: M4 → Mk and Ψ: Mk → M4, with k arbitrary, such that the ranges of Ψ and of the adjoint Φ* lie in invertible congruences of the complex span of 𝒮. Such maps are automatically completely copositive, and the class contains maps whose Choi matrices are entangled. A theorem of Hildebrand on separability for pairs of Lorentz cones reduces the claim to one trace inequality between the coefficient matrices of the two Choi matrices. We derive this inequality from the operator inequality Σj=15FjF0−1Fj ⪯ F0, valid whenever Σμ=05Fμ ⊗ γμ ⪰ 0 and F0 ≻ 0, which in turn follows from the Kadison–Schwarz inequality. As a corollary, Ψ∘Φ is entanglement breaking whenever Ψ is such a map and Φ is a completely positive map with Kraus operators of rank at most two. Mathematics Subject Classification (2020): 81P40; 47L07, 15A69, 46L07.
The PPT² conjecture asserts that the composition of two completely positive and completely copositive (PPT) maps is entanglement breaking. A recent counterexample uses two maps through a six-dimensional middle algebra between ten-dimensional outer algebras, and certifies entanglement by the range criterion: the range of the composite Choi matrix contains no product vector. We ask how small such a certificate can be. For PPT maps Φ: Mₘ → Mₖ and Ψ: Mₖ → Mₙ with Ψ ∘ Φ ≠ 0 we prove, with computer-assisted steps, that the range of the Choi matrix of Ψ ∘ Φ contains a product vector whenever max(m, k, n) ≤ 6 and either k ≤ 5 or an outer dimension is at most five. If both outer dimensions are four, this holds for every middle dimension k. In dimension six only the reduced type (6, 6, 6) remains, and we bound its Choi ranks. The proofs use that, after a reduction, a product-free composite range forbids Kraus operators of rank at most two, that the rank-loss loci of a PPT map are finite unions of linear subspaces with generically constant range on each subspace, a rank inequality for PPT maps at product vectors in the kernel of their Choi matrices, top Chern classes at middle dimensions four and five, an excess intersection on Gr(3, 6) at middle dimension six, and, for the type (5, 6, 5), the Euler characteristic of a sheaf on a multiple line in ℙ². For the known example we show that the quadratic Veronese images of the rank-loss directions of its base map and of their kernel vectors are Gale dual by the Cayley–Bacharach theorem, and that the kernel conditions determine the Kraus spaces of both factors. If the rank-loss scheme of the base map is reduced and of the expected dimension zero, then among the lifts through arbitrary Schur functors with nonzero composite only those through exterior powers give an unextendible product set of kernel product vectors, and these only when one of the three dimensions is at least ten. For a general base map, the member of the family with outer dimension six is one product vector short of the range criterion, and its factors are rigid. For such base maps on M₄ that are not entanglement breaking, a compression of the lift to outer dimensions 4 ≤ D ≤ 9 keeps at most 2D − 4 of the twenty kernel product vectors. Finally, symmetry under a compact connected group acting irreducibly on both outer spaces, or under SU(2) acting without multiplicities on one of them, puts a product vector into the range. Mathematics Subject Classification (2020): 81P40; 15A69, 14M15, 14C17, 47L07.
The theory of symmetry of quantum mechanical systems is applied to study the structure and properties of several classes of relevant maps in quantum information theory: CPTP, PPT and Schwarz maps. First, we develop the general structure that equivariant maps Φ:A→BΦ:\mathcal A \to \mathcal BΦ:A→B between C∗C^\astC∗-algebras satisfy. Then, we undertake a systematic study of unital, Hermiticity-preserving maps that are equivariant under natural unitary group actions. Schwarz maps satisfy Kadison's inequality Φ(X∗X)≥Φ(X)∗Φ(X)Φ(X^\ast X) \geq Φ(X)^\ast Φ(X)Φ(X∗X)≥Φ(X)∗Φ(X) and form an intermediate class between positive and completely positive maps. We completely classify U(n)U(n)U(n)-equivariant on Mn(C)M_n(\mathbb C)Mn​(C) and determine those that are completely positive and Schwarz. Partial classifications are then obtained for the weaker DU(n)DU(n)DU(n)-equivariance (diagonal unitary symmetry) and for tensor-product symmetries U(n1)⊗U(n2)U(n_1) \otimes U(n_2)U(n1​)⊗U(n2​). In each case, the parameter regions where ΦΦΦ is Schwarz or completely positive are described by explicit algebraic inequalities, and their geometry is illustrated. Finally, we further show that the U(n)U(n)U(n)-equivariant family satisfies PPT  ⟺  EB\mathrm{PPT} \iff \mathrm{EB}PPT⟺EB, while the DU(2)DU(2)DU(2), symmetric DU(3)DU(3)DU(3), U(2)⊗U(2)U(2) \otimes U(2)U(2)⊗U(2) and U(2)⊗U(3)U(2) \otimes U(3)U(2)⊗U(3), families obey the PPT2\mathrm{PPT}^2PPT2 conjecture through a direct symmetry argument. These results reveal how group symmetry controls the structure of non-completely positive maps and provide new concrete examples where the PPT2\mathrm{PPT}^2PPT2 property holds.