arxiv: 2604.03700 · v1 · submitted 2026-04-04 · 🧮 math.OC · quant-ph

Recognition: 2 theorem links

· Lean Theorem

Robust self-testing with CHSH mod 3

Igor Klep , Nando Leijenhorst , Victor Magron

Authors on Pith no claims yet

Pith reviewed 2026-05-13 16:42 UTC · model grok-4.3

classification 🧮 math.OC quant-ph

keywords CHSH mod 3Bell inequalityself-testingquantum nonlocalityqutritsrobustnessmaximally entangled states

0 comments

The pith

The CHSH mod 3 Bell inequality reaches its exact maximum quantum value with a unique optimal irreducible strategy on a maximally entangled two-qutrit state.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper computes the precise highest quantum value attainable for the CHSH mod 3 inequality. It proves that, up to unitary equivalence and the inequality's natural symmetries, there is a single optimal irreducible strategy, equivalently realized by four symmetry-related versions, each using a maximally entangled two-qutrit state. The work further establishes a robustness statement: any quantum strategy whose value lies within ε of this maximum must be O(√ε)-close, up to local isometries, to a direct sum of these optimal irreducible strategies. These results supply a concrete self-testing guarantee for a higher-dimensional Bell test.

Core claim

The CHSH mod 3 Bell inequality attains its exact maximal quantum value via unique optimal irreducible strategies that employ a maximally entangled two-qutrit state. There exist four symmetry-related such strategies. Furthermore, strategies with values within ε of this optimum are O(√ε)-close, up to local isometries, to direct sums of the optimal irreducible strategies.

What carries the argument

The CHSH mod 3 Bell inequality together with its optimal irreducible strategies on maximally entangled two-qutrit states, which fix the quantum bound and support the O(√ε) robustness bound under local isometries.

Load-bearing premise

Analysis can be restricted to irreducible strategies, and local isometries suffice to compare any near-optimal strategy to the optimal irreducible ones.

What would settle it

An explicit quantum strategy whose value exceeds the claimed maximum, or a strategy within ε of the maximum whose distance to every direct sum of the described optimal strategies remains larger than C√ε for some constant C.

read the original abstract

The CHSH mod 3 Bell inequality is a natural testbed for higher-dimensional quantum nonlocality, yet its maximal quantum violation and self-testing properties have remained unresolved. We determine its exact maximal quantum value and show that, up to unitary equivalence and the natural symmetries of the inequality, it admits a unique optimal irreducible strategy; equivalently, there are four symmetry-related optimal irreducible strategies. Each of these strategies uses a maximally entangled two-qutrit state. We further prove that any strategy whose value is within $\varepsilon$ of the optimum is $O(\sqrt{\varepsilon})$-close, up to local isometries, to a direct sum of optimal irreducible strategies.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives the exact quantum maximum for CHSH mod 3 plus a robustness self-test, but the uniqueness claim hinges on a complete reduction to irreducibles.

read the letter

This paper determines the exact maximal quantum value of the CHSH mod 3 inequality and establishes self-testing properties for it. Specifically, it shows uniqueness of the optimal irreducible strategies up to symmetry, all based on the maximally entangled two-qutrit state, and proves that near-optimal strategies are O(sqrt(eps))-close to direct sums of those optima via local isometries. What stands out is that this closes a gap left in previous studies of higher-dimensional Bell inequalities. The exact value and the quantitative robustness bound are concrete advances that can feed into device-independent protocols using qutrits. The proofs appear to follow the standard path of analyzing the operator algebra and reducing to irreducible representations. The main thing to watch is the reduction to irreducible strategies. The uniqueness and the closeness bound both depend on every near-optimal strategy being equivalent, after local isometries, to a direct sum of the four symmetry-related optima. If there turn out to be other realizations that do not reduce this way, the claims would apply only to a subset of strategies. The abstract presents it as holding generally, so the paper must contain a complete argument for why no other cases exist. That part will need close scrutiny in review. Overall the work is solid on its own terms and engages honestly with the literature on self-testing. It is aimed at specialists in quantum nonlocality and device-independent cryptography who need precise bounds for qutrit systems. I would bring it to a reading group for the technical details on the robustness proof. It deserves peer review because the results are specific and the topic is active. The editor should send it out even if revisions are needed on the reduction step.

