⚛️ quantum physics

An exact semidefinite characterization of the stoquasticity cone of permutationally invariant Bell operators

This paper provides an exact semidefinite characterization of the stoquasticity cone for permutationally invariant Bell operators in the thermodynamic limit by leveraging the fact that their off-diagonal matrix elements correspond to univariate polynomials, thereby reducing the decision problem to a single semidefinite feasibility condition valid for any operator order.

Original authors: Jan Li, Owidiusz Makuta, Evert van Nieuwenburg, Jordi Tura

Published 2026-10-05

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Jan Li, Owidiusz Makuta, Evert van Nieuwenburg, Jordi Tura

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the quantum world, the behavior of a system is often described by a mathematical object called a Hamiltonian, which acts like a map of energy levels. For many years, scientists have been particularly interested in a special class of these maps where the numbers describing how particles interact do not carry confusing positive and negative signs that cancel each other out. When a system lacks these confusing signs, it is much easier to simulate on a computer, because researchers can treat the quantum state as a simple list of probabilities, similar to how one might track the odds of rolling dice. This property, known as stoquasticity, removes a major computational hurdle called the "sign problem," which often makes simulating large groups of quantum particles impossible.

At the same time, physicists are conducting experiments with huge clouds of atoms to test the limits of quantum mechanics. These experiments look for "Bell correlations," strange connections between particles that cannot be explained by classical physics. To find these correlations, researchers use mathematical tools called Bell operators. In recent years, experiments involving hundreds of thousands of atoms have shown that the best quantum states for breaking classical records can be described using these sign-free maps. This means that the most powerful quantum states for these tests happen to be stoquastic. However, figuring out exactly which settings for these experiments produce such states has been a difficult puzzle. For simple cases involving just two particles, the rules were known, but as the complexity of the interactions increased, the number of rules seemed to grow uncontrollably with the size of the atom cloud, making it impossible to write down a complete list of conditions.

A team of researchers has now solved this puzzle for a broad class of these quantum experiments. They discovered that while the rules for determining if a system is sign-free appear to multiply as the number of atoms grows, they actually follow a hidden, smooth pattern. By looking at the problem in the limit of a very large number of particles, the team found that the chaotic collection of thousands of individual rules collapses into a single, elegant condition. Instead of checking a long list of inequalities, one only needs to verify that a specific mathematical curve stays below a certain line. This curve is not just any line; it is a smooth, continuous shape that can be described using a single, precise test.

The researchers showed that this test can be performed using a powerful type of mathematical optimization known as a semidefinite program. Think of this as a sophisticated filter that can instantly tell you whether a set of experimental settings will produce a sign-free system or not. Before this work, scientists had to check a number of conditions that grew larger and larger as they added more atoms, eventually making the task computationally impossible. The new method replaces that growing mountain of checks with a single, manageable calculation that works for any size of the system. This breakthrough means that scientists can now design and verify complex quantum experiments with hundreds of thousands of particles without getting lost in an endless sea of rules.

The team applied this new method to two specific scenarios: systems where particles interact in pairs and systems where they interact in groups of three. For the simpler two-particle case, their method perfectly reproduced the known rules, confirming that their approach was correct. However, for the more complex three-particle case, the method revealed something entirely new. In the past, it was assumed that the boundary between "allowed" and "forbidden" settings was made of flat, straight planes, like the walls of a box. The new analysis showed that for three-particle interactions, this boundary is actually curved, forming a smooth, rounded shape. This curvature is a subtle effect that becomes more pronounced as the number of atoms increases, but it is a real feature that changes how scientists should think about the limits of these quantum systems.

The researchers also calculated how well this new, smooth description works for real-world experiments that involve a finite number of atoms, rather than an infinite number. They found that the approximation is incredibly accurate even for moderate-sized groups of atoms, with errors shrinking rapidly as the group gets larger. For example, in experiments involving nearly half a million atoms, the difference between the new smooth description and the exact, complex reality is vanishingly small. This gives experimentalists a reliable tool to design their setups, knowing that the simple, curved rules they are using are a faithful representation of the complex physics involved.

