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:2412.08532 · Physical Review A

Bounding large-scale Bell inequalities

Luke Mortimer

Published May 27, 2025• 1 citation
arXivHTMLPDF

Abstract

Bell inequalities are an important tool for studying nonlocality, however, they quickly become computationally intractable as the system size grows. We consider a method for finding an upper bound for the quantum violation of such inequalities by combining the Navascu\'es-Pironio-Ac\'{\i}n (NPA) hierarchy, the method of alternating projections, and a standard memory-efficient optimization algorithm. While our method may not give the tightest upper bound possible, it often does so several orders of magnitude faster than state-of-the-art solvers, with minimal memory usage, thus allowing solutions to problems that would otherwise be intractable. We benchmark using the well-studied ${I}_{3322}$ inequality as well as a more general large-scale randomized inequality ${R}_{xx22}$. For randomized inequalities with 130 inputs either side (a first-level moment matrix of size $261\ifmmode\times\else\texttimes\fi{}261$), our method is $\ensuremath{\sim}100\ifmmode\times\else\texttimes\fi{}$ faster than both mosek and SCS while giving a bound only $\ensuremath{\sim}2%$ above the optimum.

DOI
10.1103/physreva.111.052442

Related papers

Self-testing tilted strategies for maximal loophole-free nonlocality

N. Gigena, Ekta Panwar, Giovanni Scala +3 more

Abstract The degree of experimentally attainable nonlocality, as gauged by the amount of loophole-free violation of Bell inequalities, remains severely limited due to inefficient detectors. We address an experimentally motivated question: Which quantum strategies attain the maximal loophole-free nonlocality in the presence of inefficient detectors? For any Bell inequality and any specification of detection efficiencies, the optimal strategies are those that maximally violate a tilted version of the Bell inequality in ideal conditions. In the simplest scenario, we demonstrate that the quantum strategies that maximally violate the tilted versions of Clauser-Horne-Shimony-Holt inequality are unique up to local isometries. However, self-testing via the standard sum of squares decomposition method turns out to be analytically intractable since even high levels of the Navascués--Pironio--Acín hierarchy are insufficient to saturate the maximum quantum violation of these inequalities. Instead, we utilize a novel Jordan's lemma-based proof technique to obtain robust analytical self-testing statements for the entire family of tilted-Bell inequalities. These results allow us to unveil intriguing aspects of the effect of inefficient detectors and the complexity of characterizing the set of quantum correlations, in the simplest Bell scenario.

arXiv:2405.08743•npj Quantum Information•May 19, 2025•7 citations

Optimizing quantum violation for multipartite facet Bell inequalities

Jin-Fu Chen, Mengyao Hu, Jordi Tura

Nonlocality shapes quantum correlations, revealed through the violation of Bell inequalities. The intersection of all valid Bell inequalities is the so-called local polytope. In multipartite systems, characterizing the local polytope quickly becomes an intractable task as the system size increases. Optimizing Bell inequalities to maximize the ratio between their quantum value and classical bound is key to understanding multipartite nonlocality. We propose a gradient-based method for this optimization. Numerical results indicate that local maxima of this ratio typically correspond to facet Bell inequalities of the local polytope. This enables an iterative search for tight and robust Bell inequalities. Applied to permutation-invariant scenarios, the method provides tight Bell inequalities with large quantum violations and facilitates experimental certification of Bell correlations without full knowledge of the local polytope. Moreover, analytical results of the maximum ratio are derived in the thermodynamic limit.

quant-pharXiv:2511.07523•Nov 12, 2025•0 citations

Optimizing and Certifying Multipartite Permutationally Invariant Bell Inequalities

Jin-Fu Chen, Mengyao Hu, Jordi Tura

Multipartite Bell nonlocality provides a device-independent probe of many-body quantum correlations, but its characterization is limited by the rapid growth of the underlying classical and quantum optimization problems. We develop a scalable method for constructing and certifying permutationally invariant Bell inequalities using only one- and two-body correlators. The construction gives families of inequalities with robust quantum violations for general $m$ measurements as the number of parties $N$ becomes large. To improve robustness against noise, we optimize the ratio of the quantum value to the classical bound for these families in the large-$N$ limit. We then certify the resulting quantum violation using semidefinite programming. For the broad class of Bell inequalities studied here, the infinite-$N$ ratios take simple rational values for finite $m$ and converge to $\coth(1)$ as $m\to\infty$. The optimized inequalities efficiently detect many-body Bell nonlocality with collective measurements, with more measurement settings leading to stronger violations.

quant-pharXiv:2607.08462•Jul 10, 2026•0 citations

Unbounded-input explicit Bell inequalities for general quantum networks

Yao Xiao, Fen-Zhuo Guo, Haifeng Dong +2 more