Referee Report

2 major / 1 minor

Summary. The manuscript determines the exact maximal quantum value of the CHSH mod 3 Bell inequality. It proves that, up to unitary equivalence and the inequality's natural symmetries, there exists a unique optimal irreducible strategy (equivalently, four symmetry-related copies), each realized with a maximally entangled two-qutrit state. It further establishes a robustness result: any quantum strategy whose value is within ε of this optimum is O(√ε)-close, up to local isometries, to a direct sum of the optimal irreducible strategies.

Significance. If the central claims hold, the work supplies the first exact resolution of both the quantum bound and self-testing properties for this natural higher-dimensional Bell inequality. The combination of an exact value, uniqueness of the optimal irreducible realizations, and a quantitative robustness bound strengthens the foundation for device-independent protocols that exploit qutrit nonlocality.

major comments (2)

[§4] §4 (uniqueness theorem): the claim that every optimal irreducible strategy is unitarily equivalent to one of the four symmetry-related maximally entangled two-qutrit realizations rests on the reduction to irreducible representations; the manuscript must explicitly rule out the existence of other irreducible operator algebras that attain the same value.
[Theorem 5.1] Theorem 5.1 (robustness bound): the O(√ε) closeness statement is derived under the assumption that any near-optimal strategy decomposes, via local isometries, into a direct sum of the identified optimal irreducible strategies. If this decomposition does not exhaust all possibilities, the quantitative bound fails to apply to the full set of quantum strategies.

minor comments (1)

The abstract refers to 'the optimum' without stating the numerical value; inserting the exact maximal quantum value would improve readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive comments. We address each major comment below, indicating the revisions we will make to strengthen the explicitness of the arguments.

read point-by-point responses

Referee: [§4] §4 (uniqueness theorem): the claim that every optimal irreducible strategy is unitarily equivalent to one of the four symmetry-related maximally entangled two-qutrit realizations rests on the reduction to irreducible representations; the manuscript must explicitly rule out the existence of other irreducible operator algebras that attain the same value.

Authors: We agree that an explicit ruling-out of other irreducible operator algebras strengthens the presentation. The proof in §4 derives algebraic relations from the assumption that the Bell operator attains its maximum value on an irreducible representation; these relations are then shown to be satisfied only by the four symmetry-related maximally entangled two-qutrit realizations. In the revised manuscript we will add a short lemma immediately after the main uniqueness argument that states: any irreducible representation attaining the maximal value must be unitarily equivalent to one of these four. The lemma will collect the derived relations and verify that no other solutions exist within the finite-dimensional operator algebra setting. revision: yes
Referee: [Theorem 5.1] Theorem 5.1 (robustness bound): the O(√ε) closeness statement is derived under the assumption that any near-optimal strategy decomposes, via local isometries, into a direct sum of the identified optimal irreducible strategies. If this decomposition does not exhaust all possibilities, the quantitative bound fails to apply to the full set of quantum strategies.

Authors: The decomposition of any quantum strategy into a direct sum of irreducible strategies (via local isometries) is established in the preliminary sections (following Definition 3.2 and in the proof of Lemma 4.3). Theorem 5.1 then applies the irreducible robustness result componentwise to obtain the O(√ε) bound. To address the concern directly, we will revise the statement of Theorem 5.1 to include an explicit clause referencing the decomposition lemma and expand the proof paragraph that invokes it, making clear that the argument covers all finite-dimensional quantum strategies without additional assumptions. revision: yes

Circularity Check

0 steps flagged

No significant circularity; maximal value and uniqueness derived mathematically

full rationale

The paper computes the exact maximal quantum value of the CHSH mod 3 inequality and proves uniqueness of optimal irreducible strategies (using maximally entangled two-qutrit states) plus the O(√ε) robustness bound via direct analysis of the operator algebra and symmetries. These steps rely on standard techniques for Bell inequalities and do not reduce by construction to fitted parameters, self-definitions, or load-bearing self-citations; the reduction to irreducible strategies is an explicit modeling choice rather than a hidden tautology. The derivation is self-contained against external mathematical benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claims rest on the standard Hilbert-space formulation of quantum mechanics and the definition of Bell inequalities; no free parameters, ad-hoc constants, or new postulated entities are introduced.

