analiza aiqbench
This paper advances the theoretical understanding of Grothendieck constants by proposing new lower bounds derived from rotationally invariant cubic kernels and numerical optimization. The work connects these mathematical constructs to quantum information theory, specifically suggesting potential applications in certifying local Hilbert-space dimensions for bipartite correlation Bell functionals. By bridging high-dimensional matrix constructions with quantum dimension witnesses, the research offers significant insights into the intersection of operator algebras and quantum foundations.
Heuristic lower bounds on real Grothendieck constants of finite and infinite order
arXiv:2609.35399v1 Announce Type: new 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\pi/16\simeq1.767146$, improving the rigorous lower bound $6\pi/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.
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\pi/16\simeq1.767146$, improving the rigorous lower bound $6\pi/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.
arXiv:2609.35399 [quant-ph]
(or arXiv:2609.35399v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.35399 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 244 cuvinte
Subiecte conexe
Better bounds on finite-order Grothendieck constants
arXiv · 7 oct. 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · 15 aug. 2026

Generalization and infinite width
LessWrong · 1 aug. 2026
A Mike's-Eye View of ARC's Research
AI Alignment Forum · 9 iun. 2026