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

Classical and Quantum Antipodal Tables in Every Dimension: An Envelope Theorem, the Parity of the Quantum Advantage, and a Rigorous Noise Threshold

Vasily Psykovsky

Published Nov 14, 2026• 0 citations
Publisher

Abstract

Ninth note in the QMEM series on qubit-versus-qutrit antipodal tables. Preprint, version 1; not peer reviewed. This note compares the factorization norms of classical and quantum prepare-and-measure correlations in arbitrary finite dimension. It establishes an envelope theorem, determines the optimal classical constant for antipodal tables in every dimension, identifies an even–odd distinction in the achievable quantum advantage, and provides a computer-assisted noise certificate for the qutrit dimension witness introduced in Note 8. Main results Envelope theorem. For arbitrary pairs of quantum states with average states σₖ and arbitrary binary measurements, the half-difference table D satisfies γ₂(D)² ≤ tr(ω) for every positive semidefinite operator ω dominating all σₖ. The result does not require antipodality. Minimizing tr(ω) gives a semidefinite-programming bound, unifying the common-average theorem and several earlier no-advantage results. If all averages lie in the convex hull of r states, then γ₂(D)² ≤ r. Exact classical constant. Every classical d-level antipodal table satisfies γ₂(D)² ≤ min(v, d − v), where v is the dimension of the span of the measurement response vectors. The bound implies the exact optimal classical constant κ_cl(d) = √⌊d/2⌋, attained in every dimension. The proof combines a rank bound derived from John's ellipsoid theorem, the envelope theorem, and a trace–rank inequality for nonnegative column-stochastic matrices. Parity of the quantum advantage. The optimal quantum and classical constants coincide in every even dimension, where both equal √(d/2). In every odd dimension d = 2r + 1, the quantum squared constant exceeds the classical value r by at least 0.0151. Thus the quantum advantage in this factorization-norm criterion exists precisely in odd dimensions. Dimension witnesses in every dimension. Under the assumption of independent preparation and measurement devices, exactly antipodal data satisfying γ₂(D)² > r exclude quantum systems of dimension at most 2r and classical systems with at most 2r + 1 levels. Such correlations are achievable by quantum systems of dimension 2r + 1. Rigorous noise threshold. For the certified 4 × 8 qutrit witness of Note 8, a branch-and-bound computation with exact-rational verification of every leaf establishes that classical trits with antipodality defect at most 1/100 cannot reach the qubit witness bound. Under the specified depolarising-noise model, the threshold for excluding classical trits therefore equals the rigorous qubit threshold: visibility greater than 0.9925339. This removes the conjectural dependence of the earlier threshold for this particular witness; the general conjecture remains open. Scope and limitations The comparison concerns the factorization norm of antipodal prepare-and-measure data, not a universal advantage of quantum systems for every communication task. Independence of the devices is assumed rather than certified. The noise theorem applies to the specified witness, while the general classical-trit noise conjecture remains unresolved. Reproducibility The accompanying supplementary archive documents the analytical checks, preregistered numerical tests, branch-and-bound trees, exact-rational verification procedures, execution logs, and SHA-256 manifests. The manuscript provides commands for reproducing the computer-assisted theorem. This work builds on established dimension-witness and factorization-norm literature and on the preceding eight notes in the QMEM series.

DOI
10.5281/zenodo.24205718

Related papers

Antipodal Tables as a Quantum Dimension Witness: Blind Spots, a Classical-Trit Theorem and Noise Thresholds

Vasily Psykovsky

