arXiv:2609.18865
Quantum Behaviors Are Not Semialgebraic
Minbo Gao, Zhengfeng Ji, Chenghua Liu
Abstract
The conditional probabilities achievable by local measurements on a shared quantum state in a Bell scenario form the set of quantum behaviors, whose structure was studied by Tsirelson. In 1993, Tsirelson asked whether this set is semialgebraic, that is, describable by finite Boolean combinations of polynomial equations and inequalities. This question has remained open. We answer it in the negative: with four binary measurements per party, the set of finite-dimensional quantum behaviors, its closure, and the commuting-operator set are all nonsemialgebraic. More strongly, none admits a finite real-analytic description even locally near a particular classical behavior. These results rule out exact finite semidefinite representations and show that no finite level of the Navascués-Pironio-Acín hierarchy characterizes these sets exactly.
AI Summary
The paper addresses Tsirelson’s question of whether quantum behaviors in a fixed Bell scenario admit a finite description by polynomial equalities and inequalities, allowing arbitrary real coefficients. In the bipartite scenario with four binary measurements per party, it proves that the finite-dimensional quantum set, its closure, and the commuting-operator set are all nonsemialgebraic. The proof constructs a quadratic curve of synchronous nonsignaling behaviors $p_\alpha$. For $1<\alpha<2$, membership in any of the three sets holds exactly at $\alpha=2-2/m$, with integers $m\ge3$. Synchrony and a zero-variance identity force four projections to sum to $\alpha I$ on a nonzero invariant subspace. The classification of scalar sums of four projections supplies necessity; explicit projections and label symmetrization give finite-dimensional realizations. The infinite discrete parameter set cannot be semialgebraic. These points accumulate at a classical behavior $p_2$, where none of the three sets admits a finite Boolean description using functions real analytic in a neighborhood. The result excludes finite semialgebraic lifts and exact finite semidefinite representations. Every finite semialgebraic outer approximation, including each NPA level, necessarily accepts an entire tail interval of the curve containing nonquantum points. Exact realization with free shared randomness requires local dimension between $m/\gcd(m,2)$ and $m$. The conclusions concern exact membership on a synchronous boundary slice. No robustness bounds, distances to the quantum set, or quantitative NPA convergence rates are established. The analytic obstruction requires analyticity at the accumulation point and does not exclude general analytic lifts. The four-input threshold is established only within the synchronous binary sector.
Proof development and checking were assisted by OpenAI Codex, as disclosed in the Acknowledgments; the complete arguments are given below.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.