Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.25462

Sharper Bounds for the Complex Grothendieck Constant

Steven Heilman, Chris Jones, Giulio Malavolta

math.FAcs.DSquant-phSubmitted Sep 21, 2026• Announced Sep 23, 2026
arXivHTMLPDF

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.

AI Summary

The paper addresses bounds on the complex Grothendieck constant $K_G^{\mathbb C}$, which controls the gap between optimization over unit Hilbert-space vectors and over complex phases. It proves $1.4<K_G^{\mathbb C}<1.404898554746$. The upper bound improves Haagerup’s 1987 bound $1.40490913\ldots$ by approximately $1.06\times10^{-5}$. The lower-bound argument gives $K_G^{\mathbb C}>4000/2857\approx1.40007$, improving both the historical bound $1.33807$ and an independently obtained bound $1.355846\ldots$ discussed in the introduction. The upper bound uses two-stage preprocessing and a mixture of six Gaussian rounding kernels. Five branches apply phase rounding after different tensor-space preprocessors; the sixth uses radially perturbed phase functions and conjugation symmetrization. An inverse-repair lemma converts the nearly linear mixed kernel into an exactly linear valid kernel. Its certified slope exceeds $0.71179516600840569540$. For the lower bound, the paper bounds the Gaussian operator norm of $T_n=P_{1,0}-(37/50)P_{2,1}$ uniformly in dimension by $2857/4000<5/7$. The proof combines Hermite decompositions, dimension-independent cubic-chaos moment bounds, and a reduction to scalar potentials with finite optimization certificates. Both bounds rely on analytic reductions followed by rigorous numerical certification; supporting verification code is provided. The exact constant remains unknown, including the conjectured value $1.404575934663742\ldots$. The paper also reports that directly adapting limiting Krivine schemes, which give the best known real-case bounds, did not succeed here.

No sign of AI-generated text

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
21 pages

Related papers

Better bounds on finite-order Grothendieck constants with applications to Bell nonlocality

Sébastien Designolle, Tamás Vértesi, Sebastian Pokutta

Grothendieck constants $K_G(d)$ bound the advantage of $d$-dimensional strategies over $1$-dimensional ones in a specific optimisation task. They have applications ranging from approximation algorithms to quantum nonlocality. However, apart from $d=2$, their values are unknown. Here, we exploit a recent Frank-Wolfe approach to provide good candidates for lower bounding some of these constants. The complete proof relies on solving difficult binary quadratic optimisation problems. For $d\in\{3,4,5\}$, we construct specific rectangular instances that we can solve to certify better bounds than those previously known; by monotonicity, our lower bounds improve on the state of the art for $d\leqslant9$. For $d\in\{4,7,8\}$, we exploit elegant structures to build highly symmetric instances achieving even greater bounds; however, we can only solve them heuristically. We also recall the standard relation with violations of Bell inequalities and elaborate on it to interpret generalised Grothendieck constants $K_G(d\mapsto2)$ as the advantage of complex $d$-dimensional quantum mechanics over real qubit quantum mechanics. Motivated by this connection, we also improve the bounds on $K_G(d\mapsto2)$.

arXiv:2409.03739•Physical Review A•Dec 10, 2025•5 citations

Bell Inequalities, Grothendieck’s Constant, and Root Two

P. C. Fishburn, James A. Reeds

B. S. Tsirelson showed that comparisons between probabilities in “classical” physics and probabilities in quantum mechanics yield discrepancy measures $K_n $ for finite $n \times n$ real matrices that approach Grothendieck’s constant $K_G $ as n gets large. It is known that $K_2 = K_3 = \sqrt{2} $ and that $K_G \geq \pi /2 = 1.57 \cdots $, but examples of $n \times n$ matrices for specified n that demonstrate $K_n > \sqrt{2} $ have eluded researchers. A series of elementary examples are provided, which yield lower bounds on $K_{k ( k - 1 )} $ that approach 3/2 as k gets large. A uniform change along the main diagonal of our basic example shows that $K_{20} \geqq = 10/7 = 1.42 \cdots $.

