aiqbench analysis
This paper refines the theoretical bounds of the complex Grothendieck constant, a fundamental parameter in functional analysis with direct implications for quantum information theory and optimization algorithms. By tightening these limits, the research advances our understanding of non-commutative structures that underpin certain quantum protocols and complexity classes.
Sharper Bounds for the Complex Grothendieck Constant
arXiv:2609.25462v1 Announce Type: cross Abstract: We show that $1.4<K_G^{\mathbb{C}}<1.404898554746$, where $K_G^{\mathbb{C}}$ is the complex Grothendieck constant. The upper bound improves on Haagerup's bound of $1.40490913\ldots$ from 1987, and the lower bound improves on Davie's bound of $1.33807$ from 1984. The upper bound combines ideas from the real and noncommutative complex cases of Grothendieck's inequality.
Abstract:We show that $1.4<K_G^{\mathbb{C}}<1.404898554746$, where $K_G^{\mathbb{C}}$ is the complex Grothendieck constant. The upper bound improves on Haagerup's bound of $1.40490913\ldots$ from 1987, and the lower bound improves on Davie's bound of $1.33807$ from 1984. The upper bound combines ideas from the real and noncommutative complex cases of Grothendieck's inequality.
Functional Analysis (math.FA); Data Structures and Algorithms (cs.DS); Quantum Physics (quant-ph)
arXiv:2609.25462 [math.FA]
(or arXiv:2609.25462v1 [math.FA] for this version)
https://doi.org/10.48550/arXiv.2609.25462 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.
Full text under the publisher's open licence · 151 words
Related coverage
Better bounds on finite-order Grothendieck constants
arXiv · Oct 7, 2026
Explicit Separations for One-Query Unitary Synthesis
arXiv · Jul 30, 2026
Tight Sample Complexity Bounds for Entropic Best Policy Identification
arXiv · Sep 23, 2026
Quantum Speedups for Stochastic Optimization with Heavy-Tailed Noise
arXiv · Jul 29, 2026