axioms (1)

domain assumption Standard quantum mechanics in finite-dimensional Hilbert spaces with projective measurements
The entire analysis of Bell inequalities and self-testing is conducted inside this framework.

pith-pipeline@v0.9.0 · 5403 in / 1271 out tokens · 45412 ms · 2026-05-13T16:42:37.102241+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking echoes

?

echoes
ECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.

We determine its exact maximal quantum value and show that, up to unitary equivalence and the natural symmetries of the inequality, it admits a unique optimal irreducible strategy; ... uses a maximally entangled two-qutrit state.
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

the rounding method of [CdLL24] ... exact sum-of-Hermitian-squares certificate ... Gröbner basis for J

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

40 extracted references · 40 canonical work pages · 1 internal anchor

[1]

write newline

" write newline "" before.all 'output.state := FUNCTION output.nonempty.doi duplicate missing pop "" 'skip if duplicate empty 'pop " doi:" swap * "" * write if FUNCTION output.nonempty.mrnumber duplicate missing pop "" 'skip if duplicate empty 'pop " " swap * " " * write if FUNCTION fin.entry add.period write doi output.nonempty.doi newline INTEGERS namep...

work page
[2]

Jeff Bezanson, Alan Edelman, Stefan Karpinski, and Viral B. Shah. Julia: A Fresh Approach to Numerical Computing . SIAM Review , 59(1):65--98, January 2017. arXiv:1411.1607

work page arXiv 2017
[3]

John S. Bell. On the E instein P odolsky R osen paradox. Physics Physique Fizika , 1(3):195, 1964

work page 1964
[4]

Besche, Bettina Eick, Eamonn O'Brien, and Max Horn

Hans U. Besche, Bettina Eick, Eamonn O'Brien, and Max Horn. SmallGrp , The GAP Small Groups Library , Version 1.5.4, July 2024

work page 2024
[5]

Optimization of Polynomials in Non-Commuting Variables

Sabine Burgdorf, Igor Klep, and Janez Povh. Optimization of Polynomials in Non-Commuting Variables . SpringerBriefs in Mathematics . Springer International Publishing, Cham, 2016. http://link.springer.com/10.1007/978-3-319-33338-0

work page doi:10.1007/978-3-319-33338-0 2016
[6]

Causality and tsirelson's bounds

Harry Buhrman and Serge Massar. Causality and tsirelson's bounds. Physical Review A , 72(5):052103, November 2005. arXiv:quant-ph/0409066

work page arXiv 2005
[7]

Sum-of-squares decompositions for a family of C lauser- H orne- S himony- H olt-like inequalities and their application to self-testing

C\'edric Bamps and Stefano Pironio. Sum-of-squares decompositions for a family of C lauser- H orne- S himony- H olt-like inequalities and their application to self-testing. Phys. Rev. A , 91:052111, May 2015

work page 2015
[8]

Noncommutative Nullstellens\"atze and Perfect Games

Adam Bene Watts, John William Helton, and Igor Klep. Noncommutative Nullstellens\"atze and Perfect Games . Annales Henri Poincar\'e , 24(7):2183--2239, July 2023. arXiv:2111.14928

work page arXiv 2023
[9]

Optimality of spherical codes via exact semidefinite programming bounds

Henry Cohn, David de Laat, and Nando Leijenhorst. Optimality of spherical codes via exact semidefinite programming bounds. http://arxiv.org/abs/2403.16874, March 2024. arXiv:2403.16874

work page arXiv 2024
[10]

Clauser, Michael A

John F. Clauser, Michael A. Horne, Abner Shimony, and Richard A. Holt. Proposed experiment to test local hidden-variable theories. Physical review letters , 23(15):880, 1969

work page 1969
[11]

Rational sums of hermitian squares of free noncommutative polynomials