Quantum nonlocality in networks featuring multiple independent sources underpins large-scale quantum communication and poses fundamental challenges for its characterization. In this work, we construct a family of explicit nonlinear Bell inequalities to verify the nonlocality across the general multi-input quantum networks. The construction of these inequalities relies on the number of leaf nodes, a network parameter that can be identified by a linear-time algorithm. Our approach establishes a structural connection between bipartite full-correlation Bell inequalities and network Bell inequalities, enabling the analytical derivation of optimal quantum violations and the conditions under which they occur. We further quantify the upper bound on maximal violations achievable by arbitrary two-qubit mixed states in such networks, under separable measurements, and evaluate the noise robustness of the proposed inequalities via the visibilities of noisy states. Finally, we demonstrate that these inequalities can, in a device-independent manner, distinguish between network topologies of equal size that differ in the number of leaf nodes.

arXiv:2509.04767•Physical Review Research•Jan 13, 2026•0 citations

State polynomial optimization for nonlinear Bell inequalities

Victor Magron

This talk focuses on optimization over state polynomials, i.e., polynomials in noncommuting variables and formal states of their products.An archimedean Positivstellensatz in the spirit of Putinar and Helton-McCullough is presented leading to a hierarchy of semidefinite relaxations converging monotonically to the optimum of a state polynomial subject to state constraints. This hierarchy can be seen as a state analog of the Lasserre hierarchy for optimization of polynomials, and the Navascués-Pironio-Acín scheme for optimization of noncommutative polynomials.The motivation behind this theory arises from the study of correlations in quantum networks. Determining the maximal quantum violation of a polynomial Bell inequality for an arbitrary network is reformulated as a state polynomial optimization problem. Several examples of quadratic Bell inequalities in the bipartite scenario are analyzed.To reduce the size of the semidefinite programs, sparsity, sign symmetry and conditional expectation of the observables' group structure are exploited.This is based on the joint work with Igor Klep, Jurij Volčič, and Jie Wang.

•Jul 29, 2024•0 citations

Quantitative and Optimal Device-Independent Lower Bounds on Detection Efficiency

Arkaprabha Ghosal, Soumyadip Patra, Peter Bierhorst

This paper examines a quantitative and optimal lower bound on the detector efficiency in a (2,2,2) Bell experiment within a fully device-independent framework, whereby the detectors used in the experiment are uncharacterized. We provide a tight lower bound on the minimum efficiency required to observe a desired Bell-CHSH violation using the Navascués-Pironio-Acín (NPA) hierarchy, confirming tightness up to four decimal places with numerical optimization over explicit quantum realizations. We then introduce the effect of dark counts and demonstrate how to quantify the minimum required efficiency to observe a desired CHSH violation with an increasing dark count error. Finally, to obtain an analytical closed-form expression of the minimum efficiency, we consider the set of no-signaling behaviors that satisfy the Tsirelson bound, which are easier to characterize than the quantum set. Using such behaviors, we find a simple closed-form expression for a lower bound on the minimum efficiency which is monotonically increasing with the CHSH violation, though the analytically obtained lower bounds are meaningfully below the numerically tight lower bound.