Eighth note in the QMEM series on qubit-versus-qutrit antipodal tables. Preprint, version 1; not peer reviewed. This note places the results of the series in the standard prepare-and-measure framework for quantum dimension witnesses. A sender prepares one of m pairs of states, a receiver performs one of n binary measurements, and the observed correlators define a half-difference table D = ½(E⁺ − E⁻), evaluated using linear witnesses and the factorization norm γ₂. Main results Qubit bound. Every qubit strategy satisfies γ₂(D) ≤ 1, even with shared randomness and without assuming antipodal correlations. Dimension versus quantumness. Without the antipodal restriction, qutrits attain γ₂ = 2/√3, for example using four mutually unbiased bases in ℂ³, verified in exact arithmetic. Classical trits attain the same value on a 2 × 2 table. Moreover, shared randomness can transform any strategy into one with antipodal correlations while preserving its half-difference table. Thus antipodality alone does not establish a quantum advantage. Classical-trit theorem. For independent preparation and measurement devices, classical trits satisfy γ₂(D) ≤ 1 on exactly antipodal data, whereas qutrits can exceed this bound. A new exact rational certificate establishes γ₂ ≥ 1.007522, improving the previous lower bound of 1.007479. Together with the universal upper bound proved in Note 7, this gives 1.007522 ≤ κ ≤ 3/(2√2) ≈ 1.058972. Consequently, exactly antipodal correlations with γ₂(D) > 1 exclude qubits and classical trits under the stated independence assumption. Blind spots of dimension witnesses. Previous no-advantage theorems identify configurations in which γ₂(D) cannot exceed one: pairs with a common average state, balanced antipodal pairs, traceless measurements, and measurements annihilating a state whose eigenvalues are all at most ½. Noise robustness. For a classical trit with antipodality defect ε, an explicit construction attains γ₂(D)² = (4 − 3ε)/(4(1 − ε)). The conjecture that this is also the universal upper bound is supported by numerical searches but remains unproved. The witness for exactly antipodal data and its exclusion of qubits under depolarising noise are rigorous. The approximate visibility threshold of 0.993 against classical trits is conditional on the conjecture and the specified noise model. Experimental considerations. Idealised statistical estimates suggest approximately 55,000 trials per setting for a 5σ violation using the certified antipodal table, compared with a visibility threshold of 0.866 and a few hundred trials for a dimension-only test based on mutually unbiased bases. These estimates do not constitute a complete finite-statistics protocol. Device independence is an experimental assumption, not a property certified by the witness. The note builds on established research in prepare-and-measure dimension witnesses, including Gallego et al. (2010), Wehner et al. (2008), Bowles et al. (2014), and Diviánszky et al. (2023). It does not claim priority for the general dimension-witness framework. The accompanying reproducibility archive contains the exact rational certificate, verification scripts, numerical searches, preregistrations, and SHA-256 manifests.

•Nov 13, 2026•2 citations

How Much Can a Qudit Beat a Qubit on Antipodal Tables? A Query-Side Bound, the Qutrit Constant κ ≤ √5/2, and Direct Sums in Higher Dimension

Vasily Psykovsky

Sixth 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 quantum states with opposite expectation values, without shared randomness. A table is exactly reproducible by a qubit if and only if it admits a factorization through ℝ³ with rows and columns in the unit ball. When min(n, m) ≤ 3, this is equivalent to γ₂ ≤ 1. Main results Query-side bound. Every antipodal table on ℂᵈ satisfies γ₂ ≤ maxⱼ √q_d(Aⱼ), for any number of pairs and queries, where q_d(A) = ½ tr(A²) − (tr A)²/[2(d−1)]. The proof uses the spectral inequality q_d(A) ≥ λ_max(A)(−λ_min(A)). Qutrit constant. Every qutrit antipodal table satisfies γ₂ ≤ √5/2 ≈ 1.1180, improving the previous bound 2/√3 ≈ 1.1547. Consequently, 1.007479 ≤ κ ≤ √5/2. The upper bound is optimal within the class of unitarily invariant quadratic certificates, but is not claimed to equal the true value of κ. Direct sums and higher dimensions. For tables on orthogonal blocks with measurement sets closed under negation, the squared factorization norm is additive: γ₂(T₁ ⊞ T₂)² = γ₂(T₁)² + γ₂(T₂)². This establishes the exact constant κ_d = √(d/2) in even dimensions. For odd dimensions d = 2r+1, the bounds are r−1+κ² ≤ κ_d² ≤ r+½−1/(4r). In particular, 1.419511 ≤ κ₅ ≤ 1.541104. Improvements in the qutrit lower bound propagate to every higher odd dimension. Measurements incapable of witnessing a qutrit advantage in the factorization norm. If every qutrit measurement satisfies Q(A) = 2 tr(A²) − (tr A)² ≤ 4, then γ₂ ≤ 1. This includes all traceless Hermitian contractions. For min(n, m) ≤ 3, the resulting table is therefore reproducible by a qubit. The condition explains an earlier numerical observation from Note 3. Two-sided bound. Each prepared state pair receives an explicit distinguishability parameter c_k ≤ 1. It vanishes for identical states and equals 1 − tr(ρ⁺ρ⁻) for pure-state pairs, reaching 1 for orthogonal pure states. The combined preparation-and-measurement bound is γ₂² ≤ (max_k c_k)(max_j Q(A_j)/4), with a further refinement incorporating the pair-side theorem of Note 5. In the regime min(n, m) ≤ 3, a qutrit advantage requires both an unbalanced state pair with c_k > 4/5 and a measurement satisfying Q(A) > 4. The manuscript provides mathematical proofs, numerical checks, and reproducibility materials. Numerical observations are distinguished from proven results, and the remaining gap between the lower and upper bounds on κ is explicitly identified as an open problem.