SIAM Journal on Discrete Mathematics•Feb 1, 1994•43 citations

Quantum quantities near the Grothendieck bound in a single quantum system

Apostol Vourdas

Abstract The Grothendieck theorem considers a ‘classical’ quadratic form <?CDATA ${\mathcal{C}}$?> C that uses complex scalars in the unit disc, and the corresponding ‘quantum’ quadratic form <?CDATA ${\mathcal{Q}}$?> Q that replaces the scalars with vectors in the unit ball of a Hilbert space. It shows that when <?CDATA ${\mathcal{C}}\le 1$?> C ≤ 1 then <?CDATA ${\mathcal{Q}}$?> Q might take values greater than 1, up to the complex Grothendieck constant kG . Previous work in a quantum context, used Grothendieck’s theorem with multipartite entangled systems, in contrast to the present work which uses it for a single quantum system. The emphasis in the paper is in examples with <?CDATA ${\mathcal{Q}}\in (1,{k}_{G})$?> Q ∈ ( 1 , k G ) , which is a classically forbidden region in the sense that <?CDATA ${\mathcal{C}}$?> C cannot take values in it.

Journal of Physics Conference Series•Dec 1, 2023•0 citations

Towards Grothendieck constants and LHV models in quantum mechanics

Bobo Hua, Ming Li, Tinggui Zhang +3 more

Abstract We adopt a continuous model to estimate the Grothendieck constants. An analytical formula to compute the lower bounds of Grothendieck constants has been explicitly derived for arbitrary orders, which improves previous bounds. Moreover, our lower bound of the Grothendieck constant of order three gives a refined bound of the threshold value for the nonlocality of the two-qubit Werner states.

arXiv:1501.05507•Journal of Physics A Mathematical and Theoretical•Jan 21, 2015•28 citations

Grothendieck bound in a single quantum system

Apostol Vourdas

Abstract Grothendieck’s bound is used in the context of a single quantum system, in contrast to previous work which used it for multipartite entangled systems and the violation of Bell-like inequalities. Roughly speaking the Grothendieck theorem considers a ‘classical’ quadratic form C that uses complex numbers in the unit disc, and takes values less than 1. It then proves that if the complex numbers are replaced with vectors in the unit ball of the Hilbert space, then the ‘quantum’ quadratic form Q might take values greater than 1, up to the complex Grothendieck constant k G . The Grothendieck theorem is reformulated here in terms of arbitrary matrices (which are multiplied with appropriate normalisation prefactors), so that it is directly applicable to quantum quantities. The emphasis in the paper is in the ‘Grothendieck region’ ( 1 , k G ) , which is a classically forbidden region in the sense that C cannot take values in it. Necessary (but not sufficient) conditions for Q taking values in the Grothendieck region are given. Two examples that involve physical quantities in systems with six and 12-dimensional Hilbert space, are shown to lead to Q in the Grothendieck region ( 1 , k G ) . They involve projectors of the overlaps of novel generalised coherent states that resolve the identity and have a discrete isotropy.

arXiv:2212.11663•Journal of Physics A Mathematical and Theoretical•Oct 27, 2022•6 citations

The Grothendieck Constant is Strictly Larger than Davie-Reeds' Bound

Chris Jones, Giulio Malavolta

The Grothendieck constant $K_{G}$ is a fundamental quantity in functional analysis, with important connections to quantum information, combinatorial optimization, and the geometry of Banach spaces. Despite decades of study, the value of $K_{G}$ is unknown. The best known lower bound on $K_{G}$ was obtained independently by Davie and Reeds in the 1980s. In this paper we show that their bound is not optimal. We prove that $K_{G} \ge K_{DR} + 10^{-12}$, where $K_{DR}$ denotes the Davie-Reeds lower bound. Our argument is based on a perturbative analysis of the Davie-Reeds operator. We show that every near-extremizer for the Davie-Reeds problem has $Ω(1)$ weight on its degree-3 Hermite coefficients, and therefore introducing a small cubic perturbation increases the integrality gap of the operator.