quant-pharXiv:2511.19302•Physical Review A•Nov 25, 2025•0 citations
Bell inequalities are an important tool for studying nonlocality, however, they quickly become computationally intractable as the system size grows. We consider a method for finding an upper bound for the quantum violation of such inequalities by combining the Navascu'es-Pironio-Ac'{\i}n (NPA) hierarchy, the method of alternating projections, and a standard memory-efficient optimization algorithm. While our method may not give the tightest upper bound possible, it often does so several orders of magnitude faster than state-of-the-art solvers, with minimal memory usage, thus allowing solutions to problems that would otherwise be intractable. We benchmark using the well-studied I3322{I}_{3322}I3322​ inequality as well as a more general large-scale randomized inequality Rxx22{R}_{xx22}Rxx22​. For randomized inequalities with 130 inputs either side (a first-level moment matrix of size 261\ifmmode×\else\texttimes\fi261261\ifmmode\times\else\texttimes\fi{}261261\ifmmode×\else\texttimes\fi261), our method is \ensuremath∼100\ifmmode×\else\texttimes\fi\ensuremath{\sim}100\ifmmode\times\else\texttimes\fi{}\ensuremath∼100\ifmmode×\else\texttimes\fi faster than both mosek and SCS while giving a bound only \ensuremath∼2\ensuremath{\sim}2%\ensuremath∼2 above the optimum.
Abstract The degree of experimentally attainable nonlocality, as gauged by the amount of loophole-free violation of Bell inequalities, remains severely limited due to inefficient detectors. We address an experimentally motivated question: Which quantum strategies attain the maximal loophole-free nonlocality in the presence of inefficient detectors? For any Bell inequality and any specification of detection efficiencies, the optimal strategies are those that maximally violate a tilted version of the Bell inequality in ideal conditions. In the simplest scenario, we demonstrate that the quantum strategies that maximally violate the tilted versions of Clauser-Horne-Shimony-Holt inequality are unique up to local isometries. However, self-testing via the standard sum of squares decomposition method turns out to be analytically intractable since even high levels of the Navascués--Pironio--Acín hierarchy are insufficient to saturate the maximum quantum violation of these inequalities. Instead, we utilize a novel Jordan's lemma-based proof technique to obtain robust analytical self-testing statements for the entire family of tilted-Bell inequalities. These results allow us to unveil intriguing aspects of the effect of inefficient detectors and the complexity of characterizing the set of quantum correlations, in the simplest Bell scenario.
Nonlocality shapes quantum correlations, revealed through the violation of Bell inequalities. The intersection of all valid Bell inequalities is the so-called local polytope. In multipartite systems, characterizing the local polytope quickly becomes an intractable task as the system size increases. Optimizing Bell inequalities to maximize the ratio between their quantum value and classical bound is key to understanding multipartite nonlocality. We propose a gradient-based method for this optimization. Numerical results indicate that local maxima of this ratio typically correspond to facet Bell inequalities of the local polytope. This enables an iterative search for tight and robust Bell inequalities. Applied to permutation-invariant scenarios, the method provides tight Bell inequalities with large quantum violations and facilitates experimental certification of Bell correlations without full knowledge of the local polytope. Moreover, analytical results of the maximum ratio are derived in the thermodynamic limit.
Multipartite Bell nonlocality provides a device-independent probe of many-body quantum correlations, but its characterization is limited by the rapid growth of the underlying classical and quantum optimization problems. We develop a scalable method for constructing and certifying permutationally invariant Bell inequalities using only one- and two-body correlators. The construction gives families of inequalities with robust quantum violations for general mmm measurements as the number of parties NNN becomes large. To improve robustness against noise, we optimize the ratio of the quantum value to the classical bound for these families in the large-NNN limit. We then certify the resulting quantum violation using semidefinite programming. For the broad class of Bell inequalities studied here, the infinite-NNN ratios take simple rational values for finite mmm and converge to coth⁡(1)\coth(1)coth(1) as m→∞m\to\inftym→∞. The optimized inequalities efficiently detect many-body Bell nonlocality with collective measurements, with more measurement settings leading to stronger violations.
Quantum nonlocality in networks featuring multiple independent sources underpins large-scale quantum communication and poses fundamental challenges for its characterization. In this work, we construct a family of explicit nonlinear Bell inequalities to verify the nonlocality across the general multi-input quantum networks. The construction of these inequalities relies on the number of leaf nodes, a network parameter that can be identified by a linear-time algorithm. Our approach establishes a structural connection between bipartite full-correlation Bell inequalities and network Bell inequalities, enabling the analytical derivation of optimal quantum violations and the conditions under which they occur. We further quantify the upper bound on maximal violations achievable by arbitrary two-qubit mixed states in such networks, under separable measurements, and evaluate the noise robustness of the proposed inequalities via the visibilities of noisy states. Finally, we demonstrate that these inequalities can, in a device-independent manner, distinguish between network topologies of equal size that differ in the number of leaf nodes.
This talk focuses on optimization over state polynomials, i.e., polynomials in noncommuting variables and formal states of their products.An archimedean Positivstellensatz in the spirit of Putinar and Helton-McCullough is presented leading to a hierarchy of semidefinite relaxations converging monotonically to the optimum of a state polynomial subject to state constraints. This hierarchy can be seen as a state analog of the Lasserre hierarchy for optimization of polynomials, and the Navascués-Pironio-Acín scheme for optimization of noncommutative polynomials.The motivation behind this theory arises from the study of correlations in quantum networks. Determining the maximal quantum violation of a polynomial Bell inequality for an arbitrary network is reformulated as a state polynomial optimization problem. Several examples of quadratic Bell inequalities in the bipartite scenario are analyzed.To reduce the size of the semidefinite programs, sparsity, sign symmetry and conditional expectation of the observables' group structure are exploited.This is based on the joint work with Igor Klep, Jurij Volčič, and Jie Wang.
This paper examines a quantitative and optimal lower bound on the detector efficiency in a (2,2,2) Bell experiment within a fully device-independent framework, whereby the detectors used in the experiment are uncharacterized. We provide a tight lower bound on the minimum efficiency required to observe a desired Bell-CHSH violation using the Navascués-Pironio-Acín (NPA) hierarchy, confirming tightness up to four decimal places with numerical optimization over explicit quantum realizations. We then introduce the effect of dark counts and demonstrate how to quantify the minimum required efficiency to observe a desired CHSH violation with an increasing dark count error. Finally, to obtain an analytical closed-form expression of the minimum efficiency, we consider the set of no-signaling behaviors that satisfy the Tsirelson bound, which are easier to characterize than the quantum set. Using such behaviors, we find a simple closed-form expression for a lower bound on the minimum efficiency which is monotonically increasing with the CHSH violation, though the analytically obtained lower bounds are meaningfully below the numerically tight lower bound.