This work does more than just simplify a calculation; it changes the geometric understanding of these quantum systems. It shows that the space of possible quantum behaviors is not just a jagged collection of flat surfaces, but can have smooth, curved edges. By providing a way to describe these shapes exactly, the researchers have opened the door to designing better quantum experiments and understanding the fundamental limits of quantum correlations. The method is exact and does not rely on guesswork or approximations that might fail later. It stands as a complete description of the problem, turning a seemingly intractable list of conditions into a single, solvable question.

The implications of this discovery extend to the future of quantum computing and simulation. Because the new method is based on a single, efficient test, it allows researchers to explore a much wider range of experimental settings than was previously possible. They can now search for the most powerful quantum states to break classical records, confident that they are not missing any hidden constraints. The team also noted that while their current work focuses on systems where particles can be in two states, the same principles could eventually be applied to more complex systems with three or more states, though those would require more advanced mathematical tools. For now, the solution for the two-state systems provides a solid foundation for the next generation of quantum experiments.

In the end, this paper transforms a problem that seemed to grow infinitely complex into one that is beautifully simple. It demonstrates that nature often hides its complexity behind a smooth surface, waiting for the right perspective to reveal it. By finding that surface, the researchers have given the scientific community a clear map for navigating the landscape of large-scale quantum correlations, ensuring that the path forward is not blocked by an unmanageable number of rules. The work stands as a testament to the power of looking at a problem from a different angle, turning a wall of data into a single, clear insight.

Technical Summary: An Exact Semidefinite Characterization of the Stoquasticity Cone of Permutationally Invariant Bell Operators

Problem Statement
Bell correlations in large atomic ensembles (ranging from hundreds to hundreds of thousands of particles) are often detected using permutationally invariant (PI) Bell operators. A significant observation in this domain is that for many experimentally realized operators, the maximally violating state can be expressed in a basis with non-negative amplitudes. In this basis, the Bell operator is "stoquastic," meaning its off-diagonal matrix elements are real and non-positive. The set of Bell coefficients that render a PI operator stoquastic forms a convex region known as the stoquasticity cone.

Characterizing this cone has been an open problem for operators of order $K \geq 3$ . While the cone for two-body operators ( $K=2$ ) is known to be a polyhedral cone defined by a fixed number of hyperplanes independent of system size $n$ , higher-order operators present a proliferation of constraints. Specifically, the stoquasticity condition requires that every off-diagonal matrix element be non-positive. Since the number of such elements scales with the system size $n$ , the number of linear inequalities defining the cone grows with $n$ , preventing a compact, closed-form description. This growth obstructs the optimization of Bell operators to maximize the quantum-classical gap, as such optimization requires the dual (vertex) description of the cone.

Methodology
The authors leverage the structural properties of PI Bell operators in the symmetric subspace (the largest block of the Hamiltonian). Their approach proceeds in three main stages:

Polynomial Structure of Off-Diagonals: The authors establish that along any specific off-diagonal $d$ (where $d$ is the distance from the main diagonal), the matrix elements $(B)_{k, k+d}$ are not arbitrary but are the values of a single univariate polynomial in the rescaled row index $k$ . Specifically, $(B)_{k, k+d} = \sqrt{f_d(n,k)} h_d(n, k; \vec{\alpha})$ , where $h_d$ is a polynomial of degree at most $K-d$ in $k$ , with coefficients linear in the Bell coefficients $\vec{\alpha}$ .
Thermodynamic Limit Reduction: Instead of checking $O(n)$ discrete inequalities for each off-diagonal, the authors pass to the thermodynamic limit ( $n \to \infty$ ). By substituting $k = (n-d)x$ with $x \in [0, 1]$ , the discrete set of constraints is replaced by the condition that the polynomial $h_d(x, \vec{\alpha})$ must be non-positive for all $x$ in the continuous interval $[0, 1]$ . This reduces the $O(n)$ constraints per off-diagonal to a single continuous condition: $\sup_{x \in [0,1]} h_d(x, \vec{\alpha}) \leq 0$ .
Semidefinite Characterization: The problem of ensuring a univariate polynomial is non-positive on an interval is solved using the Markov–Lukács theorem. This theorem states that a univariate polynomial is non-negative on $[0, 1]$ if and only if it admits a specific sum-of-squares (SOS) decomposition involving positive semidefinite Gram matrices. Consequently, the condition $\sup h_d \leq 0$ is equivalent to the feasibility of a Linear Matrix Inequality (LMI). The stoquasticity cone is thus characterized as a projected spectrahedron (or spectrahedral shadow).

