Classical Trits with Imperfect Antipodality: A Noise Bound via CHSH, a Rank-Two Reduction, and an Improved Lower Bound on the Qutrit Constant

Antipodal tables come from pairs of states on which every measurement gives opposite expectation values; their factorization norm γ₂ is at most one for qubits and for classical trits, and exceeds one for qutrits. Real data are only approximately antipodal. The eighth note of this series conjectured that a classical trit whose data have antipodality defect ε satisfies γ₂² ≤ 1 + ε/(4(1−ε)), and the ninth note replaced the conjecture by a computer-assisted proof for one witness. The conjecture remains open. Here we prove, for all tables, a bound whose excess is at most four times the conjectured one: every classical-trit table with defect ε < 1/2, independent devices and any numbers of responses and pairs has γ₂² ≤ 1/(1−ε), that is, γ₂² − 1 ≤ ε/(1−ε). The proof has three short steps. (i) A pigeonhole argument on the three outcomes shows that every 2×2 classical-trit table has CHSH value at most 2 + 4ε. (ii) Among 2×2 tables with entries in [−1, 1] and CHSH value at most 2 + t, the largest γ₂² is exactly 4/(4 − t); the proof checks the vertices of this polytope. (iii) For every real matrix of rank at most two, γ₂ is attained on a 2×2 submatrix; classical-trit tables have rank at most two. This is the real case of a theorem of Drury, who showed that complex matrices of rank at most two attain γ₂ on a 2×3 or 3×2 submatrix; for real matrices it also follows from Drury’s theorem together with the two-row description of quantum correlators by Thinh, Varvitsiotis and Cai, and we give a direct proof. Alternating linear-programming searches consistently attain the candidate CHSH value 2 + 3ε − 2ε², whose global optimality remains unproved; if the constant in (i) can be lowered to 3, as these searches suggest, the bound becomes 4/(4 − 3ε), which is the limit of this route. The sharp conjecture needs more than the CHSH value. As a consequence, every antipodal witness yields a rigorous noise threshold against classical trits without further computation. We also report a certified lower bound κ ≥ 251883/250000 = 1.007532 on the qutrit constant, a classical-trit certificate for its witness at defect 1/400, which gives the rigorous visibility threshold 0.9925233, and a five-dimensional search consistent with the additivity conjecture κ²_{d+2} = κ²_d + 1. Version 2: Theorem 5 is credited as the real case of Drury’s theorem (Linear Algebra Appl. 280 (1998), Theorem 4.1), with added references; no other result, proof or number has changed. The reproducibility archive (Psykovsky_2026_NoiseCHSH_ESM_v2.zip) contains preregistrations with SHA-256 hashes, proofs, scripts, all run logs (including crashed and stopped runs), certificates, branch-and-bound trees, exact verifier outputs, an independent review of Theorem 5, and a pre-deposit audit (72/72 checks passed from a fresh unzip).

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-14
DOI
https://doi.org/10.5281/zenodo.24214620
Primary Topic
Quantum Mechanics and Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Classical Trits with Imperfect Antipodality: A Noise Bound via CHSH, a Rank-Two Reduction, and an Improved Lower Bound on the Qutrit Constant

Vasily Psykovsky
Zenodo (CERN European Organization for Nuclear Research)
Quantum Mechanics and Applications
preprint

Classical Trits with Imperfect Antipodality: A Noise Bound via CHSH, a Rank-Two Reduction, and an Improved Lower Bound on the Qutrit Constant

Vasily Psykovsky
preprint en

Abstract

Antipodal tables come from pairs of states on which every measurement gives opposite expectation values; their factorization norm γ₂ is at most one for qubits and for classical trits, and exceeds one for qutrits. Real data are only approximately antipodal. The eighth note of this series conjectured that a classical trit whose data have antipodality defect ε satisfies γ₂² ≤ 1 + ε/(4(1−ε)), and the ninth note replaced the conjecture by a computer-assisted proof for one witness. The conjecture remains open. Here we prove, for all tables, a bound whose excess is at most four times the conjectured one: every classical-trit table with defect ε < 1/2, independent devices and any numbers of responses and pairs has γ₂² ≤ 1/(1−ε), that is, γ₂² − 1 ≤ ε/(1−ε). The proof has three short steps. (i) A pigeonhole argument on the three outcomes shows that every 2×2 classical-trit table has CHSH value at most 2 + 4ε. (ii) Among 2×2 tables with entries in [−1, 1] and CHSH value at most 2 + t, the largest γ₂² is exactly 4/(4 − t); the proof checks the vertices of this polytope. (iii) For every real matrix of rank at most two, γ₂ is attained on a 2×2 submatrix; classical-trit tables have rank at most two. This is the real case of a theorem of Drury, who showed that complex matrices of rank at most two attain γ₂ on a 2×3 or 3×2 submatrix; for real matrices it also follows from Drury’s theorem together with the two-row description of quantum correlators by Thinh, Varvitsiotis and Cai, and we give a direct proof. Alternating linear-programming searches consistently attain the candidate CHSH value 2 + 3ε − 2ε², whose global optimality remains unproved; if the constant in (i) can be lowered to 3, as these searches suggest, the bound becomes 4/(4 − 3ε), which is the limit of this route. The sharp conjecture needs more than the CHSH value. As a consequence, every antipodal witness yields a rigorous noise threshold against classical trits without further computation. We also report a certified lower bound κ ≥ 251883/250000 = 1.007532 on the qutrit constant, a classical-trit certificate for its witness at defect 1/400, which gives the rigorous visibility threshold 0.9925233, and a five-dimensional search consistent with the additivity conjecture κ²_{d+2} = κ²_d + 1. Version 2: Theorem 5 is credited as the real case of Drury’s theorem (Linear Algebra Appl. 280 (1998), Theorem 4.1), with added references; no other result, proof or number has changed. The reproducibility archive (Psykovsky_2026_NoiseCHSH_ESM_v2.zip) contains preregistrations with SHA-256 hashes, proofs, scripts, all run logs (including crashed and stopped runs), certificates, branch-and-bound trees, exact verifier outputs, an independent review of Theorem 5, and a pre-deposit audit (72/72 checks passed from a fresh unzip).

Zenodo (CERN European Organization for Nuclear Research)
Quantum Mechanics and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon