Noncommutative Nullstellensätze and Perfect Games

The foundations of classical Algebraic Geometry and Real Algebraic Geometry are the Nullstellensatz and Positivstellensatz. Over the last two decades the basic analogous theorems for matrix and operator theory (noncommutative variables) have emerged. This paper concerns commuting operator strategies for nonlocal games, recalls NC Nullstellensatz which are helpful, extends these, and applies them to a very broad collection of games. In the process it brings together results spread over different literatures, hence rather than being terse, our style is fairly expository. The main results of this paper are two characterizations, based on Nullstellensatz, which apply to games with perfect commuting operator strategies. The first applies to all games and reduces the question of whether or not a game has a perfect commuting operator strategy to a question involving left ideals and sums of squares. Previously, Paulsen and others translated the study of perfect synchronous games to problems entirely involving a ∗-algebra. The characterization we present is analogous, but works for all games. The second characterization is based on a new Nullstellensatz we derive in this paper. It applies to a class of games we call torically determined games, special cases of which are XOR and linear system games. For these games we show the question of whether or not a game has a perfect commuting operator strategy reduces to instances of the subgroup membership problem and, for linear systems games, we further show this subgroup membership characterization is equivalent to the standard characterization of perfect commuting operator strategies in terms of solution groups. Both the general and torically determined games characterizations are amenable to computer algebra techniques, which we also develop. For context we mention that Positivstellensätze are behind the standard NPA upper bound on the score players can achieve for a game using a commuting operator strategy. This paper develops analogous NC real algebraic geometry which bears on perfect games. University of Waterloo. adam.benewatts1@uwaterloo.ca University of California San Diego. helton@math.ucsd.edu University of Ljubljana, Slovenia igor.klep@fmf.uni-lj.si 1 ar X iv :2 11 1. 14 92 8v 2 [ qu an tph ] 1 D ec 2 02 1

[1]  Hamoon Mousavi,et al.  A generalization of CHSH and the algebraic structure of optimal strategies , 2019 .

[2]  Igor Klep,et al.  Connes' embedding conjecture and sums of hermitian squares , 2008 .

[3]  Igor Klep,et al.  Rational sums of hermitian squares of free noncommutative polynomials , 2015, Ars Math. Contemp..

[4]  J. Helton,et al.  A noncommutative real nullstellensatz corresponds to a noncommutative real ideal: Algorithms , 2011, 1105.4150.

[5]  Pablo A. Parrilo,et al.  Computing sum of squares decompositions with rational coefficients , 2008 .

[6]  Travis B. Russell A synchronous NPA hierarchy with applications , 2021, 2105.01555.

[7]  Igor Klep,et al.  The truncated tracial moment problem , 2010, 1001.3679.

[8]  William Slofstra,et al.  Perfect Commuting-Operator Strategies for Linear System Games , 2016, 1606.02278.

[9]  Stephanie Wehner,et al.  The Quantum Moment Problem and Bounds on Entangled Multi-prover Games , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[10]  K. Schmüdgen,et al.  Unbounded Induced Representations of ∗-Algebras , 2008, 0806.2428.

[11]  A. Winter,et al.  Perfect Strategies for Non-Local Games , 2018, Mathematical Physics, Analysis and Geometry.

[12]  Vern I. Paulsen,et al.  A synchronous game for binary constraint systems , 2017, 1707.01016.

[14]  R. F. Werner,et al.  Tsirelson's Problem , 2008, 0812.4305.

[15]  M. Junge,et al.  Connes' embedding problem and Tsirelson's problem , 2010, 1008.1142.

[16]  William Slofstra,et al.  Tsirelson’s problem and an embedding theorem for groups arising from non-local games , 2016, Journal of the American Mathematical Society.

[17]  T. Fritz TSIRELSON'S PROBLEM AND KIRCHBERG'S CONJECTURE , 2010, 1008.1168.

[18]  J. William Helton,et al.  3XOR Games with Perfect Commuting Operator Strategies Have Perfect Tensor Product Strategies and are Decidable in Polynomial Time , 2020, ArXiv.

[19]  A. Acín,et al.  A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations , 2008, 0803.4290.

[20]  Simone Severini,et al.  Estimating quantum chromatic numbers , 2014, 1407.6918.

[21]  Matthew Satriano,et al.  Algebras, Synchronous Games and Chromatic Numbers of Graphs , 2017, 1703.00960.

[22]  Igor Klep,et al.  Constrained trace-optimization of polynomials in freely noncommuting variables , 2016, J. Glob. Optim..

[23]  David A. Cox,et al.  Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics) , 2007 .

[24]  J. William Helton,et al.  On real one-sided ideals in a free algebra , 2012, 1208.4837.

[25]  Edward L. Green,et al.  Multiplicative Bases, Gröbner Bases, and Right Gröbner Bases , 2000, J. Symb. Comput..

[26]  Alexander Barvinok,et al.  A course in convexity , 2002, Graduate studies in mathematics.