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.18865

Quantum Behaviors Are Not Semialgebraic

Minbo Gao, Zhengfeng Ji, Chenghua Liu

quant-phmath-phSubmitted Sep 16, 2026• Announced Sep 17, 2026• 0 citations
arXivHTMLPDF

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.

No sign of AI-generated textAI use disclosed
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.

Related papers

No Finite NPA Level Characterizes the Complete Quantum Set in the Simplest Bell Scenario

Anubhav Chaturvedi

The Navascués--Pironio--Acín (NPA) hierarchy gives the standard semidefinite outer approximations to quantum behaviors. Whether \emph{any} finite level can already equal the quantum set has remained open even in the bipartite scenario with two binary measurements per party. We demonstrate that \emph{no finite level} is exact. For the symmetric doubly tilted CHSH functional $h_α=A_0B_0+A_0B_1+A_1B_0-A_1B_1+α(A_0+B_0)$, set $T=1-α$. Its quantum maximum satisfies $[ω_{\rm Q}(1-T)-(4-2T)]/T^3\to4/3$, whereas every fixed NPA level satisfies $[ω_L(1-T)-ω_{\rm Q}(1-T)]/T^3\to+\infty$. Under the corresponding boundary rescaling, an explicit expectation of the positive operator $ω_{\rm Q}(1-t^2)I-H_t$ converges to the Motzkin polynomial. A bounded fixed-level error would therefore make the Motzkin polynomial plus a nonnegative constant a sum of squares, which is impossible. Consequently, every standard NPA relaxation based on a fixed finite list of words in the measurement projectors strictly contains the complete quantum set, and its nonquantum behaviors accumulate at a local deterministic behavior. Thus, the finite-level exactness of CHSH and all one-sided tilted CHSH maxima does not extend to an exact finite-level description of the complete quantum set in the minimal scenario.

quant-pharXiv:2607.14569•Physical Review Letters•Jul 17, 2026•2 citations

An operational characterization of finite-dimensional quantum theory

Lionel J. Dmello, Xiangling Xu, Marc-Olivier Renou +1 more

A key goal in the foundations of quantum mechanics is to identify operational constraints characterizing physical theories. Bell inequalities do so for classical probability theory, while Tsirelson's bound provides a first step for quantum mechanics. Here, we address the dual question: Can one certify that all correlations predicted by quantum theory are actually realizable? In this work, we construct a finite number of two-body correlations such that the only probabilistic theory that (1) realizes them, and (2) does so in a way that is stable under iterated teleportation, is quantum theory. For $n$ quantum systems of dimension $d$ each, Condition (1) can be verified using $\operatorname{poly}(d,n)$ measurement settings. Condition (2) may be understood as a hierarchy of tests, one for each number $N$ of teleportation steps. There is thus a sense in which finite-dimensional quantum theory can be self-tested. In particular, one can certify the existence of Bell inequality violations larger than any that have been directly observed.

quant-pharXiv:2610.03694•Oct 5, 2026•0 citations

An Unbounded Separation of Almost-Quantum and Commuting-Operator Correlations in Zero-Error Communication

Rafiuddin Gazi, Biswadeep Chatterjee, Jayashree Karmakar +3 more

Almost-quantum correlations form the $\mathtt{1+AB}$ level of the Navascués--Pironio--Acín hierarchy. They strictly contain the quantum set, are characterized by a single semidefinite program, arise in Sorkin's quantum measure theory, and satisfy several principles proposed to single out quantum theory. We show that they are nevertheless unboundedly stronger than quantum correlations in a zero-error communication task. Alice and Bob receive labels $s,t\in[N]$, $N\ge3$; after one bit from Alice, Bob must decide whether $s=t$, never erring but allowed to abstain. For every model of quantum correlations, from finite-dimensional tensor products to commuting operators, the optimal worst-case probability of a conclusive answer is exactly $1/N$, the value attained with shared randomness, so the bound does not depend on the resolution of Tsirelson's problem. An explicit family of almost-quantum correlations attains $1/19$ for every $N$. For certificates of equality from binary-outcome boxes, we solve the underlying semidefinite programs in closed form. The almost-quantum optimum equals $N^2/(17N^2-80N+64)$ for $N\ge8$ and tends to $1/17$. The first level of the hierarchy, which coincides with the set singled out by macroscopic locality, attains $N/[8(N-2)]$, which tends to $1/8$; its optimal boxes lie outside the almost-quantum set for every $N\ge5$. For longer messages, entanglement saves at most one bit over shared randomness, whereas almost-quantum correlations reduce the one-way zero-error cost of deciding equality of $n$-bit strings from $n$ bits to at most $13$. The quantum bound also yields a linear witness of post-quantumness on a face of the nonsignalling polytope.