Key Contributions and Results

Exact Semidefinite Formulation: The paper provides an exact semidefinite characterization of the stoquasticity cone for PI Bell operators of any order $K$ in the thermodynamic limit. Unlike multivariate polynomial non-negativity problems which often require a hierarchy of relaxations (Positivstellensatz), the univariate nature of the off-diagonal elements allows for an exact representation with a single semidefinite program (SDP) and no relaxation hierarchy.
Two-Body Case ( $K=2$ ): The method recovers the known result that the two-body stoquasticity cone is a polyhedral cone defined by three hyperplanes, independent of $n$ . This serves as a validation of the approach.
Three-Body Case ( $K=3$ ): For three-body operators, the authors derive a new geometric structure. While the second and third off-diagonals yield linear constraints (hyperplanes), the first off-diagonal yields a quadratic constraint. The boundary of the cone in the interior regime is a quadric cone (a curved boundary), described by a canonical LMI with a single auxiliary variable.
- The authors show that in the strict thermodynamic limit, this curved boundary degenerates into a pair of hyperplanes (a polyhedral shape).
- However, for finite $n$ , the curvature is an $O(1/n)$ effect. The paper quantifies this error, showing that the thermodynamic limit approximation is highly accurate for experimentally relevant system sizes (e.g., $n \approx 5 \times 10^5$ ), with relative deviations scaling as $1/n$ .
Parity and Symmetry: The authors identify a parity property in the limit polynomials: $h^\infty_d(1-x) = (-1)^{K-d} h^\infty_d(x)$ . This symmetry implies that for odd $K-d$ , the off-diagonal constraints degenerate to equality constraints in the strict limit, while for even $K-d$ , they define non-negative polynomials on the interval.

Significance and Claims
The paper claims that this work resolves the "proliferation" of inequalities for many-body PI Bell operators by demonstrating that the apparent complexity is only superficial. The key insight is that the stoquasticity conditions along each off-diagonal are governed by a single univariate polynomial, allowing the entire feasible region to be captured by a single SDP.

Unification: The approach unifies the known polyhedral description of two-body operators with the previously unknown structure of higher-order operators.
Computational Tractability: Deciding whether a Bell operator is stoquastic is reduced to a single semidefinite feasibility problem. Designing stoquastic Bell operators with prescribed properties becomes a semidefinite optimization problem over the cone.
Physical Relevance: The results are directly applicable to current experiments involving large atomic ensembles. The paper quantifies the fidelity of the thermodynamic limit description for finite systems, confirming its utility for analyzing experimental data (e.g., from Bose-Einstein condensates).
Limitations and Future Work: The authors note that while the SDP characterization is exact, the explicit vertex description (extremal rays) of the cone for $K \geq 3$ remains an open problem. Furthermore, extending this framework to qutrit systems (spin-1) is identified as a harder problem because the symmetric sector becomes two-dimensional, leading to multivariate polynomials where exact SOS representation is not generally possible without hierarchies.

In summary, the paper provides a rigorous, exact, and computationally efficient framework for analyzing the stoquasticity of permutationally invariant Bell operators, transforming a problem with constraints scaling linearly with system size into a fixed-size semidefinite program.

Technical Summary: An Exact Semidefinite Characterization of the Stoquasticity Cone of Permutationally Invariant Bell Operators

More like this