arXiv:2609.35399
Heuristic lower bounds on real Grothendieck constants of finite and infinite order
Erika Bene, Tamás Vértesi
Abstract
We propose candidate lower bounds on the real Grothendieck constants $K_{\mathrm G}(d)$ and their infinite-dimensional limit $K_{\mathrm G}$ using rotationally invariant cubic kernels. For the continuous construction, we identify an explicit threshold above which hemispherical binary strategies are unstable under cubic boundary deformations. Supported by numerical evidence, we conjecture that hemispherical strategies are globally optimal at this threshold. This conjecture would imply $K_{\mathrm G}\geq9π/16\simeq1.767146$, improving the rigorous lower bound $6π/11\simeq1.713596$. We also construct finite symmetric coefficient matrices from unit vectors in dimensions up to $24$. Large-scale see-saw optimization supports the continuous predictions and suggests improved lower bounds on $K_{\mathrm G}(d)$ in the studied dimensions from $4$ to $24$, conditional on the conjectured binary optima being exact. Selected matrices also yield finite-setting candidate dimension witnesses when interpreted as bipartite correlation Bell functionals. If the corresponding binary upper bounds hold, these witnesses would certify a local Hilbert-space dimension of at least five for each party.
AI Summary
The paper investigates lower bounds on the real Grothendieck constants $K_G(d)$ and $K_G$, which govern quantum-to-classical ratios for correlation Bell inequalities and XOR games. It studies rotationally invariant spherical kernels $k_c(t)=t-ct^3$ and finite matrices obtained by applying these kernels to Gram matrices. For the continuous construction, the generating vectors give an explicit attainable vector value. A boundary-deformation calculation proves that aligned hemispherical binary strategies cease to be locally optimal above $c_*(d)=(d+1)(d+3)/[3(d+5)]$: an opposite harmonic-cubic deformation increases the objective. Global hemispherical optimality up to this threshold is conjectured, not proved. If established, it would yield explicit finite-order lower bounds and $K_G\geq9\pi/16\simeq1.767146$, compared with the cited rigorous lower bound $6\pi/11\simeq1.713596$. Finite discretizations use spherical sampling and lattice shells in dimensions through $24$. Large-scale see-saw searches produce ratios approaching the continuous predictions. A Barnes–Wall construction with $4{,}480{,}320$ settings per party gives a candidate ratio $1.68204729$. Selected finite matrices would also certify Schmidt number at least five, using $K_G(7)\leq1.649646$, if sufficiently strong binary upper bounds were certified. The numerical searches provide feasible binary values, hence lower—not upper—bounds on the classical optimum. Consequently, the reported ratios are candidate lower bounds, and the dimension witnesses remain conditional. The local calculation neither excludes globally superior strategies below the threshold nor resolves higher-order stability at the threshold.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 21 pages, 2 figures, 3 tables