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

A Realignment-Based Obstruction to Two-Superpositive Decompositions of PPT Operators: An Explicit Rational Certificate and Tensor-Power Construction

Kias Henry

Published Oct 28, 2026• 0 citations
Publisher

Abstract

We present an explicit rational certificate for a positive-partial-transpose (PPT) state on C^15625 tensor C^15625 outside the cone C2 + partial_transpose(C2), where C2 denotes the cone of positive semidefinite operators of Schmidt number at most two. A 5x5 grid-state seed has realignment norm bounded below by 1028/909, proved by a 25x25 integer matrix certificate. Six tensor copies amplify this to (1028/909)^6 > 2, while the realignment norm is at most twice the trace on C2 + partial_transpose(C2). An explicit Choi witness consequently defines a linear map that is simultaneously 2-positive and 2-copositive but nondecomposable. The accompanying archive contains the mathematical preprint, LaTeX source, exact-arithmetic verification programs, and computational checks. This is an unrefereed proof manuscript. Independent expert verification and exhaustive prior-art assessment remain outstanding. The construction does not resolve the PPT-cubed conjecture or establish an improved quantum teleportation protocol.

DOI
10.5281/zenodo.23696847

Related papers

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

Beyond the Positive Partial Transpose Squared Conjecture: The Qutrit Case

Junhyeong An, Soojoon Lee

Entanglement swapping is a fundamental operation in quantum repeaters for establishing entanglement between distant parties. The positive partial transpose (PPT) squared conjecture asks whether two PPT entangled links can generate terminal entanglement through entanglement swapping, or equivalently, whether the composition of two PPT maps is always entanglement breaking. Motivated by this conjecture, we investigate the map-composition problem beyond the PPT setting. For qutrit completely positive (CP) maps, we prove that the composition of any CP map whose Choi matrix is $1$-undistillable with any CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in either order. Moreover, we show that the cone of $1$-undistillable CP maps is exactly the largest qutrit cone of CP maps whose composition with every CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in both orders. Finally, although map composition captures only the standard maximally entangled outcome in entanglement swapping, we prove that any $1$-undistillable two-qutrit state and any state of Schmidt number at most two cannot generate terminal entanglement under an arbitrary selective measurement on the intermediate systems.

quant-pharXiv:2607.15947•Jul 20, 2026•1 citation

The PPT² conjecture through a qutrit: barriers at 1/5 and a smaller constant when the first factor acts on M₃

Tejasvi Singh Tomar

The PPT2 conjecture asserts that composites of PPT (completely positive and completely copositive) maps are entanglement breaking. For PPT maps Φ: Md1 → M3 and Ψ: M3 → Md2 let W be the Choi matrix of Ψ ∘ Φ. With the theorem that composites of PPT maps through a qubit are entanglement breaking (the qubit theorem), it is known that W + (1/5) Φ*(I)⊤ ⊗ Ψ(I) is separable, while PPT2 through a qutrit is the same statement with 1/5 replaced by 0. We ask how far 1/5 can be lowered. Certificates built from the qubit theorem independently of the pair cannot lower it, and for d1, d2 ≥ 3 with max(d1, d2) ≥ 4 neither can averages of certificates that apply maps separately to the input, middle and output spaces, even with PPT2 on M3 added. The least λ for which J(Φ) + λ Φ*(I)⊤ ⊗ I is a sum of PPT operators supported on ℂd1 ⊗ V for planes V is the one-sided constant λQD(Φ) ≤ 1/5; by the qubit theorem it is valid for every partner. It is below 1/5 when one compression of the middle qutrit to a qubit is strictly PPT of full rank, and its largest value Λ(d) over d1 = d is below 1/5 unless some extreme PPT channel is rigid, that is, has λQD = 1/5. We prove, without the qubit theorem, that no PPT channel M3 → M3 is rigid, so that some c < 1/5 makes ρ + c I ⊗ I separable for the Choi matrix ρ of every PPT channel M3 → M3. With the qubit theorem, W + c Φ*(I)⊤ ⊗ Ψ(I) is then separable for all PPT maps Φ: M3 → M3 and Ψ: M3 → Md2, and exact rational certificates beat 1/5 at explicit factors with d1 = 4. The exact computations used in the proofs are also checked in Lean 4. This paper develops Section 10, Appendix A and supplement S12-S13 of version 3 of "Diagonal-unitary twirls of composites of PPT maps through a qutrit" (doi:10.5281/zenodo.23675449) with a new introduction and preliminaries; its supplement S1-S2 is S12-S13 there. The statements and proofs are those of that version, renumbered, with references to the companion paper, version 4 of that record (doi:10.5281/zenodo.23680469). Programs, certificates and Lean checks are in the deposit, version 4 (doi:10.5281/zenodo.23680464). Dagger k of this paper is dagger k+24 in version 3 and in the deposit's folders, map files, replay record and Lean targets; the deposit's README uses this paper's numbering. Mathematics Subject Classification (2020): 81P40; 15A69, 47L07.