Kristijan Cafuta, Igor Klep, and Janez Povh. Rational sums of hermitian squares of free noncommutative polynomials. Ars Math. Contemp. , 9(2):243--259, 2015

work page 2015
[12]

A generalization of CHSH and the algebraic structure of optimal strategies

David Cui, Arthur Mehta, Hamoon Mousavi, and Seyed Sajjad Nezhadi. A generalization of CHSH and the algebraic structure of optimal strategies. Quantum , 4:346, October 2020. arXiv:1911.01593

work page arXiv 2020
[13]

Representation Theory , volume 129 of Graduate Texts in Mathematics

William Fulton and Joe Harris. Representation Theory , volume 129 of Graduate Texts in Mathematics . Springer-Verlag, New York, 1991

work page 1991
[14]

Nemo/ Hecke : Computer algebra and number theory packages for the Julia programming language

Claus Fieker, William Hart, Tommy Hofmann, and Fredrik Johansson. Nemo/ Hecke : Computer algebra and number theory packages for the Julia programming language. In ISSAC '17-- Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation , pages 157--164. ACM, New York, 2017. arXiv:1705.06134

work page arXiv 2017
[15]

The NPA hierarchy does not always attain the commuting operator value , 2025

Marco Fanizza, Larissa Kroell, Arthur Mehta, Connor Paddock, Denis Rochette, William Slofstra, and Yuming Zhao. The NPA hierarchy does not always attain the commuting operator value , 2025. arXiv:2510.04943

work page arXiv 2025
[16]

Inverse and stability theorems for approximate representations of finite groups

William Timothy Gowers and Omid Hatami. Inverse and stability theorems for approximate representations of finite groups. Sbornik: Mathematics , 208(12):1784--1817, December 2017. https://www.mathnet.ru/eng/sm8872

work page 2017
[17]

GAP -- Groups , Algorithms , and Programming , Version 4.15.1 , 2025

The GAP Group. GAP -- Groups , Algorithms , and Programming , Version 4.15.1 , 2025. https://www.gap-system.org

work page 2025
[18]

Certifying Optimality of Bell Inequality Violations : Noncommutative Polynomial Optimization through Semidefinite Programming and Local Optimization

Timotej Hrga, Igor Klep, and Janez Povh. Certifying Optimality of Bell Inequality Violations : Noncommutative Polynomial Optimization through Semidefinite Programming and Local Optimization . SIAM Journal on Optimization , 34(2):1341--1373, June 2024. https://epubs.siam.org/doi/10.1137/22M1473340

work page doi:10.1137/22m1473340 2024
[19]

Multi-setting Bell inequality for qudits

Se-Wan Ji, Jinhyoung Lee, James Lim, Koji Nagata, and Hai-Woong Lee. Multi-setting Bell inequality for qudits. Physical Review A , 78(5):052103, November 2008. arXiv:0810.2838

work page arXiv 2008
[20]

MIP*= RE

Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen. MIP*= RE . Communications of the ACM , 64(11):131--138, 2021

work page 2021
[21]

Code and data for `` Robust self-testing with CHSH mod 3 '', April 2026

Igor Klep, Nando Leijenhorst, and Victor Magron. Code and data for `` Robust self-testing with CHSH mod 3 '', April 2026. https://github.com/nanleij/CHSHmod3

work page 2026
[22]

Maximal nonlocality from maximal entanglement and mutually unbiased bases, and self-testing of two-qutrit quantum systems

J e drzej Kaniewski, Ivan S upi \'c , Jordi Tura, Flavio Baccari, Alexia Salavrakos, and Remigiusz Augusiak. Maximal nonlocality from maximal entanglement and mutually unbiased bases, and self-testing of two-qutrit quantum systems. Quantum , 3:198, 2019

work page 2019
[23]

Lasserre

Jean B. Lasserre. Global optimization with polynomials and the problem of moments. SIAM Journal on optimization , 11(3):796--817, 2001

work page 2001
[24]

Solving clustered low-rank semidefinite programs arising from polynomial optimization

Nando Leijenhorst and David de Laat. Solving clustered low-rank semidefinite programs arising from polynomial optimization. Mathematical Programming Computation , 16(3):503--534, September 2024. arXiv:2202.12077