quant-pharXiv:2610.41448•Nov 2, 2026•1 citation

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

Miguel Navascués, Stefano Pironio, Antonio Acín

We are interested in the problem of characterizing the correlations that arise when performing local measurements on separate quantum systems. In a previous work (Navascués et al 2007 Phys. Rev. Lett. 98 010401), we introduced an infinite hierarchy of conditions necessarily satisfied by any set of quantum correlations. Each of these conditions could be tested using semidefinite programming. We present here new results concerning this hierarchy. We prove in particular that it is complete, in the sense that any set of correlations satisfying every condition in the hierarchy has a quantum representation in terms of commuting measurements. Although our tests are conceived to rule out non-quantum correlations, and can in principle certify that a set of correlations is quantum only in the asymptotic limit where all tests are satisfied, we show that in some cases it is possible to conclude that a given set of correlations is quantum after performing only a finite number of tests. We provide a criterion to detect when such a situation arises, and we explain how to reconstruct the quantum states and measurement operators reproducing the given correlations. Finally, we present several applications of our approach. We use it in particular to bound the quantum violation of various Bell inequalities.

arXiv:0803.4290•New Journal of Physics•Jul 8, 2008•789 citations

Moment Optimization in the Navascués-Pironio-Acín Hierarchy

Francesco Flora, Losel Matos, Tim Heightman +3 more

The Navascués-Pironio-Acín (NPA) hierarchy provides a convergent sequence of semidefinite programming (SDP) relaxations for noncommutative polynomial optimisation, ubiquitous in quantum physics. However, its practical applicability is limited by the combinatorial growth in operator moments required at each level. Since not all moments contribute equally to bound tightness, selecting moments within a fixed computational budget is a relevant problem. We reframe moment selection as combinatorial subset selection and show it is governed by strong higher-order synergistic interactions among moments, quantified through a marginal synergy diagnostic adapted from complex systems theory. We develop and compare three optimisation methods: Parallel Tempering (PT), an RBM-based reinforcement learning policy, and Bayesian Optimisation (BO). On the $I_{3322}$ Bell inequality benchmark, all three substantially outperform greedy approaches at costs around two orders of magnitude below brute force, with the RBM achieving the closest approach to optimal throughout the hard transition regime. We apply the framework to the 174 Bell inequalities in the $(4,4,2,2)$ scenario, finding heterogeneous convergence behaviour across inequalities, and to the one-dimensional Heisenberg spin chain, demonstrating that physically motivated monomial bases are internally compressible and are not globally optimal in general. A budget-aware search over a broader pool improves certified bounds on long-range correlations by nearly two orders of magnitude. These results establish a scalable framework for moment selection in noncommutative polynomial optimisation, with broad applications across quantum physics and quantum information.

quant-pharXiv:2607.14755•Jul 17, 2026•2 citations

Four and a Half Axioms for Finite Dimensional Quantum Mechanics

Alexander Wilce

I discuss a set of strong, but probabilistically intelligible, axioms from which one can {\em almost} derive the appratus of finite dimensional quantum theory. Stated informally, these require that systems appear completely classical as restricted to a single measurement, that different measurements, and likewise different pure states, be equivalent (up to the action of a compact group of symmetries), and that every state be the marginal of a bipartite non-signaling state perfectly correlating two measurements. This much yields a mathematical representation of measurements and states that is already very suggestive of quantum mechanics. In particular, in any theory satisfying these axioms, measurements can be represented by orthonormal subsets of, and states, by vectors in, an ordered real Hilbert space -- in the quantum case, the space of Hermitian operators, with its usual tracial inner product. One final postulate (a simple minimization principle, still in need of a clear interpretation) forces the positive cone of this space to be homogeneous and self-dual and hence, to be the the state space of a formally real Jordan algebra. From here, the route to the standard framework of finite-dimensional quantum mechanics is quite short.