•Nov 13, 2026•2 citations

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

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).

•Nov 14, 2026•0 citations

A Universal Bound for Qutrit Antipodal Tables: κ ≤ 1.059, Reference States, Common Averages and Coupled Certificates

Vasily Psykovsky

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.

•Nov 13, 2026•2 citations

Balanced Antipodal Qutrit Pairs: Lorentzian Factorization, Qubit Equivalence, and Equality Classification

Vasily Psykovsky

This preprint establishes a Lorentzian factorization theorem for balanced antipodal quantum-state pairs in three-dimensional Hilbert space, with consequences for qubit–qutrit equivalence, prepare-and-measure correlations, and quantum dimension witnesses. We define a pair of qutrit states as balanced when tr(ρ₊ρ₋)² ≤ (1 − tr ρ₊²)(1 − tr ρ₋²). This class includes orthogonal pure-state pairs and pairs with orthogonal supports. Main contributions: Universal factorization theorem. We prove that every prepare-and-measure correlation table generated by balanced qutrit pairs and admissible binary measurements, without shared randomness, satisfies the Euclidean factorization bound γ₂(T) ≤ 1, regardless of the number of pairs or measurement queries. Exact qubit reproducibility. Combining the factorization theorem with an earlier exact qubit criterion, we establish that balanced qutrit configurations are qubit-reproducible whenever there are at most three antipodal pairs or at most three binary queries. In particular, three orthogonal pure-state pairs cannot distinguish a qutrit from a qubit in this setting. Lorentzian geometric construction. The proof uses the quadratic form Q(X) = 2 tr(X²) − (tr X)² on Hermitian 3 × 3 matrices, with signature (8,1). Its dual representation and the spectral inequality −e₂(A) ≤ 1 yield an explicit Euclidean Gram factorization. Unconditional equality classification. We show that every equality configuration of three orthogonal pure-state pairs belongs, up to unitary equivalence, to an embedded-qubit configuration or one of two previously constructed genuinely three-dimensional families: the spin-1 family and the common-vector family. This removes an additional hypothesis required in the preceding note. Reduction of the remaining open problem. We show that any possible three-pair separation can be reduced to configurations containing pure states paired with states of rank at most two, with at least one overlapping pair. We also introduce a semidefinite-programmable certificate whose conjectured universal validity is supported by numerical experiments but remains unproved. The general conjecture that three arbitrary antipodal qutrit state pairs never separate a qutrit from a qubit remains open. The proved results are independent of the numerical investigations. The accompanying reproducibility archive contains preregistered B4h experiments, symbolic and numerical verification scripts, computational results, and SHA-256 manifests. This is the fifth preprint in a research series on qubit–qutrit equivalence, separation, and the geometry of quantum correlations. Status: Research preprint, version 1 (13 November 2026); not peer reviewed.

•Nov 13, 2026•2 citations

