Answers are grounded in this paper and cite their sources.
Seventh note in the QMEM series on qubit-versus-qutrit antipodal tables. Preprint, version 1; not peer reviewed. An antipodal table records the expectation values of n fixed binary measurements on m pairs of states with opposite values, without shared randomness. Its factorization norm γ₂ is a factorization-based measure of possible qutrit–qubit separation. The condition γ₂ ≤ 1 is necessary for qubit reproducibility and sufficient when the table has at most three rows or at most three columns. For larger tables, γ₂ > 1 certifies a separation, while γ₂ ≤ 1 does not exclude one. The constant κ is the supremum of γ₂ over all qutrit antipodal tables. Main results: Universal bound. Every qutrit antipodal table satisfies γ₂ < 1.058972, improving the previous bound √5/2 ≈ 1.118034. Consequently, 1.007479 ≤ κ < 1.058972. A simpler closed-form bound is γ₂ ≤ 3/(2√2) ≈ 1.060660. Reference states. If all measurements annihilate a state whose largest eigenvalue is at most s (½ ≤ s < 1), then γ₂² ≤ 3/2 − 1/(4s), for arbitrary numbers of pairs and measurements. Every mixture of the pairs' averages is annihilated by those measurements. At s = ½, the bound gives γ₂ ≤ 1, excluding any separation detectable by γ₂; this applies, for example, whenever the table contains an orthogonal pure pair. The underlying pointwise inequality is sharp. Distinguishability and overlap. The pair distinguishability c introduced in Note 6 satisfies c ≤ 1 − tr(ρ⁺ρ⁻) ≤ 4‖σ‖(1 − ‖σ‖) when ‖σ‖ ≥ ½, where σ is the pair's average and ‖σ‖ denotes its largest eigenvalue. Common averages in every dimension. A table whose pairs all share the same average satisfies γ₂ ≤ 1 in any finite dimension, for arbitrary numbers of pairs and measurements. Any excess of γ₂ above one therefore requires pairs with different averages. Coupled certificates. A general factorization bound couples the measurement constraints through the span of all pair averages and encompasses the certificates of Notes 5 and 6. On the certified separating tables of Note 3, a one-parameter family of coupled certificates produces upper bounds within approximately 0.002 of the certified lower bounds. The note is self-contained: Appendix A proves the two results from Note 6 needed for the universal bound. The accompanying reproducibility archive includes proof audits, verification scripts, numerical results, preregistration records, and SHA-256 manifests. The computational checks supplement, but do not replace, the mathematical proofs.
No takes yet. Share an insight, caveat, or question.
Vasily Psykovsky (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: