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• 4 citations
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

Bounds on quantum correlations in Bell-inequality experiments

Yeong-Cherng Liang, Andrew C. Doherty

Bell-inequality violation is one of the most widely known manifestations of entanglement in quantum mechanics; indicating that experiments on physically separated quantum mechanical systems cannot be given a local realistic description. However, despite the importance of Bell inequalities, it is not known in general how to determine whether a given entangled state will violate a Bell inequality. This is because one can choose to make many different measurements on a quantum system to test any given Bell inequality and the optimization over measurements is a high-dimensional variational problem. In order to better understand this problem we present algorithms that provide, for a given quantum state and Bell inequality, both a lower bound and an upper bound on the maximal violation of the inequality. In many cases these bounds determine measurements that would demonstrate violation of the Bell inequality or provide a bound that rules out the possibility of a violation. Both bounds apply techniques from convex optimization and the methodology for creating upper bounds allows them to be systematically improved. Examples are given to illustrate how these algorithms can be used to conclude definitively if some quantum states violate a given Bell inequality.

arXiv:quant-ph/0608128•Physical Review A•Apr 9, 2007•66 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•2 citations

Self-testing tilted strategies for maximal loophole-free nonlocality

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

The degree of experimentally attainable nonlocality, as gauged by the loophole-free or effective 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 doubly-tilted versions of Clauser-Horne-Shimony-Holt inequality are unique up to local isometries. We utilize a Jordan’s lemma and Gröbner basis-based proof technique to analytically derive self-testing statements for the entire family of doubly-tilted CHSH inequalities and numerically demonstrate their robustness. These results enable us to reveal the insufficiency of even high levels of the Navascués–Pironio–Acín hierarchy to saturate the maximum quantum violation of these inequalities.

arXiv:2405.08743•npj Quantum Information•May 19, 2025•16 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•1 citation

Bell inequalities and large-scale quantum networks

Michael Epping

In the field of quantum information theory one investigates the properties of information carriers which are subject to the laws of quantum mechanics. The differences between quantum mechanics and the laws that govern macroscopic information carriers lead to new opportunities and challenges in information processing. One of these differences is the entanglement of particles, which leads to strong correlations of measurement outcomes. This allows the violation of so-called Bell inequalities in quantum mechanics, which is impossible in ``classical'' theories. I investigated the possible amount of violation for an important class of Bell inequalities. In doing so I found a simple mathematical expression for an upper bound and studied the achievability of that bound. The approach provides a basic understanding of the considered Bell inequalities, which allows to construct new inequalities with interesting properties. In particular one can understand how Bell inequalities allow to bound the dimension of a quantum system. Changing a Bell inequality with invariant quantum value proved useful in optimizing them with respect to the violation. The distribution of entangled systems across large distances is achieved by sending photons. However, since they are absorbed in long fibers, quantum repeater become necessary for distances larger than approximately 200 km. Several approaches to counter the losses are known. In the long term error correction codes are very promising. Here the information is encoded into many photons, such that some losses can be compensated. I contributed to the analysis of this approach by showing how it naturally generalizes to networks of quantum repeaters. The formalism of graph states is useful in this context. A complete performance analysis of a quantum repeater contains many sources of errors and their propagation inside the circuit. I extended this analysis compared to the literature. At the moment it is not clear which types of quantum repeaters will prevail. My comparison of different theoretical proposals helps towards answering this question.

•Jan 1, 2016•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
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.
Bell-inequality violation is one of the most widely known manifestations of entanglement in quantum mechanics; indicating that experiments on physically separated quantum mechanical systems cannot be given a local realistic description. However, despite the importance of Bell inequalities, it is not known in general how to determine whether a given entangled state will violate a Bell inequality. This is because one can choose to make many different measurements on a quantum system to test any given Bell inequality and the optimization over measurements is a high-dimensional variational problem. In order to better understand this problem we present algorithms that provide, for a given quantum state and Bell inequality, both a lower bound and an upper bound on the maximal violation of the inequality. In many cases these bounds determine measurements that would demonstrate violation of the Bell inequality or provide a bound that rules out the possibility of a violation. Both bounds apply techniques from convex optimization and the methodology for creating upper bounds allows them to be systematically improved. Examples are given to illustrate how these algorithms can be used to conclude definitively if some quantum states violate a given Bell inequality.
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.
The degree of experimentally attainable nonlocality, as gauged by the loophole-free or effective 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 doubly-tilted versions of Clauser-Horne-Shimony-Holt inequality are unique up to local isometries. We utilize a Jordan’s lemma and Gröbner basis-based proof technique to analytically derive self-testing statements for the entire family of doubly-tilted CHSH inequalities and numerically demonstrate their robustness. These results enable us to reveal the insufficiency of even high levels of the Navascués–Pironio–Acín hierarchy to saturate the maximum quantum violation of these inequalities.
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.
In the field of quantum information theory one investigates the properties of information carriers which are subject to the laws of quantum mechanics. The differences between quantum mechanics and the laws that govern macroscopic information carriers lead to new opportunities and challenges in information processing. One of these differences is the entanglement of particles, which leads to strong correlations of measurement outcomes. This allows the violation of so-called Bell inequalities in quantum mechanics, which is impossible in ``classical'' theories. I investigated the possible amount of violation for an important class of Bell inequalities. In doing so I found a simple mathematical expression for an upper bound and studied the achievability of that bound. The approach provides a basic understanding of the considered Bell inequalities, which allows to construct new inequalities with interesting properties. In particular one can understand how Bell inequalities allow to bound the dimension of a quantum system. Changing a Bell inequality with invariant quantum value proved useful in optimizing them with respect to the violation. The distribution of entangled systems across large distances is achieved by sending photons. However, since they are absorbed in long fibers, quantum repeater become necessary for distances larger than approximately 200 km. Several approaches to counter the losses are known. In the long term error correction codes are very promising. Here the information is encoded into many photons, such that some losses can be compensated. I contributed to the analysis of this approach by showing how it naturally generalizes to networks of quantum repeaters. The formalism of graph states is useful in this context. A complete performance analysis of a quantum repeater contains many sources of errors and their propagation inside the circuit. I extended this analysis compared to the literature. At the moment it is not clear which types of quantum repeaters will prevail. My comparison of different theoretical proposals helps towards answering this question.
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.