When Is a Qutrit Exactly as Good as a Qubit? Three Antipodal Pairs: Reductions, Two Equality Families and a Conditional Classification

Vasily Psykovsky

This preprint investigates when a qutrit offers no operational advantage over a qubit in prepare-and-measure scenarios involving three antipodal pairs of quantum states, fixed binary measurements, and no shared randomness. Previous results establish that two antipodal pairs cannot distinguish qutrits from qubits, whereas four pairs can. The case of three pairs remains open. This fourth note develops structural reductions, explicit equality constructions, and a conditional classification to clarify this boundary. The main contributions are: Finite-query and extremality reductions. We prove that four binary queries suffice to detect any separation involving three antipodal pairs. We show that extreme admissible measurements have at most one eigenvalue strictly inside (−1, 1), and that, for fixed average states, potential separating configurations can be reduced to extreme state pairs. A common-average-state theorem. We prove that when all antipodal pairs share the same average density matrix, every resulting correlation table satisfies the Euclidean factorization bound γ₂ ≤ 1, regardless of the number of pairs or queries. For at most three pairs, this guarantees qubit reproducibility. Two exact equality families. We construct genuinely three-dimensional qutrit configurations that reproduce entire qubit correlation ellipsoids. The first extends spin-1 coherent-state constructions through non-unitary transformations. The second uses state-pair planes sharing a common vector and yields an explicit five-dimensional Euclidean-ball representation for any number of pairs. A conditional structural classification. For three orthogonal pure pairs satisfying an additional algebraic singularity hypothesis, we prove that every configuration belongs, up to unitary equivalence, to an embedded-qubit configuration or one of the two equality families. The proof uses the classification of complex matrix spaces of bounded rank. Reproducible computational investigations. Preregistered numerical studies (B4f and B4g) explore possible three-pair separations, equality configurations, and candidate proof certificates. No separation was found. The studies also identify limitations of fixed-weight Hilbert–Schmidt factorizations and simple Gram-matrix constructions. Open questions. The general conjecture that three antipodal pairs never separate a qutrit from a qubit remains unproved. It is also unknown whether every equality configuration of three orthogonal pure pairs satisfies the algebraic hypothesis required for the classification theorem. Numerical observations are explicitly distinguished from rigorous results. The accompanying reproducibility archive contains symbolic verification scripts, numerical experiments, preregistration records, computational results, and SHA-256 manifests. This is the fourth preprint in a series investigating qubit–qutrit equivalence, separation, and quantum dimension witnesses. Previous preprints: https://doi.org/10.5281/zenodo.24093433 https://doi.org/10.5281/zenodo.24121836 https://doi.org/10.5281/zenodo.24130557 Status: Research preprint; not peer reviewed.

