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

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.

Authors

Publication Details

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

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
2 citations
Zenodo (CERN European Organization for Nuclear Research)
Quantum Mechanics and Applications
preprint

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
preprint en
2 citations

Abstract

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.

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