Companion to the preprint “A Qubit–Qutrit Equivalence for Centrally Symmetric Two-Query Quantum Correlations” (doi:10.5281/zenodo.24093433), which proved that for two fixed binary measurements without shared randomness, a qutrit is never better than a qubit at reproducing centrally symmetric target tables. This note settles two questions left open there. Approximately symmetric targets (two queries). If a qutrit fits a table with worst-cell error ε₃, a sharp qubit pair fits it with error at most ε₃ + δ/2, where δ measures the asymmetry of the table. The constant is proved to be best possible. Three queries. The equivalence fails. Every qubit triple of binary measurements satisfies a simple inequality I ≤ 9, which follows from an identity on 3×3 correlation matrices. A triple of projective qutrit measurements reproduces an eight-point centrally symmetric table exactly with I ≥ 9.0505, so every qubit needs worst-cell error larger than 9.7×10⁻⁴ on it. This is a computer-assisted proof based on exact rational certificates, checked by two independent programs. The qutrit advantage is small: about 10⁻³ in worst-cell error. Numerically, the best qutrit value found is I* = 9.0507284088558548…. A candidate minimal polynomial of degree 13 is reported, confirmed to 3000 digits. Its symbolic derivation and the global optimality of I* remain open, and are labelled as numerical findings. Files: the preprint (PDF), and a reproducibility archive (ZIP) with all exact certificates, the original scripts, an independent audit, the full research record including failed and superseded runs, and a SHA-256 manifest. Quick check after unpacking: python3 -I audit/verify_certificates.py . (pure Python, about 1 s). Not peer reviewed. A large language model assisted with derivations, computations, certificate scripts and drafting; the author takes full responsibility for the content.
Companion to the preprint “A Qubit–Qutrit Equivalence for Centrally Symmetric Two-Query Quantum Correlations” (doi:10.5281/zenodo.24093433), which proved that for two fixed binary measurements without shared randomness, a qutrit is never better than a qubit at reproducing centrally symmetric target tables. This note settles two questions left open there. Approximately symmetric targets (two queries). If a qutrit fits a table with worst-cell error ε₃, a sharp qubit pair fits it with error at most ε₃ + δ/2, where δ measures the asymmetry of the table. The constant is proved to be best possible. Three queries. The equivalence fails. Every qubit triple of binary measurements satisfies a simple inequality I ≤ 9, which follows from an identity on 3×3 correlation matrices. A triple of projective qutrit measurements reproduces an eight-point centrally symmetric table exactly with I ≥ 9.0505, so every qubit needs worst-cell error larger than 9.7×10⁻⁴ on it. This is a computer-assisted proof based on exact rational certificates, checked by two independent programs. The qutrit advantage is small: about 10⁻³ in worst-cell error. Numerically, the best qutrit value found is I* = 9.0507284088558548…. A candidate minimal polynomial of degree 13 is reported, confirmed to 3000 digits. Its symbolic derivation and the global optimality of I* remain open, and are labelled as numerical findings. Files: the preprint (PDF), and a reproducibility archive (ZIP) with all exact certificates, the original scripts, an independent audit, the full research record including failed and superseded runs, and a SHA-256 manifest. Quick check after unpacking: python3 -I audit/verify_certificates.py . (pure Python, about 1 s). Not peer reviewed. A large language model assisted with derivations, computations, certificate scripts and drafting; the author takes full responsibility for the content.
Third note in a series on qubit–qutrit equivalence for centrally symmetric prepare-and-measure correlations (doi:10.5281/zenodo.24093433, doi:10.5281/zenodo.24121836). Setting: fixed binary measurements, no shared randomness, and tables of antipodal pairs of target expectation vectors. The question: by how much must a qutrit table be shrunk before a qubit can reproduce it? Proved: A qubit reproduces such a table exactly if and only if it factors through 3-dimensional real space with all rows and columns in the unit ball. With at most three queries this is the condition γ₂(T) ≤ 1 on the factorization norm, a single semidefinite program. Every qutrit table has γ₂(T) ≤ 2/√3, while the same argument gives exactly 1 for qubits. The worst-case factor κ(n) never decreases with the number of queries n. For three queries, γ₂(T)² ≥ I(T)/9, where I ≤ 9 is the qubit inequality of the previous note. Averaging a core over relabellings of the measurements can never raise the shrink factor. Certified in exact rational arithmetic (computer-assisted): κ(3) ≥ 1.002813276 and κ(4) ≥ 1.007479. For a fixed rational reference triple A*, close to the numerically best symmetric triple, the shrink factor lies in [1.002813276, 1.00281429]. The upper bound uses a new second-order covering of the direction sphere. Conjectured (not proved): κ(3) = √(I*)/3 = 1.0028142848…, and the worst triple is cyclically symmetric. No numerical search found a larger value. The note explains why the obvious proof strategies fail. Files: the preprint (PDF), and a reproducibility archive (ZIP) with five preregistered research stages, including failed and stopped runs, all certificates, and a SHA-256 manifest. After unpacking, two pure-Python exact checks reproduce the certificates in about 20 s, without any numerical solver. They check the certificates, not the surrounding proofs. Not peer reviewed. A large language model assisted with derivations, computations, certificate scripts and drafting; the author takes full responsibility for the content.
We establish a qubit–qutrit equivalence for centrally symmetric prepare-and-measure correlations involving two fixed binary queries and no shared randomness between preparation and measurement devices. For arbitrary pairs of Hermitian contractions on a three-dimensional Hilbert space, we prove a spectral-domination result that implies the following: any centrally symmetric family of target expectation pairs approximable by two binary POVMs on a qutrit, within a common compact convex centrally symmetric tolerance, is equally approximable using two fixed projective measurements on a qubit. As an exact consequence, for the four rectangular targets (±a, ±b), the optimal worst-cell total-variation error in dimensions two and three is ε₂ = ε₃ = max{0, [a + b − √(2 − (a − b)²)] / 4}, whereas dimension four permits exact reproduction. In particular, a qutrit with arbitrary binary POVMs cannot improve upon the optimal qubit worst-case success probability of (1 + 1/√2)/2 for the 2-to-1 random-access code without shared randomness. The proof uses spectral subspace intersection in dimension three and does not require the measurement operators to possess common reducing subspaces. Explicit counterexamples establish the importance of the dimensional and operational assumptions. The results provide a mathematical characterization of quantum carrier-dimension constraints, with applications to prepare-and-measure correlations and operationally recoverable historical information. Status: Research preprint, prepared for independent peer review. Not peer-reviewed. Reproducibility: Supplementary proofs, exact symbolic certificates, verification scripts and a SHA-256 manifest accompany the manuscript.
Unrefereed research candidate. Two results on complementary (mutually unbiased) measurements and the complementary quantum correlation (CQC) inequality of Schneeloch, Broadbent and Howell (2014), which proposed that the classical correlations in two complementary measurement tables never exceed the quantum mutual information. 1. Sharp qutrit discrimination. For every pair of complementary bases of a qutrit and every two orthogonal states, the triangular discrimination summed over the two bases is at most 8/3 (the trivial ceiling is 4), answering Qian, arXiv:2608.14806v2, Section 11(4). Every equality case is classified; for the computational and Fourier bases they are tied to the nine Hesse SIC rays. Consequences: choosing one of the two measurements at random recovers at most two thirds of the quantum Fisher information in a two-state estimation task, and Qian's two-ray qubit-qutrit family obeys CQC with margin at least 0.1005 nats. The proof is computer-assisted: an exact rational sum-of-squares certificate (scout_qutrit/exact_sos_certificate.json, 660,609 bytes, SHA-256 825bb8108096d38a44f63f1bc91964405d189ad57b5f568530b5d8e27d598c2f) checked by a standalone exact verifier; this deposit is the certificate's citable locator. 2. Every prescribed pair fails for a qubit and a qudit of dimension n ≥ 4. For every prescribed pair of complementary measurements on each side there is a separable state violating CQC, with a uniform certified margin below −9/20,000,000 nats (previously the every-pair statement was known only for n ≥ 164). A phase-averaging extension of the known shared-label mechanism covers every prescribed pair when both dimensions are at least three; an earlier, unchecked every-pair statement for equal dimensions by E. O'Connor is credited. Open: the full qubit-qutrit CQC question and the sharp constant in dimension 5 (numerics only). The margins are tiny and structural, not experimental. The archive contains the manuscript (PDF and LaTeX), the exact certificate and verifier, negative controls, an exact rational margin checker, numerical cross-checks, working proof notes, novelty audits, the bibliography with registry records, CI and SHA-256 sums. Assurance: computer-assisted exact rational arithmetic, not a formal proof; internal AI-assisted review only (not human peer review or independent reproduction). Creator: Anonymous. Text CC0-1.0; code MIT.
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.
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.
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.