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

Generating multipartite nonlocality to benchmark quantum computers

Jan Lennart Bönsel, Otfried Gühne, Adán Cabello

Published Jan 9, 2025• 8 citations
arXivHTMLPDF

Abstract

We show that quantum computers can be used for producing large $n$-partite nonlocality, thereby providing a method to benchmark them. The main challenges to overcome are as follows: (i) The interaction topology might not allow arbitrary two-qubit gates. (ii) Noise limits the Bell violation. (iii) The number of combinations of local measurements grows exponentially with $n$. To overcome (i), we point out that graph states that are compatible with the two-qubit connectivity of the computer can be efficiently prepared. To mitigate (ii), we note that for specific graph states, there are $n$-partite Bell inequalities whose resistance to white noise increases exponentially with $n$. To address (iii) for any $n$ and any connectivity, we introduce an estimator that relies on random sampling. As a result, we propose a method for producing $n$-partite Bell nonlocality with unprecedented large $n$. This allows one, in return, to benchmark nonclassical correlations regardless of the number of qubits or the connectivity. We test our approach by using a simulation for a noisy IBM quantum computer, which predicts $n$-partite Bell nonlocality for at least $n=24$ qubits.

DOI
10.1103/physreva.111.012207

Related papers

Quantifying quantum nonlocality

Ben Toner

Quantum mechanics is nonlocal, meaning it cannot be described by any classical local hidden variable model. In this thesis we study two aspects of quantum nonlocality. Part I addresses the question of what classical resources are required to simulate nonlocal quantum correlations. We start by constructing new local models for noisy entangled quantum states. These constructions exploit the connection between nonlocality and Grothendieck's inequality, first noticed by Tsirelson. Next, we consider local models augmented by a limited amount of classical communication. After generalizing Bell inequalities to this setting, we show that (i) one bit of communication is sufficient to simulate the correlations of projective measurements on a maximally entangled state of two qubits, and (ii) five bits of communication are sufficient to simulate the joint correlation of two-outcome measurements on any bipartite quantum state. The latter result can be interpreted as a stronger (constrained) version of Grothendieck's inequality. In part II, we investigate the monogamy of nonlocal correlations. In a setting where three parties, A, B, and C, share an entangled quantum state of arbitrary dimension, we: (i) bound the trade-off between AB's and AC's violation of the CHSH inequality, obtaining an intriguing generalization of Tsirelson's bound, and (ii) demonstrate that forcing B and C to be classically correlated prevents A and B from violating certain Bell inequalities. We study not only correlations that arise within quantum theory, but also arbitrary correlations that do not allow signaling between separate groups of parties. These results are based on new techniques for obtaining Tsirelson bounds, or bounds on the quantum value of a Bell inequality, and have applications to interactive proof systems and cryptography.

•Aug 12, 2013•3 citations

Benchmarking Multipartite Entanglement Generation with Graph States

René Zander, Colin Kai‐Uwe Becker

Abstract As quantum computing technology slowly matures and the number of available qubits on a QPU gradually increases, interest in assessing the capabilities of quantum computing hardware in a scalable manner is growing. One of the key properties for quantum computing is the ability to generate multipartite entangled states. In this study, aspects of benchmarking entanglement generation capabilities of noisy intermediate‐scale quantum (NISQ) devices are discussed based on the preparation of graph states and the verification of entanglement in the prepared states. Thereby, entanglement witnesses that are specifically suited for a scalable experiment design are used. This choice of entanglement witnesses can detect A) bipartite entanglement and B) genuine multipartite entanglement for graph states with constant two measurement settings if the prepared graph state is based on a two‐colorable graph, e.g., a square grid graph or one of its subgraphs. With this, it is experimentally verified that a bipartite entangled state comprising all qubits can be prepared on a 127‐qubit IBM Quantum superconducting QPU, and genuine multipartite entanglement can be detected for states of up to 23 qubits with quantum readout error mitigation.

arXiv:2402.00766•Advanced Quantum Technologies•Oct 9, 2024•6 citations

Spreading nonlocality in a quantum network

Ratul Banerjee, Srijon Ghosh, Shiladitya Mal +1 more

Starting from several copies of bipartite noisy entangled states, we design a global and optimal local measurement-based protocol in one-and two-dimensional lattices by which any two or more prefix sites can be connected via entanglement.Production of bipartite as well as multipartite entangled states in a network is verified in a device-independent way through the violation of Bell inequalities with two settings per site and with continuous range of settings.We also note that if the parties refuse to perform local measurements, the entanglement distribution scheme fails.We obtain critical values of noise allowed in the initial state so that the resulting output state show nonlocal correlation in different networks with arbitrary number of connections.We report that by employing our method, it is possible to create a multipartite entangled state, violating Bell inequality and having a continuous range of settings, from bipartite states which do not violate Clauser-Horne-Shimony-Halt Bell inequalities in an one-dimensional lattice with the minimal coordination number being six.Such a feature of superadditivity in violation can also be observed in a triangular two-dimensional lattice but not in a square lattice.