work page arXiv 2024
[25]

Reexamination of a multisetting Bell inequality for qudits

Yeong-Cherng Liang, Chu-Wee Lim, and Dong-Ling Deng. Reexamination of a multisetting Bell inequality for qudits. Physical Review A , 80(5):052116, November 2009. arXiv:0903.4964

work page arXiv 2009
[26]

An introduction to commutative and noncommutative G r \"o bner bases

Teo Mora. An introduction to commutative and noncommutative G r \"o bner bases. Theoretical Computer Science , 134(1):131--173, 1994

work page 1994
[27]

Constant-sized robust self-tests for states and measurements of unbounded dimension

Laura Man c inska, Jitendra Prakash, and Christopher Schafhauser. Constant-sized robust self-tests for states and measurements of unbounded dimension. Communications in Mathematical Physics , 405(9):221, 2024

work page 2024
[28]

Robustly self-testing all maximally entangled states in every finite dimension, 2025

Uta Isabella Meyer, Ivan S upi\'c, Fr\'ed\'eric Grosshans, and Damian Markham. Robustly self-testing all maximally entangled states in every finite dimension, 2025. arXiv:2508.01071

work page arXiv 2025
[29]

Self testing quantum apparatus

Dominic Mayers and Andrew Yao. Self testing quantum apparatus. Quantum Information & Computation , 4(4):273–286, 2004

work page 2004
[30]

A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations

Miguel Navascués, Stefano Pironio, and Antonio Acín. A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations. New Journal of Physics , 10(7):073013, jul 2008

work page 2008
[31]

Certified bounds on optimization problems in quantum theory, 2025

Younes Naceur, Jie Wang, Victor Magron, and Antonio Ac \' n. Certified bounds on optimization problems in quantum theory, 2025. arXiv:2512.17713

work page arXiv 2025
[32]

Helfried Peyrl and Pablo A. Parrilo. Computing sum of squares decompositions with rational coefficients. Theor. Comput. Sci. , 409(2):269--281, 2008

work page 2008
[33]

Reichardt, Falk Unger, and Umesh Vazirani

Ben W. Reichardt, Falk Unger, and Umesh Vazirani. Classical command of quantum systems. Nature , 496(7446):456--460, 2013

work page 2013
[34]

Bell inequalities tailored to maximally entangled states

Alexia Salavrakos, Remigiusz Augusiak, Jordi Tura, Peter Wittek, Antonio Ac \' n, and Stefano Pironio. Bell inequalities tailored to maximally entangled states. Physical review letters , 119(4):040402, 2017

work page 2017
[35]

Self-testing of quantum systems: A review

Ivan S upi \'c and Joseph Bowles. Self-testing of quantum systems: A review. Quantum , 4:337, September 2020. arXiv:1904.10042

work page arXiv 2020
[36]

Linear Representations of Finite Groups

Jean-Pierre Serre. Linear Representations of Finite Groups . Number 42 in Graduate Texts in Mathematics. Springer-Verlag, New York, corr. 5th print edition, 1996

work page 1996
[37]

Self-testing quantum systems of arbitrary local dimension with minimal number of measurements

Shubhayan Sarkar, Debashis Saha, J e drzej Kaniewski, and Remigiusz Augusiak. Self-testing quantum systems of arbitrary local dimension with minimal number of measurements. npj Quantum Information , 7(1):151, 2021

work page 2021
[38]

Semidefinite programming

Lieven Vandenberghe and Stephen Boyd. Semidefinite programming. SIAM review , 38(1):49--95, 1996

work page 1996
[39]

Pauli braiding, 2017

Thomas Vidick. Pauli braiding, 2017. https://raw.githubusercontent.com/vidick/pdfs/master/pauli_braiding_1.pdf

work page 2017
[40]

A more efficient reformulation of complex SDP as real SDP

Jie Wang. A more efficient reformulation of complex SDP as real SDP . Optimization Online , July 2023. arXiv:2307.11599

work page internal anchor Pith review Pith/arXiv arXiv 2023