•Nov 12, 2026•2 citations
Ninth note in the QMEM series on qubit-versus-qutrit antipodal tables. Preprint, version 1; not peer reviewed. This note compares the factorization norms of classical and quantum prepare-and-measure correlations in arbitrary finite dimension. It establishes an envelope theorem, determines the optimal classical constant for antipodal tables in every dimension, identifies an even–odd distinction in the achievable quantum advantage, and provides a computer-assisted noise certificate for the qutrit dimension witness introduced in Note 8. Main results Envelope theorem. For arbitrary pairs of quantum states with average states σₖ and arbitrary binary measurements, the half-difference table D satisfies γ₂(D)² ≤ tr(ω) for every positive semidefinite operator ω dominating all σₖ. The result does not require antipodality. Minimizing tr(ω) gives a semidefinite-programming bound, unifying the common-average theorem and several earlier no-advantage results. If all averages lie in the convex hull of r states, then γ₂(D)² ≤ r. Exact classical constant. Every classical d-level antipodal table satisfies γ₂(D)² ≤ min(v, d − v), where v is the dimension of the span of the measurement response vectors. The bound implies the exact optimal classical constant κ_cl(d) = √⌊d/2⌋, attained in every dimension. The proof combines a rank bound derived from John's ellipsoid theorem, the envelope theorem, and a trace–rank inequality for nonnegative column-stochastic matrices. Parity of the quantum advantage. The optimal quantum and classical constants coincide in every even dimension, where both equal √(d/2). In every odd dimension d = 2r + 1, the quantum squared constant exceeds the classical value r by at least 0.0151. Thus the quantum advantage in this factorization-norm criterion exists precisely in odd dimensions. Dimension witnesses in every dimension. Under the assumption of independent preparation and measurement devices, exactly antipodal data satisfying γ₂(D)² > r exclude quantum systems of dimension at most 2r and classical systems with at most 2r + 1 levels. Such correlations are achievable by quantum systems of dimension 2r + 1. Rigorous noise threshold. For the certified 4 × 8 qutrit witness of Note 8, a branch-and-bound computation with exact-rational verification of every leaf establishes that classical trits with antipodality defect at most 1/100 cannot reach the qubit witness bound. Under the specified depolarising-noise model, the threshold for excluding classical trits therefore equals the rigorous qubit threshold: visibility greater than 0.9925339. This removes the conjectural dependence of the earlier threshold for this particular witness; the general conjecture remains open. Scope and limitations The comparison concerns the factorization norm of antipodal prepare-and-measure data, not a universal advantage of quantum systems for every communication task. Independence of the devices is assumed rather than certified. The noise theorem applies to the specified witness, while the general classical-trit noise conjecture remains unresolved. Reproducibility The accompanying supplementary archive documents the analytical checks, preregistered numerical tests, branch-and-bound trees, exact-rational verification procedures, execution logs, and SHA-256 manifests. The manuscript provides commands for reproducing the computer-assisted theorem. This work builds on established dimension-witness and factorization-norm literature and on the preceding eight notes in the QMEM series.
Eighth note in the QMEM series on qubit-versus-qutrit antipodal tables. Preprint, version 1; not peer reviewed. This note places the results of the series in the standard prepare-and-measure framework for quantum dimension witnesses. A sender prepares one of m pairs of states, a receiver performs one of n binary measurements, and the observed correlators define a half-difference table D = ½(E⁺ − E⁻), evaluated using linear witnesses and the factorization norm γ₂. Main results Qubit bound. Every qubit strategy satisfies γ₂(D) ≤ 1, even with shared randomness and without assuming antipodal correlations. Dimension versus quantumness. Without the antipodal restriction, qutrits attain γ₂ = 2/√3, for example using four mutually unbiased bases in ℂ³, verified in exact arithmetic. Classical trits attain the same value on a 2 × 2 table. Moreover, shared randomness can transform any strategy into one with antipodal correlations while preserving its half-difference table. Thus antipodality alone does not establish a quantum advantage. Classical-trit theorem. For independent preparation and measurement devices, classical trits satisfy γ₂(D) ≤ 1 on exactly antipodal data, whereas qutrits can exceed this bound. A new exact rational certificate establishes γ₂ ≥ 1.007522, improving the previous lower bound of 1.007479. Together with the universal upper bound proved in Note 7, this gives 1.007522 ≤ κ ≤ 3/(2√2) ≈ 1.058972. Consequently, exactly antipodal correlations with γ₂(D) > 1 exclude qubits and classical trits under the stated independence assumption. Blind spots of dimension witnesses. Previous no-advantage theorems identify configurations in which γ₂(D) cannot exceed one: pairs with a common average state, balanced antipodal pairs, traceless measurements, and measurements annihilating a state whose eigenvalues are all at most ½. Noise robustness. For a classical trit with antipodality defect ε, an explicit construction attains γ₂(D)² = (4 − 3ε)/(4(1 − ε)). The conjecture that this is also the universal upper bound is supported by numerical searches but remains unproved. The witness for exactly antipodal data and its exclusion of qubits under depolarising noise are rigorous. The approximate visibility threshold of 0.993 against classical trits is conditional on the conjecture and the specified noise model. Experimental considerations. Idealised statistical estimates suggest approximately 55,000 trials per setting for a 5σ violation using the certified antipodal table, compared with a visibility threshold of 0.866 and a few hundred trials for a dimension-only test based on mutually unbiased bases. These estimates do not constitute a complete finite-statistics protocol. Device independence is an experimental assumption, not a property certified by the witness. The note builds on established research in prepare-and-measure dimension witnesses, including Gallego et al. (2010), Wehner et al. (2008), Bowles et al. (2014), and Diviánszky et al. (2023). It does not claim priority for the general dimension-witness framework. The accompanying reproducibility archive contains the exact rational certificate, verification scripts, numerical searches, preregistrations, and SHA-256 manifests.
Sixth 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 quantum states with opposite expectation values, without shared randomness. A table is exactly reproducible by a qubit if and only if it admits a factorization through ℝ³ with rows and columns in the unit ball. When min(n, m) ≤ 3, this is equivalent to γ₂ ≤ 1. Main results Query-side bound. Every antipodal table on ℂᵈ satisfies γ₂ ≤ maxⱼ √q_d(Aⱼ), for any number of pairs and queries, where q_d(A) = ½ tr(A²) − (tr A)²/[2(d−1)]. The proof uses the spectral inequality q_d(A) ≥ λ_max(A)(−λ_min(A)). Qutrit constant. Every qutrit antipodal table satisfies γ₂ ≤ √5/2 ≈ 1.1180, improving the previous bound 2/√3 ≈ 1.1547. Consequently, 1.007479 ≤ κ ≤ √5/2. The upper bound is optimal within the class of unitarily invariant quadratic certificates, but is not claimed to equal the true value of κ. Direct sums and higher dimensions. For tables on orthogonal blocks with measurement sets closed under negation, the squared factorization norm is additive: γ₂(T₁ ⊞ T₂)² = γ₂(T₁)² + γ₂(T₂)². This establishes the exact constant κ_d = √(d/2) in even dimensions. For odd dimensions d = 2r+1, the bounds are r−1+κ² ≤ κ_d² ≤ r+½−1/(4r). In particular, 1.419511 ≤ κ₅ ≤ 1.541104. Improvements in the qutrit lower bound propagate to every higher odd dimension. Measurements incapable of witnessing a qutrit advantage in the factorization norm. If every qutrit measurement satisfies Q(A) = 2 tr(A²) − (tr A)² ≤ 4, then γ₂ ≤ 1. This includes all traceless Hermitian contractions. For min(n, m) ≤ 3, the resulting table is therefore reproducible by a qubit. The condition explains an earlier numerical observation from Note 3. Two-sided bound. Each prepared state pair receives an explicit distinguishability parameter c_k ≤ 1. It vanishes for identical states and equals 1 − tr(ρ⁺ρ⁻) for pure-state pairs, reaching 1 for orthogonal pure states. The combined preparation-and-measurement bound is γ₂² ≤ (max_k c_k)(max_j Q(A_j)/4), with a further refinement incorporating the pair-side theorem of Note 5. In the regime min(n, m) ≤ 3, a qutrit advantage requires both an unbalanced state pair with c_k > 4/5 and a measurement satisfying Q(A) > 4. The manuscript provides mathematical proofs, numerical checks, and reproducibility materials. Numerical observations are distinguished from proven results, and the remaining gap between the lower and upper bounds on κ is explicitly identified as an open problem.
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).
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.
This preprint establishes a Lorentzian factorization theorem for balanced antipodal quantum-state pairs in three-dimensional Hilbert space, with consequences for qubit–qutrit equivalence, prepare-and-measure correlations, and quantum dimension witnesses. We define a pair of qutrit states as balanced when tr(ρ₊ρ₋)² ≤ (1 − tr ρ₊²)(1 − tr ρ₋²). This class includes orthogonal pure-state pairs and pairs with orthogonal supports. Main contributions: Universal factorization theorem. We prove that every prepare-and-measure correlation table generated by balanced qutrit pairs and admissible binary measurements, without shared randomness, satisfies the Euclidean factorization bound γ₂(T) ≤ 1, regardless of the number of pairs or measurement queries. Exact qubit reproducibility. Combining the factorization theorem with an earlier exact qubit criterion, we establish that balanced qutrit configurations are qubit-reproducible whenever there are at most three antipodal pairs or at most three binary queries. In particular, three orthogonal pure-state pairs cannot distinguish a qutrit from a qubit in this setting. Lorentzian geometric construction. The proof uses the quadratic form Q(X) = 2 tr(X²) − (tr X)² on Hermitian 3 × 3 matrices, with signature (8,1). Its dual representation and the spectral inequality −e₂(A) ≤ 1 yield an explicit Euclidean Gram factorization. Unconditional equality classification. We show that every equality configuration of three orthogonal pure-state pairs belongs, up to unitary equivalence, to an embedded-qubit configuration or one of two previously constructed genuinely three-dimensional families: the spin-1 family and the common-vector family. This removes an additional hypothesis required in the preceding note. Reduction of the remaining open problem. We show that any possible three-pair separation can be reduced to configurations containing pure states paired with states of rank at most two, with at least one overlapping pair. We also introduce a semidefinite-programmable certificate whose conjectured universal validity is supported by numerical experiments but remains unproved. The general conjecture that three arbitrary antipodal qutrit state pairs never separate a qutrit from a qubit remains open. The proved results are independent of the numerical investigations. The accompanying reproducibility archive contains preregistered B4h experiments, symbolic and numerical verification scripts, computational results, and SHA-256 manifests. This is the fifth preprint in a research series on qubit–qutrit equivalence, separation, and the geometry of quantum correlations. Status: Research preprint, version 1 (13 November 2026); not peer reviewed.
This preprint investigates when a qutrit offers no operational advantage over a qubit in prepare-and-measure scenarios involving three antipodal pairs of quantum states, fixed binary measurements, and no shared randomness. Previous results establish that two antipodal pairs cannot distinguish qutrits from qubits, whereas four pairs can. The case of three pairs remains open. This fourth note develops structural reductions, explicit equality constructions, and a conditional classification to clarify this boundary. The main contributions are: Finite-query and extremality reductions. We prove that four binary queries suffice to detect any separation involving three antipodal pairs. We show that extreme admissible measurements have at most one eigenvalue strictly inside (−1, 1), and that, for fixed average states, potential separating configurations can be reduced to extreme state pairs. A common-average-state theorem. We prove that when all antipodal pairs share the same average density matrix, every resulting correlation table satisfies the Euclidean factorization bound γ₂ ≤ 1, regardless of the number of pairs or queries. For at most three pairs, this guarantees qubit reproducibility. Two exact equality families. We construct genuinely three-dimensional qutrit configurations that reproduce entire qubit correlation ellipsoids. The first extends spin-1 coherent-state constructions through non-unitary transformations. The second uses state-pair planes sharing a common vector and yields an explicit five-dimensional Euclidean-ball representation for any number of pairs. A conditional structural classification. For three orthogonal pure pairs satisfying an additional algebraic singularity hypothesis, we prove that every configuration belongs, up to unitary equivalence, to an embedded-qubit configuration or one of the two equality families. The proof uses the classification of complex matrix spaces of bounded rank. Reproducible computational investigations. Preregistered numerical studies (B4f and B4g) explore possible three-pair separations, equality configurations, and candidate proof certificates. No separation was found. The studies also identify limitations of fixed-weight Hilbert–Schmidt factorizations and simple Gram-matrix constructions. Open questions. The general conjecture that three antipodal pairs never separate a qutrit from a qubit remains unproved. It is also unknown whether every equality configuration of three orthogonal pure pairs satisfies the algebraic hypothesis required for the classification theorem. Numerical observations are explicitly distinguished from rigorous results. The accompanying reproducibility archive contains symbolic verification scripts, numerical experiments, preregistration records, computational results, and SHA-256 manifests. This is the fourth preprint in a series investigating qubit–qutrit equivalence, separation, and quantum dimension witnesses. Previous preprints: https://doi.org/10.5281/zenodo.24093433 https://doi.org/10.5281/zenodo.24121836 https://doi.org/10.5281/zenodo.24130557 Status: Research preprint; not peer reviewed.