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:2502.10746 · Entropy

NPA Hierarchy and Extremal Criterion in the Simplest Bell Scenario

Satoshi Ishizaka

Published Feb 9, 2025• 1 citation
arXivHTMLPDF

Abstract

It is difficult to establish an analytical criterion to identify the boundaries of quantum correlations, even for the simplest Bell scenario. Here, we briefly reviewed the plausible analytical criterion, and we found a way to confirm the extremal conditions from another direction. For that purpose, we analyzed the Navascués-Pironio-Acín (NPA) hierarchy to study the algebraic structure and found that the problem could not be simplified using the 1+AB level. However, considering the plausible criterion, the 1+AB and second levels for correlations were equal, and the extremal condition in the simplest Bell scenario was replaced by that in the 1+AB level. Thus, the correctness of the plausible criterion was verified, and the results demonstrated that the plausible criterion held, thereby explaining its simplicity. It seemed plausible, but now it becomes more certain.

DOI
10.3390/e27020182

Related papers

Two convergent NPA-like hierarchies for the quantum bilocal scenario

Marc-Olivier Renou, Xiangling Xu, Laurens T. Ligthart

Characterising the correlations that arise from locally measuring a single part of a joint quantum system is one of the main problems of quantum information theory. The seminal work [M. Navascués et al., New J. Phys. 10, 073013 (2008)], known as the Navascués–Pironio–Acín (NPA) hierarchy, reformulated this question as a polynomial optimisation problem over noncommutative variables and proposed a convergent hierarchy of necessary conditions, each testable using semidefinite programming. More recently, the problem of characterising the quantum network correlations, which arise when locally measuring several independent quantum systems distributed in a network, has received considerable interest. Several generalisations of the NPA hierarchy, such as the scalar extension [A. Pozas-Kerstjens et al., Phys. Rev. Lett. 123, 140503 (2019)], were introduced while their converging sets remain unknown. In this work, we introduce a new bilocal factorisation NPA hierarchy, prove its equivalence to a modified bilocal scalar extension NPA hierarchy, and characterise its convergence in the case of the simplest network, the bilocal scenario. We further explore its relations with the other known generalisations.

arXiv:2210.09065•Journal of Mathematical Physics•Jan 1, 2026•13 citations

Almost-quantum correlations and their refinements in a tripartite Bell scenario

James Vallins, Ana Belén Sainz, Yeong-Cherng Liang

We study the set of almost-quantum correlations and their refinements in the simplest tripartite Bell scenario where each party is allowed to perform two dichotomic measurements. In contrast to its bipartite counterpart, we find that there already exist facet Bell inequalities that witness almost-quantum correlations beyond quantum theory in this simplest tripartite Bell scenario. Furthermore, we study the relation between the almost-quantum set and the hierarchy of supersets to the quantum set due to Navascu\'es-Pironio-Ac\'{\i}n (NPA) [Phys. Rev. Lett. 98, 010401 (2007)]. While the former lies between the first and the third level of the NPA hierarchy, we find that its second level does not contain and is not contained within the almost-quantum set. Finally, we investigate the hierarchy of refinements to the almost-quantum set due to Moroder et al. [Phys. Rev. Lett. 111, 030501 (2013)], which converges to the set of quantum correlations producible by quantum states having positive partial transposition. This allows us to consider (approximations of) the ``biseparable'' subsets of the almost-quantum set as well as of the quantum set of correlations, and thereby gain further insights into the subtle similarities and differences between the two sets. In addition, they allow us to identify candidate Bell-like inequalities that can serve as device-independent witnesses for genuine tripartite entanglement.

arXiv:1608.05641•Physical Review A•Feb 10, 2017•13 citations

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

Necessary and sufficient criterion for extremal quantum correlations in the simplest Bell scenario

Satoshi Ishizaka

In the study of quantum nonlocality, one obstacle is that the analytical criterion for identifying the boundaries between quantum and postquantum correlations has not yet been given, even in the simplest Bell scenario. We propose a plausible, analytical, necessary and sufficient condition ensuring that a nonlocal quantum correlation in the simplest scenario is an extremal boundary point. Our extremality condition amounts to certifying an information-theoretical quantity; the probability of guessing a measurement outcome of a distant party optimized using any quantum instrument. We show that this quantity can be upper and lower bounded from any correlation in a device-independent way, and we use numerical calculations to confirm that coincidence of the upper and lower bounds appears to be necessary and sufficient for the extremality.

arXiv:1712.08419•Physical Review A•May 18, 2018•13 citations

Exact Identification of Quantum Correlations in the Minimal Bell Scenario

Liang-Liang Sun, Jie Wang, Sixia Yu