arXiv:1912.08874•Physical Review Research•Dec 10, 2020•11 citations

Optimal tests of genuine multipartite nonlocality

Mahasweta Pandit, Artur Barasiński, István Márton +2 more

Abstract We propose an optimal and efficient numerical test for witnessing genuine multipartite nonlocality based on a geometric approach. In particular, we consider two non-equivalent models of local hidden variables, namely the Svetlichny and the no-signaling bilocal models. While our knowledge concerning these models is well established for Bell-type scenarios involving two measurement settings per party, the general case based on an arbitrary number of settings is a considerably more challenging task and very little work has been done in this field. In this paper, we applied such general tests to detect and characterize genuine n-way nonlocal correlations for various states of three qubits and qutrits. Apart from the fundamental problem of characterizing genuine multipartite nonlocal correlations, the extension of the number of measurements beyond two is also of practical importance. As a measure of nonlocality, we use the probability of violation of local realism under randomly sampled observables, and the strength of nonlocality, described by the resistance to white noise admixture. In particular, we analyze to what extent the Bell-type scenario involving two measurement settings can be used to certify genuine n-way nonlocal correlations generated for more general models. In addition, we propose a simple procedure to detect such nonlocal correlations for randomly chosen settings with an efficiency of up to 100%. Due to its near-perfect efficiency, our method may open new possibilities in device-independent quantum cryptography applications where strong nonlocality between all partners is required.

arXiv:2206.08848•New Journal of Physics•Dec 1, 2022•12 citations

Generalized Mermin Inequalities for Benchmarking Large-Scale GHZ States

Jianbin Cai, Junxiang Huang, Fynn Otto +15 more

Multipartite Bell tests provide a correlation-only route to benchmarking quantum processors, but their application at large scales is hindered by the rapid decay of many-body correlators under noise and exponentially many terms in conventional Bell expressions. Here we address these scalability obstacles by introducing a finite-setting generalized Mermin family of state-tailored Bell inequalities with analytic certification bounds, in which the measurement-setting number $m$ provides an additional certification dimension complementary to the system size $n$. We show that, for the powers-of-two setting choices considered here, increasing $m$ leaves the ideal normalized multipartite quantum value unchanged while lowering the relevant classical bounds, thereby strengthening the Bell-violation ratios and yielding an improved noise-robustness scaling compared to the standard Mermin inequality. We test this construction experimentally on a programmable superconducting processor by preparing Greenberger-Horne-Zeilinger (GHZ) states of up to 80 qubits. Using randomized sampling for direct Bell-operator estimation, we observe Bell ratios that grow exponentially with system size, certify a nonlocality depth of 14, and show that increasing $m$ strengthens both the Bell ratio and depth certification. All results are obtained solely from measured correlators and analytical bounds, without readout correction, tomography, or model-based mitigation. Generalized Mermin inequalities therefore provide a sharper Bell benchmark for noisy large-scale GHZ states.

