Quantum Behaviors Are Not Semialgebraic
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 clos...
Description / Details
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.
Source: arXiv:2609.18865v1 - http://arxiv.org/abs/2609.18865v1 PDF: https://arxiv.org/pdf/2609.18865v1 Original Link: http://arxiv.org/abs/2609.18865v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Sep 17, 2026
Quantum Computing
Quantum Physics
0