Bell nonlocality places the long-standing philosophical disputes over the nature of quantum theory on a mathematically rigorous, experimentally testable footing, positioning quantum mechanics between local realism and the most general no-signaling theories. Yet the precise quantum boundary has remained elusive even in the minimal Bell scenario, where the extreme points generating the set are known. Here we characterize this boundary through a computable necessary and sufficient criterion: a correlation is quantum if and only if it can be decomposed into an extreme quantum correlation and a classical correlation. The criterion follows from our proof that every Bell functional exhibiting quantum advantage admits a unique quantum maximizer. We further classify the finitely many maximal-face structures containing each nonlocal exposed point according to their local deterministic vertices. By sharply distinguishing physically realizable correlations from nonphysical ones, these results resolve a long-standing open problem and provide a new foundation for identifying the principles underlying quantum theory and determining the ultimate information-theoretic limits of quantum correlations.

quant-pharXiv:2610.34364•Oct 27, 2026•1 citation

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
It is difficult to establish an analytical criterion to identify the boundaries of quantum correlations, even for the simplest Bell scenario. Here, we briefly reviewed the plausible analytical criterion, and we found a way to confirm the extremal conditions from another direction. For that purpose, we analyzed the Navascués-Pironio-Acín (NPA) hierarchy to study the algebraic structure and found that the problem could not be simplified using the 1+AB level. However, considering the plausible criterion, the 1+AB and second levels for correlations were equal, and the extremal condition in the simplest Bell scenario was replaced by that in the 1+AB level. Thus, the correctness of the plausible criterion was verified, and the results demonstrated that the plausible criterion held, thereby explaining its simplicity. It seemed plausible, but now it becomes more certain.
Characterising the correlations that arise from locally measuring a single part of a joint quantum system is one of the main problems of quantum information theory. The seminal work [M. Navascués et al., New J. Phys. 10, 073013 (2008)], known as the Navascués–Pironio–Acín (NPA) hierarchy, reformulated this question as a polynomial optimisation problem over noncommutative variables and proposed a convergent hierarchy of necessary conditions, each testable using semidefinite programming. More recently, the problem of characterising the quantum network correlations, which arise when locally measuring several independent quantum systems distributed in a network, has received considerable interest. Several generalisations of the NPA hierarchy, such as the scalar extension [A. Pozas-Kerstjens et al., Phys. Rev. Lett. 123, 140503 (2019)], were introduced while their converging sets remain unknown. In this work, we introduce a new bilocal factorisation NPA hierarchy, prove its equivalence to a modified bilocal scalar extension NPA hierarchy, and characterise its convergence in the case of the simplest network, the bilocal scenario. We further explore its relations with the other known generalisations.
We study the set of almost-quantum correlations and their refinements in the simplest tripartite Bell scenario where each party is allowed to perform two dichotomic measurements. In contrast to its bipartite counterpart, we find that there already exist facet Bell inequalities that witness almost-quantum correlations beyond quantum theory in this simplest tripartite Bell scenario. Furthermore, we study the relation between the almost-quantum set and the hierarchy of supersets to the quantum set due to Navascu\'es-Pironio-Ac\'{\i}n (NPA) [Phys. Rev. Lett. 98, 010401 (2007)]. While the former lies between the first and the third level of the NPA hierarchy, we find that its second level does not contain and is not contained within the almost-quantum set. Finally, we investigate the hierarchy of refinements to the almost-quantum set due to Moroder et al. [Phys. Rev. Lett. 111, 030501 (2013)], which converges to the set of quantum correlations producible by quantum states having positive partial transposition. This allows us to consider (approximations of) the ``biseparable'' subsets of the almost-quantum set as well as of the quantum set of correlations, and thereby gain further insights into the subtle similarities and differences between the two sets. In addition, they allow us to identify candidate Bell-like inequalities that can serve as device-independent witnesses for genuine tripartite entanglement.
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.
In the study of quantum nonlocality, one obstacle is that the analytical criterion for identifying the boundaries between quantum and postquantum correlations has not yet been given, even in the simplest Bell scenario. We propose a plausible, analytical, necessary and sufficient condition ensuring that a nonlocal quantum correlation in the simplest scenario is an extremal boundary point. Our extremality condition amounts to certifying an information-theoretical quantity; the probability of guessing a measurement outcome of a distant party optimized using any quantum instrument. We show that this quantity can be upper and lower bounded from any correlation in a device-independent way, and we use numerical calculations to confirm that coincidence of the upper and lower bounds appears to be necessary and sufficient for the extremality.
Bell nonlocality places the long-standing philosophical disputes over the nature of quantum theory on a mathematically rigorous, experimentally testable footing, positioning quantum mechanics between local realism and the most general no-signaling theories. Yet the precise quantum boundary has remained elusive even in the minimal Bell scenario, where the extreme points generating the set are known. Here we characterize this boundary through a computable necessary and sufficient criterion: a correlation is quantum if and only if it can be decomposed into an extreme quantum correlation and a classical correlation. The criterion follows from our proof that every Bell functional exhibiting quantum advantage admits a unique quantum maximizer. We further classify the finitely many maximal-face structures containing each nonlocal exposed point according to their local deterministic vertices. By sharply distinguishing physically realizable correlations from nonphysical ones, these results resolve a long-standing open problem and provide a new foundation for identifying the principles underlying quantum theory and determining the ultimate information-theoretic limits of quantum correlations.
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.