arXiv:0912.5530•Dec 30, 2009•41 citations
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.
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αp_\alphapα​. For 1<α<21<\alpha<21<α<2, membership in any of the three sets holds exactly at α=2−2/m\alpha=2-2/mα=2−2/m, with integers m≥3m\ge3m≥3. Synchrony and a zero-variance identity force four projections to sum to αI\alpha Iα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 p2p_2p2​, 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)m/\gcd(m,2)m/gcd(m,2) and mmm.
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.
The Navascués--Pironio--Acín (NPA) hierarchy gives the standard semidefinite outer approximations to quantum behaviors. Whether \emph{any} finite level can already equal the quantum set has remained open even in the bipartite scenario with two binary measurements per party. We demonstrate that \emph{no finite level} is exact. For the symmetric doubly tilted CHSH functional hα=A0B0+A0B1+A1B0−A1B1+α(A0+B0)h_α=A_0B_0+A_0B_1+A_1B_0-A_1B_1+α(A_0+B_0)hα​=A0​B0​+A0​B1​+A1​B0​−A1​B1​+α(A0​+B0​), set T=1−αT=1-αT=1−α. Its quantum maximum satisfies [ωQ(1−T)−(4−2T)]/T3→4/3[ω_{\rm Q}(1-T)-(4-2T)]/T^3\to4/3[ωQ​(1−T)−(4−2T)]/T3→4/3, whereas every fixed NPA level satisfies [ωL(1−T)−ωQ(1−T)]/T3→+∞[ω_L(1-T)-ω_{\rm Q}(1-T)]/T^3\to+\infty[ωL​(1−T)−ωQ​(1−T)]/T3→+∞. Under the corresponding boundary rescaling, an explicit expectation of the positive operator ωQ(1−t2)I−Htω_{\rm Q}(1-t^2)I-H_tωQ​(1−t2)I−Ht​ converges to the Motzkin polynomial. A bounded fixed-level error would therefore make the Motzkin polynomial plus a nonnegative constant a sum of squares, which is impossible. Consequently, every standard NPA relaxation based on a fixed finite list of words in the measurement projectors strictly contains the complete quantum set, and its nonquantum behaviors accumulate at a local deterministic behavior. Thus, the finite-level exactness of CHSH and all one-sided tilted CHSH maxima does not extend to an exact finite-level description of the complete quantum set in the minimal scenario.
A key goal in the foundations of quantum mechanics is to identify operational constraints characterizing physical theories. Bell inequalities do so for classical probability theory, while Tsirelson's bound provides a first step for quantum mechanics. Here, we address the dual question: Can one certify that all correlations predicted by quantum theory are actually realizable? In this work, we construct a finite number of two-body correlations such that the only probabilistic theory that (1) realizes them, and (2) does so in a way that is stable under iterated teleportation, is quantum theory. For nnn quantum systems of dimension ddd each, Condition (1) can be verified using poly⁡(d,n)\operatorname{poly}(d,n)poly(d,n) measurement settings. Condition (2) may be understood as a hierarchy of tests, one for each number NNN of teleportation steps. There is thus a sense in which finite-dimensional quantum theory can be self-tested. In particular, one can certify the existence of Bell inequality violations larger than any that have been directly observed.
Almost-quantum correlations form the 1+AB\mathtt{1+AB}1+AB level of the Navascués--Pironio--Acín hierarchy. They strictly contain the quantum set, are characterized by a single semidefinite program, arise in Sorkin's quantum measure theory, and satisfy several principles proposed to single out quantum theory. We show that they are nevertheless unboundedly stronger than quantum correlations in a zero-error communication task. Alice and Bob receive labels s,t∈[N]s,t\in[N]s,t∈[N], N≥3N\ge3N≥3; after one bit from Alice, Bob must decide whether s=ts=ts=t, never erring but allowed to abstain. For every model of quantum correlations, from finite-dimensional tensor products to commuting operators, the optimal worst-case probability of a conclusive answer is exactly 1/N1/N1/N, the value attained with shared randomness, so the bound does not depend on the resolution of Tsirelson's problem. An explicit family of almost-quantum correlations attains 1/191/191/19 for every NNN. For certificates of equality from binary-outcome boxes, we solve the underlying semidefinite programs in closed form. The almost-quantum optimum equals N2/(17N2−80N+64)N^2/(17N^2-80N+64)N2/(17N2−80N+64) for N≥8N\ge8N≥8 and tends to 1/171/171/17. The first level of the hierarchy, which coincides with the set singled out by macroscopic locality, attains N/[8(N−2)]N/[8(N-2)]N/[8(N−2)], which tends to 1/81/81/8; its optimal boxes lie outside the almost-quantum set for every N≥5N\ge5N≥5. For longer messages, entanglement saves at most one bit over shared randomness, whereas almost-quantum correlations reduce the one-way zero-error cost of deciding equality of nnn-bit strings from nnn bits to at most 131313. The quantum bound also yields a linear witness of post-quantumness on a face of the nonsignalling polytope.
We are interested in the problem of characterizing the correlations that arise when performing local measurements on separate quantum systems. In a previous work (Navascués et al 2007 Phys. Rev. Lett. 98 010401), we introduced an infinite hierarchy of conditions necessarily satisfied by any set of quantum correlations. Each of these conditions could be tested using semidefinite programming. We present here new results concerning this hierarchy. We prove in particular that it is complete, in the sense that any set of correlations satisfying every condition in the hierarchy has a quantum representation in terms of commuting measurements. Although our tests are conceived to rule out non-quantum correlations, and can in principle certify that a set of correlations is quantum only in the asymptotic limit where all tests are satisfied, we show that in some cases it is possible to conclude that a given set of correlations is quantum after performing only a finite number of tests. We provide a criterion to detect when such a situation arises, and we explain how to reconstruct the quantum states and measurement operators reproducing the given correlations. Finally, we present several applications of our approach. We use it in particular to bound the quantum violation of various Bell inequalities.
The Navascués-Pironio-Acín (NPA) hierarchy provides a convergent sequence of semidefinite programming (SDP) relaxations for noncommutative polynomial optimisation, ubiquitous in quantum physics. However, its practical applicability is limited by the combinatorial growth in operator moments required at each level. Since not all moments contribute equally to bound tightness, selecting moments within a fixed computational budget is a relevant problem. We reframe moment selection as combinatorial subset selection and show it is governed by strong higher-order synergistic interactions among moments, quantified through a marginal synergy diagnostic adapted from complex systems theory. We develop and compare three optimisation methods: Parallel Tempering (PT), an RBM-based reinforcement learning policy, and Bayesian Optimisation (BO). On the I3322I_{3322}I3322​ Bell inequality benchmark, all three substantially outperform greedy approaches at costs around two orders of magnitude below brute force, with the RBM achieving the closest approach to optimal throughout the hard transition regime. We apply the framework to the 174 Bell inequalities in the (4,4,2,2)(4,4,2,2)(4,4,2,2) scenario, finding heterogeneous convergence behaviour across inequalities, and to the one-dimensional Heisenberg spin chain, demonstrating that physically motivated monomial bases are internally compressible and are not globally optimal in general. A budget-aware search over a broader pool improves certified bounds on long-range correlations by nearly two orders of magnitude. These results establish a scalable framework for moment selection in noncommutative polynomial optimisation, with broad applications across quantum physics and quantum information.
I discuss a set of strong, but probabilistically intelligible, axioms from which one can {\em almost} derive the appratus of finite dimensional quantum theory. Stated informally, these require that systems appear completely classical as restricted to a single measurement, that different measurements, and likewise different pure states, be equivalent (up to the action of a compact group of symmetries), and that every state be the marginal of a bipartite non-signaling state perfectly correlating two measurements. This much yields a mathematical representation of measurements and states that is already very suggestive of quantum mechanics. In particular, in any theory satisfying these axioms, measurements can be represented by orthonormal subsets of, and states, by vectors in, an ordered real Hilbert space -- in the quantum case, the space of Hermitian operators, with its usual tracial inner product. One final postulate (a simple minimization principle, still in need of a clear interpretation) forces the positive cone of this space to be homogeneous and self-dual and hence, to be the the state space of a formally real Jordan algebra. From here, the route to the standard framework of finite-dimensional quantum mechanics is quite short.