•Oct 26, 2026•1 citation

Exact rational certification of upper and lower quantum bounds for the 𝐼3322 Bell inequality

Nidhal Mghirbi

This preprint constructs finite rational proof objects for both sides of the quantum value of I3322 Bell inequality. Let 𝑄t denote the supremum over finite-dimensional tensor-product binary measurements and𝑄c the commuting-operator value. On the complete word space of total length at most four, we construct a rational Gram certificate. The full signed setting-relabeling stabilizer is the dihedral group of order eight, reducing the certificate to five rational blocks. Ex-act affine reconstruction and a uniform diagonal shift of certified positive interior prove: 𝑄c (𝐼3322) ≤ 62718846253/250000000000 = 0.250875385012. Independently, a local-dimension-499 strategy specified by rational projectors and a nonzero unnormalized rational Schmidt vector has exact normalized value 𝐿499 = 0.25087538451397653548 . . .. Con-sequently, 𝐿499 ≤ 𝑄t(𝐼3322) ≤ 𝑄c (𝐼3322) ≤ 0.250875385012, with endpoint difference below 5 × 10−10. The lower certificate also proves 𝑄t(𝐼3322) > 1/4. Every theorem is checked using exact rational or integer arithmetic; floating-point computation is used only to discover candidates. Complete certificates, source code, tests, and reproducibility materials are archived at: doi:10.5281/zenodo.21462892.

•Jul 21, 2026•2 citations

Exact Schmidt Numbers and PPT Extremality of an Infinite Grid-State Family

Kias Henry

Krebs and Gachechiladze [Phys. Rev. A 113, 062428 (2026)] introduced a family of positive-partial-transpose (PPT) generalized grid states in local dimension d = 2k − 1. They determined the Schmidt number for k ≤ 5 and proposed an all-order scaling pattern. For their particular explicitly specified family, we prove SN(R_k) = k = (d + 1)/2 for every k ≥ 2 using a universal signed-minor identity. We also prove that each R_k generates an extreme ray of the complex Hermitian PPT cone, and obtain exact ranks rank(R_k) = k² + k − 1 and rank(R_k^Γ) = k² + 2k − 3. Local filtering yields extremal trace-preserving PPT channels whose Choi matrices have Schmidt number k and whose partially transposed Choi matrices have Schmidt number two. Their threefold iterates are entanglement breaking by a theorem of Park (2026). The underlying states, their PPT decomposition, and other families with linear Schmidt-number growth were established in earlier work; the results here concern the specific 2026 grid-state family.

•Nov 3, 2026•0 citations

Toroidal-Core Certificates for PPT-Squared Diagonal Orthogonal Covariant Channels

Samuel Marquez Gonzalez

The positive-partial-transpose-squared (PPT-squared) conjecture asks whether the composition of two positive-partial-transpose (PPT) quantum channels must be entanglement breaking (EB). The problem remains open in general and, within the diagonal orthogonal covariant (DOC) class, the first unresolved deterministic dimension is four. A sufficient condition for PPT-squared composition is derived for DOC maps in arbitrary finite dimension. The proof isolates the quantum coherence data into two correlation matrices, mixes each with the identity until it lies in the convex hull of rank-one correlation matrices, and converts the resulting objects into an explicit triplewise completely positive (TCP) core. The remaining contribution is purely classical and is TCP whenever a simple entrywise mixing inequality is satisfied. For PPT DOC maps $Φ_{A,B,C}$ and $Φ_{D,E,F}$ on $M_d$, the entrywise bound $(AD)_{ij}\ge 2\lfloor\sqrt{d}\rfloor\sqrt{A_{ii}A_{jj}D_{ii}D_{jj}}$ for all $i,j$ guarantees that $Φ_{A,B,C}\circΦ_{D,E,F}$ is EB. In dimension four the universal coefficient becomes four. A continuous family of bistochastic PPT channels is then constructed; every member with $a\ne1$ is not EB, while every pairwise composition within the family is proved to be EB. A rank-sensitive refinement shows explicitly how low coherence rank can improve the universal coefficient. The resulting certificate is sufficient rather than necessary and is complementary to factor-width and semidefinite-hierarchy approaches.