math.FACross-listedarXiv:2603.30039•Apr 1, 2026
We show that 1.4<KGC<1.4048985547461.4<K_G^{\mathbb{C}}<1.4048985547461.4<KGC​<1.404898554746, where KGCK_G^{\mathbb{C}}KGC​ is the complex Grothendieck constant. The upper bound improves on Haagerup's bound of 1.40490913…1.40490913\ldots1.40490913… from 1987, and the lower bound improves on Davie's bound of 1.338071.338071.33807 from 1984. The upper bound combines ideas from the real and noncommutative complex cases of Grothendieck's inequality.
The paper addresses bounds on the complex Grothendieck constant KGCK_G^{\mathbb C}KGC​, which controls the gap between optimization over unit Hilbert-space vectors and over complex phases. It proves 1.4<KGC<1.4048985547461.4<K_G^{\mathbb C}<1.4048985547461.4<KGC​<1.404898554746. The upper bound improves Haagerup’s 1987 bound 1.40490913…1.40490913\ldots1.40490913… by approximately 1.06×10−51.06\times10^{-5}1.06×10−5. The lower-bound argument gives KGC>4000/2857≈1.40007K_G^{\mathbb C}>4000/2857\approx1.40007KGC​>4000/2857≈1.40007, improving both the historical bound 1.338071.338071.33807 and an independently obtained bound 1.355846…1.355846\ldots1.355846… discussed in the introduction.
The upper bound uses two-stage preprocessing and a mixture of six Gaussian rounding kernels. Five branches apply phase rounding after different tensor-space preprocessors; the sixth uses radially perturbed phase functions and conjugation symmetrization. An inverse-repair lemma converts the nearly linear mixed kernel into an exactly linear valid kernel. Its certified slope exceeds 0.711795166008405695400.711795166008405695400.71179516600840569540.
For the lower bound, the paper bounds the Gaussian operator norm of Tn=P1,0−(37/50)P2,1T_n=P_{1,0}-(37/50)P_{2,1}Tn​=P1,0​−(37/50)P2,1​ uniformly in dimension by 2857/4000<5/72857/4000<5/72857/4000<5/7. The proof combines Hermite decompositions, dimension-independent cubic-chaos moment bounds, and a reduction to scalar potentials with finite optimization certificates.
Both bounds rely on analytic reductions followed by rigorous numerical certification; supporting verification code is provided. The exact constant remains unknown, including the conjectured value 1.404575934663742…1.404575934663742\ldots1.404575934663742…. The paper also reports that directly adapting limiting Krivine schemes, which give the best known real-case bounds, did not succeed here.
Grothendieck constants KG(d)K_G(d)KG​(d) bound the advantage of ddd-dimensional strategies over 111-dimensional ones in a specific optimisation task. They have applications ranging from approximation algorithms to quantum nonlocality. However, apart from d=2d=2d=2, their values are unknown. Here, we exploit a recent Frank-Wolfe approach to provide good candidates for lower bounding some of these constants. The complete proof relies on solving difficult binary quadratic optimisation problems. For d∈{3,4,5}d\in\{3,4,5\}d∈{3,4,5}, we construct specific rectangular instances that we can solve to certify better bounds than those previously known; by monotonicity, our lower bounds improve on the state of the art for d⩽9d\leqslant9d⩽9. For d∈{4,7,8}d\in\{4,7,8\}d∈{4,7,8}, we exploit elegant structures to build highly symmetric instances achieving even greater bounds; however, we can only solve them heuristically. We also recall the standard relation with violations of Bell inequalities and elaborate on it to interpret generalised Grothendieck constants KG(d↦2)K_G(d\mapsto2)KG​(d↦2) as the advantage of complex ddd-dimensional quantum mechanics over real qubit quantum mechanics. Motivated by this connection, we also improve the bounds on KG(d↦2)K_G(d\mapsto2)KG​(d↦2).
B. S. Tsirelson showed that comparisons between probabilities in “classical” physics and probabilities in quantum mechanics yield discrepancy measures $K_n $ for finite n×nn \times nn×n real matrices that approach Grothendieck’s constant $K_G $ as n gets large. It is known that $K_2 = K_3 = \sqrt{2} $ and that $K_G \geq \pi /2 = 1.57 \cdots $, but examples of n×nn \times nn×n matrices for specified n that demonstrate $K_n > \sqrt{2} $ have eluded researchers. A series of elementary examples are provided, which yield lower bounds on $K_{k ( k - 1 )} $ that approach 3/2 as k gets large. A uniform change along the main diagonal of our basic example shows that $K_{20} \geqq = 10/7 = 1.42 \cdots $.
Abstract The Grothendieck theorem considers a ‘classical’ quadratic form <?CDATA C{\mathcal{C}}C?> C that uses complex scalars in the unit disc, and the corresponding ‘quantum’ quadratic form <?CDATA Q{\mathcal{Q}}Q?> Q that replaces the scalars with vectors in the unit ball of a Hilbert space. It shows that when <?CDATA C≤1{\mathcal{C}}\le 1C≤1?> C ≤ 1 then <?CDATA Q{\mathcal{Q}}Q?> Q might take values greater than 1, up to the complex Grothendieck constant kG . Previous work in a quantum context, used Grothendieck’s theorem with multipartite entangled systems, in contrast to the present work which uses it for a single quantum system. The emphasis in the paper is in examples with <?CDATA Q∈(1,kG){\mathcal{Q}}\in (1,{k}_{G})Q∈(1,kG​)?> Q ∈ ( 1 , k G ) , which is a classically forbidden region in the sense that <?CDATA C{\mathcal{C}}C?> C cannot take values in it.
Abstract Grothendieck’s bound is used in the context of a single quantum system, in contrast to previous work which used it for multipartite entangled systems and the violation of Bell-like inequalities. Roughly speaking the Grothendieck theorem considers a ‘classical’ quadratic form C that uses complex numbers in the unit disc, and takes values less than 1. It then proves that if the complex numbers are replaced with vectors in the unit ball of the Hilbert space, then the ‘quantum’ quadratic form Q might take values greater than 1, up to the complex Grothendieck constant k G . The Grothendieck theorem is reformulated here in terms of arbitrary matrices (which are multiplied with appropriate normalisation prefactors), so that it is directly applicable to quantum quantities. The emphasis in the paper is in the ‘Grothendieck region’ ( 1 , k G ) , which is a classically forbidden region in the sense that C cannot take values in it. Necessary (but not sufficient) conditions for Q taking values in the Grothendieck region are given. Two examples that involve physical quantities in systems with six and 12-dimensional Hilbert space, are shown to lead to Q in the Grothendieck region ( 1 , k G ) . They involve projectors of the overlaps of novel generalised coherent states that resolve the identity and have a discrete isotropy.
The Grothendieck constant KGK_{G}KG​ is a fundamental quantity in functional analysis, with important connections to quantum information, combinatorial optimization, and the geometry of Banach spaces. Despite decades of study, the value of KGK_{G}KG​ is unknown. The best known lower bound on KGK_{G}KG​ was obtained independently by Davie and Reeds in the 1980s. In this paper we show that their bound is not optimal. We prove that KG≥KDR+10−12K_{G} \ge K_{DR} + 10^{-12}KG​≥KDR​+10−12, where KDRK_{DR}KDR​ denotes the Davie-Reeds lower bound. Our argument is based on a perturbative analysis of the Davie-Reeds operator. We show that every near-extremizer for the Davie-Reeds problem has Ω(1)Ω(1)Ω(1) weight on its degree-3 Hermite coefficients, and therefore introducing a small cubic perturbation increases the integrality gap of the operator.