Curator's Take
AI Commentary
This article tackles a long‑standing bottleneck in the Navascués‑Pironio‑Acín (NPA) hierarchy by treating moment selection as a combinatorial optimisation problem and showing that sophisticated search strategies—parallel tempering, an RBM‑based reinforcement learner, and Bayesian optimisation—can dramatically prune the moment set while preserving tightness of the bounds. By achieving near‑optimal performance on the notoriously hard I₃₃₂₂ Bell inequality and extending to all 174 inequalities in the (4,4,2,2) scenario as well as a Heisenberg spin chain, the work demonstrates that larger, more realistic nonlocality and many‑body problems can now be tackled within feasible SDP budgets. The advance dovetails with recent efforts to scale NPA‑type relaxations (e.g., symmetry reduction and tensor‑network embeddings), suggesting that practical device‑independent certification and quantum‑physics optimisation may become routine once the remaining exponential SDP size limits are further mitigated.
— Mark Eatherly
Summary
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.