quant-pharXiv:2609.32979•Sep 29, 2026•0 citations
We present an explicit rational certificate for a positive-partial-transpose (PPT) state on C^15625 tensor C^15625 outside the cone C2 + partial_transpose(C2), where C2 denotes the cone of positive semidefinite operators of Schmidt number at most two. A 5x5 grid-state seed has realignment norm bounded below by 1028/909, proved by a 25x25 integer matrix certificate. Six tensor copies amplify this to (1028/909)^6 > 2, while the realignment norm is at most twice the trace on C2 + partial_transpose(C2). An explicit Choi witness consequently defines a linear map that is simultaneously 2-positive and 2-copositive but nondecomposable. The accompanying archive contains the mathematical preprint, LaTeX source, exact-arithmetic verification programs, and computational checks. This is an unrefereed proof manuscript. Independent expert verification and exhaustive prior-art assessment remain outstanding. The construction does not resolve the PPT-cubed conjecture or establish an improved quantum teleportation protocol.
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.
Entanglement swapping is a fundamental operation in quantum repeaters for establishing entanglement between distant parties. The positive partial transpose (PPT) squared conjecture asks whether two PPT entangled links can generate terminal entanglement through entanglement swapping, or equivalently, whether the composition of two PPT maps is always entanglement breaking. Motivated by this conjecture, we investigate the map-composition problem beyond the PPT setting. For qutrit completely positive (CP) maps, we prove that the composition of any CP map whose Choi matrix is 111-undistillable with any CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in either order. Moreover, we show that the cone of 111-undistillable CP maps is exactly the largest qutrit cone of CP maps whose composition with every CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in both orders. Finally, although map composition captures only the standard maximally entangled outcome in entanglement swapping, we prove that any 111-undistillable two-qutrit state and any state of Schmidt number at most two cannot generate terminal entanglement under an arbitrary selective measurement on the intermediate systems.
The PPT2 conjecture asserts that composites of PPT (completely positive and completely copositive) maps are entanglement breaking. For PPT maps Φ: Md1 → M3 and Ψ: M3 → Md2 let W be the Choi matrix of Ψ ∘ Φ. With the theorem that composites of PPT maps through a qubit are entanglement breaking (the qubit theorem), it is known that W + (1/5) Φ*(I)⊤ ⊗ Ψ(I) is separable, while PPT2 through a qutrit is the same statement with 1/5 replaced by 0. We ask how far 1/5 can be lowered. Certificates built from the qubit theorem independently of the pair cannot lower it, and for d1, d2 ≥ 3 with max(d1, d2) ≥ 4 neither can averages of certificates that apply maps separately to the input, middle and output spaces, even with PPT2 on M3 added. The least λ for which J(Φ) + λ Φ*(I)⊤ ⊗ I is a sum of PPT operators supported on ℂd1 ⊗ V for planes V is the one-sided constant λQD(Φ) ≤ 1/5; by the qubit theorem it is valid for every partner. It is below 1/5 when one compression of the middle qutrit to a qubit is strictly PPT of full rank, and its largest value Λ(d) over d1 = d is below 1/5 unless some extreme PPT channel is rigid, that is, has λQD = 1/5. We prove, without the qubit theorem, that no PPT channel M3 → M3 is rigid, so that some c < 1/5 makes ρ + c I ⊗ I separable for the Choi matrix ρ of every PPT channel M3 → M3. With the qubit theorem, W + c Φ*(I)⊤ ⊗ Ψ(I) is then separable for all PPT maps Φ: M3 → M3 and Ψ: M3 → Md2, and exact rational certificates beat 1/5 at explicit factors with d1 = 4. The exact computations used in the proofs are also checked in Lean 4. This paper develops Section 10, Appendix A and supplement S12-S13 of version 3 of "Diagonal-unitary twirls of composites of PPT maps through a qutrit" (doi:10.5281/zenodo.23675449) with a new introduction and preliminaries; its supplement S1-S2 is S12-S13 there. The statements and proofs are those of that version, renumbered, with references to the companion paper, version 4 of that record (doi:10.5281/zenodo.23680469). Programs, certificates and Lean checks are in the deposit, version 4 (doi:10.5281/zenodo.23680464). Dagger k of this paper is dagger k+24 in version 3 and in the deposit's folders, map files, replay record and Lean targets; the deposit's README uses this paper's numbering. Mathematics Subject Classification (2020): 81P40; 15A69, 47L07.
This preprint constructs finite rational proof objects for both sides of the quantum value of I3322 Bell inequality. Let 𝑄t denote the supremum over finite-dimensional tensor-product binary measurements and𝑄c the commuting-operator value. On the complete word space of total length at most four, we construct a rational Gram certificate. The full signed setting-relabeling stabilizer is the dihedral group of order eight, reducing the certificate to five rational blocks. Ex-act affine reconstruction and a uniform diagonal shift of certified positive interior prove: 𝑄c (𝐼3322) ≤ 62718846253/250000000000 = 0.250875385012. Independently, a local-dimension-499 strategy specified by rational projectors and a nonzero unnormalized rational Schmidt vector has exact normalized value 𝐿499 = 0.25087538451397653548 . . .. Con-sequently, 𝐿499 ≤ 𝑄t(𝐼3322) ≤ 𝑄c (𝐼3322) ≤ 0.250875385012, with endpoint difference below 5 × 10−10. The lower certificate also proves 𝑄t(𝐼3322) > 1/4. Every theorem is checked using exact rational or integer arithmetic; floating-point computation is used only to discover candidates. Complete certificates, source code, tests, and reproducibility materials are archived at: doi:10.5281/zenodo.21462892.
Krebs and Gachechiladze [Phys. Rev. A 113, 062428 (2026)] introduced a family of positive-partial-transpose (PPT) generalized grid states in local dimension d = 2k − 1. They determined the Schmidt number for k ≤ 5 and proposed an all-order scaling pattern. For their particular explicitly specified family, we prove SN(R_k) = k = (d + 1)/2 for every k ≥ 2 using a universal signed-minor identity. We also prove that each R_k generates an extreme ray of the complex Hermitian PPT cone, and obtain exact ranks rank(R_k) = k² + k − 1 and rank(R_k^Γ) = k² + 2k − 3. Local filtering yields extremal trace-preserving PPT channels whose Choi matrices have Schmidt number k and whose partially transposed Choi matrices have Schmidt number two. Their threefold iterates are entanglement breaking by a theorem of Park (2026). The underlying states, their PPT decomposition, and other families with linear Schmidt-number growth were established in earlier work; the results here concern the specific 2026 grid-state family.
The positive-partial-transpose-squared (PPT-squared) conjecture asks whether the composition of two positive-partial-transpose (PPT) quantum channels must be entanglement breaking (EB). The problem remains open in general and, within the diagonal orthogonal covariant (DOC) class, the first unresolved deterministic dimension is four. A sufficient condition for PPT-squared composition is derived for DOC maps in arbitrary finite dimension. The proof isolates the quantum coherence data into two correlation matrices, mixes each with the identity until it lies in the convex hull of rank-one correlation matrices, and converts the resulting objects into an explicit triplewise completely positive (TCP) core. The remaining contribution is purely classical and is TCP whenever a simple entrywise mixing inequality is satisfied. For PPT DOC maps ΦA,B,CΦ_{A,B,C}ΦA,B,C​ and ΦD,E,FΦ_{D,E,F}ΦD,E,F​ on MdM_dMd​, the entrywise bound (AD)ij≥2⌊d⌋AiiAjjDiiDjj(AD)_{ij}\ge 2\lfloor\sqrt{d}\rfloor\sqrt{A_{ii}A_{jj}D_{ii}D_{jj}}(AD)ij​≥2⌊d​⌋Aii​Ajj​Dii​Djj​​ for all i,ji,ji,j guarantees that ΦA,B,C∘ΦD,E,FΦ_{A,B,C}\circΦ_{D,E,F}ΦA,B,C​∘ΦD,E,F​ is EB. In dimension four the universal coefficient becomes four. A continuous family of bistochastic PPT channels is then constructed; every member with a≠1a\ne1a=1 is not EB, while every pairwise composition within the family is proved to be EB. A rank-sensitive refinement shows explicitly how low coherence rank can improve the universal coefficient. The resulting certificate is sufficient rather than necessary and is complementary to factor-width and semidefinite-hierarchy approaches.