quant-pharXiv:2607.23574•Jul 28, 2026•1 citation

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
We show that quantum computers can be used for producing large nnn-partite nonlocality, thereby providing a method to benchmark them. The main challenges to overcome are as follows: (i) The interaction topology might not allow arbitrary two-qubit gates. (ii) Noise limits the Bell violation. (iii) The number of combinations of local measurements grows exponentially with nnn. To overcome (i), we point out that graph states that are compatible with the two-qubit connectivity of the computer can be efficiently prepared. To mitigate (ii), we note that for specific graph states, there are nnn-partite Bell inequalities whose resistance to white noise increases exponentially with nnn. To address (iii) for any nnn and any connectivity, we introduce an estimator that relies on random sampling. As a result, we propose a method for producing nnn-partite Bell nonlocality with unprecedented large nnn. This allows one, in return, to benchmark nonclassical correlations regardless of the number of qubits or the connectivity. We test our approach by using a simulation for a noisy IBM quantum computer, which predicts nnn-partite Bell nonlocality for at least n=24n=24n=24 qubits.
Quantum mechanics is nonlocal, meaning it cannot be described by any classical local hidden variable model. In this thesis we study two aspects of quantum nonlocality. Part I addresses the question of what classical resources are required to simulate nonlocal quantum correlations. We start by constructing new local models for noisy entangled quantum states. These constructions exploit the connection between nonlocality and Grothendieck's inequality, first noticed by Tsirelson. Next, we consider local models augmented by a limited amount of classical communication. After generalizing Bell inequalities to this setting, we show that (i) one bit of communication is sufficient to simulate the correlations of projective measurements on a maximally entangled state of two qubits, and (ii) five bits of communication are sufficient to simulate the joint correlation of two-outcome measurements on any bipartite quantum state. The latter result can be interpreted as a stronger (constrained) version of Grothendieck's inequality. In part II, we investigate the monogamy of nonlocal correlations. In a setting where three parties, A, B, and C, share an entangled quantum state of arbitrary dimension, we: (i) bound the trade-off between AB's and AC's violation of the CHSH inequality, obtaining an intriguing generalization of Tsirelson's bound, and (ii) demonstrate that forcing B and C to be classically correlated prevents A and B from violating certain Bell inequalities. We study not only correlations that arise within quantum theory, but also arbitrary correlations that do not allow signaling between separate groups of parties. These results are based on new techniques for obtaining Tsirelson bounds, or bounds on the quantum value of a Bell inequality, and have applications to interactive proof systems and cryptography.
Abstract As quantum computing technology slowly matures and the number of available qubits on a QPU gradually increases, interest in assessing the capabilities of quantum computing hardware in a scalable manner is growing. One of the key properties for quantum computing is the ability to generate multipartite entangled states. In this study, aspects of benchmarking entanglement generation capabilities of noisy intermediate‐scale quantum (NISQ) devices are discussed based on the preparation of graph states and the verification of entanglement in the prepared states. Thereby, entanglement witnesses that are specifically suited for a scalable experiment design are used. This choice of entanglement witnesses can detect A) bipartite entanglement and B) genuine multipartite entanglement for graph states with constant two measurement settings if the prepared graph state is based on a two‐colorable graph, e.g., a square grid graph or one of its subgraphs. With this, it is experimentally verified that a bipartite entangled state comprising all qubits can be prepared on a 127‐qubit IBM Quantum superconducting QPU, and genuine multipartite entanglement can be detected for states of up to 23 qubits with quantum readout error mitigation.
Starting from several copies of bipartite noisy entangled states, we design a global and optimal local measurement-based protocol in one-and two-dimensional lattices by which any two or more prefix sites can be connected via entanglement.Production of bipartite as well as multipartite entangled states in a network is verified in a device-independent way through the violation of Bell inequalities with two settings per site and with continuous range of settings.We also note that if the parties refuse to perform local measurements, the entanglement distribution scheme fails.We obtain critical values of noise allowed in the initial state so that the resulting output state show nonlocal correlation in different networks with arbitrary number of connections.We report that by employing our method, it is possible to create a multipartite entangled state, violating Bell inequality and having a continuous range of settings, from bipartite states which do not violate Clauser-Horne-Shimony-Halt Bell inequalities in an one-dimensional lattice with the minimal coordination number being six.Such a feature of superadditivity in violation can also be observed in a triangular two-dimensional lattice but not in a square lattice.
Abstract We propose an optimal and efficient numerical test for witnessing genuine multipartite nonlocality based on a geometric approach. In particular, we consider two non-equivalent models of local hidden variables, namely the Svetlichny and the no-signaling bilocal models. While our knowledge concerning these models is well established for Bell-type scenarios involving two measurement settings per party, the general case based on an arbitrary number of settings is a considerably more challenging task and very little work has been done in this field. In this paper, we applied such general tests to detect and characterize genuine n-way nonlocal correlations for various states of three qubits and qutrits. Apart from the fundamental problem of characterizing genuine multipartite nonlocal correlations, the extension of the number of measurements beyond two is also of practical importance. As a measure of nonlocality, we use the probability of violation of local realism under randomly sampled observables, and the strength of nonlocality, described by the resistance to white noise admixture. In particular, we analyze to what extent the Bell-type scenario involving two measurement settings can be used to certify genuine n-way nonlocal correlations generated for more general models. In addition, we propose a simple procedure to detect such nonlocal correlations for randomly chosen settings with an efficiency of up to 100%. Due to its near-perfect efficiency, our method may open new possibilities in device-independent quantum cryptography applications where strong nonlocality between all partners is required.
Multipartite Bell tests provide a correlation-only route to benchmarking quantum processors, but their application at large scales is hindered by the rapid decay of many-body correlators under noise and exponentially many terms in conventional Bell expressions. Here we address these scalability obstacles by introducing a finite-setting generalized Mermin family of state-tailored Bell inequalities with analytic certification bounds, in which the measurement-setting number mmm provides an additional certification dimension complementary to the system size nnn. We show that, for the powers-of-two setting choices considered here, increasing mmm leaves the ideal normalized multipartite quantum value unchanged while lowering the relevant classical bounds, thereby strengthening the Bell-violation ratios and yielding an improved noise-robustness scaling compared to the standard Mermin inequality. We test this construction experimentally on a programmable superconducting processor by preparing Greenberger-Horne-Zeilinger (GHZ) states of up to 80 qubits. Using randomized sampling for direct Bell-operator estimation, we observe Bell ratios that grow exponentially with system size, certify a nonlocality depth of 14, and show that increasing mmm strengthens both the Bell ratio and depth certification. All results are obtained solely from measured correlators and analytical bounds, without readout correction, tomography, or model-based mitigation. Generalized Mermin inequalities therefore provide a sharper Bell benchmark for noisy large-scale GHZ states.
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.