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:2002.01843 · Physical Review Research

Constructing multipartite Bell inequalities from stabilizers

Qi Zhao, You Zhou

Published Dec 26, 2022• 6 citations
arXivHTMLPDF

Abstract

Bell inequality with a self-testing property has played an important role in quantum information processing with both fundamental and practical significance. However, it is generally challenging to find Bell inequalities used for self-testing multipartite states, and actually, there are not many known candidates. In this work we propose a systematic framework to construct Bell inequalities from stabilizers which are maximally violated by general stabilizer states, with two observables for each local party. We show that the constructed Bell inequalities can self-test any stabilizer state if and only if these stabilizers can uniquely determine the state in a device-dependent manner. This bridges the gap between device-independent and device-dependent verification methods. Our framework can provide plenty of Bell inequalities for self-testing $N$-party stabilizer states. Among them, we give two families of Bell inequalities with different advantages: (1) a family of Bell inequalities with a constant ratio of quantum and classical bounds using $2N$ correlations, and (2) single pair inequalities improving on all previous robustness self-testing bounds using $N+1$ correlations, which are both efficient and robust for realizations in multipartite systems.

DOI
10.1103/physrevresearch.4.043215

Related papers

Self-testing protocols based on the chained Bell inequalities

Ivan Šupić, Remigiusz Augusiak, Alexia Salavrakos +1 more

Self-testing is a device-independent technique based on non-local correlations whose aim is to certify the effective uniqueness of the quantum state and measurements needed to produce these correlations. It is known that the maximal violation of some Bell inequalities suffices for this purpose. However, most of the existing self-testing protocols for two devices exploit the well-known Clauser–Horne–Shimony–Holt Bell inequality or modifications of it, and always with two measurements per party. Here, we generalize the previous results by demonstrating that one can construct self-testing protocols based on the chained Bell inequalities, defined for two devices implementing an arbitrary number of two-output measurements. On the one hand, this proves that the quantum state and measurements leading to the maximal violation of the chained Bell inequality are unique. On the other hand, in the limit of a large number of measurements, our approach allows one to self-test the entire plane of measurements spanned by the Pauli matrices X and Z . Our results also imply that the chained Bell inequalities can be used to certify two bits of perfect randomness.

arXiv:1511.09220•New Journal of Physics•Apr 5, 2016•86 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

Self-testing maximally-dimensional genuinely entangled subspaces within the stabilizer formalism

Owidiusz Makuta, Remigiusz Augusiak

Abstract Self-testing was originally introduced as a device-independent method of certification of entangled quantum states and local measurements performed on them. Recently, in (Baccari et al 2020 Phys. Rev. Lett. 125 260507) the notion of state self-testing has been generalized to entangled subspaces and the first self-testing strategies for exemplary genuinely entangled subspaces have been given. The main aim of our work is to pursue this line of research and to address the question how ‘large’ (in terms of dimension) are genuinely entangled subspaces that can be self-tested, concentrating on the multiqubit stabilizer formalism. To this end, we first introduce a framework allowing to efficiently check whether a given stabilizer subspace is genuinely entangled. Building on it, we then determine the maximal dimension of genuinely entangled subspaces that can be constructed within the stabilizer subspaces and provide an exemplary construction of such maximally-dimensional subspaces for any number of qubits. Third, we construct Bell inequalities that are maximally violated by any entangled state from those subspaces and thus also any mixed states supported on them, and we show these inequalities to be useful for self-testing. Interestingly, our Bell inequalities allow for identification of higher-dimensional face structures in the boundaries of the sets of quantum correlations in the simplest multipartite Bell scenarios in which every observer performs two dichotomic measurements.

arXiv:2012.01164•New Journal of Physics•Mar 12, 2021•24 citations

Size-Independent Robustness in Multipartite Bell Self-Testing

Shen Cao, Xingjian Zhang, Fei Shi +1 more

Practical robust self-testing of multipartite entanglement has so far been restricted to small-scale systems due to error bounds that degrade severely with system size. In this work, we establish multipartite self-testing with robustness independent of the size of the quantum network. We derive a fully analytic, device-independent self-testing bound for $n$-qubit Greenberger-Horne-Zeilinger (GHZ) states. The bound scales linearly with the observed violation error and lies universally within a constant factor of two from a theoretical upper bound. Furthermore, the operator-inequality framework reduces the verification of the conjectured optimal bound to a highly efficient numerical check, which we perform up to $n=100$. Consequently, GHZ entanglement can be certified under a fixed noise level in arbitrarily large systems, enabling scalable device-independent verification.

quant-pharXiv:2608.30851•Sep 1, 2026•1 citation

Tailoring Bell inequalities to the qudit toric code and self testing

Eloïc Vallée, Owidiusz Makuta, Patrick Emonts +2 more

Bell nonlocality provides a robust scalable route to the efficient certification of quantum states. Here, we introduce a general framework for constructing Bell inequalities tailored to the $\mathbb{Z}_d$ toric code for odd prime local dimensions. Selecting a suitable subset of stabilizer operators and mapping them to generalized measurement observables, we compute multipartite Bell expressions whose quantum maxima admit a sum-of-squares decomposition. We show that these inequalities are maximally violated by all states in the ground-state manifold of the $\mathbb{Z}_d$ toric code, and determine their classical (local) bounds through a combination of combinatorial tiling arguments and explicit optimization. As a concrete application, we analyze the case of $d=3$ and demonstrate that the maximal violation self-tests the full qutrit toric-code subspace, up to local isometries and complex conjugation. This constitutes, to our knowledge, the first-ever example of self-testing a qutrit subspace. Extending these constructions, we further present schemes to enhance the ratio of classical--quantum bounds and thus improve robustness to experimental imperfections. Our results establish a pathway toward device-independent certification of highly entangled topological quantum matter and provide new tools for validating qudit states in error-correcting codes and quantum simulation platforms.

quant-pharXiv:2512.00146•Dec 2, 2025•3 citations

Certifying optimal device-independent quantum randomness in quantum networks

Shuai Zhao, Rong Wang, Qi Zhao

Bell nonlocality provides a device-independent (DI) way to certify quantum randomness, based on which true random numbers can be extracted from the observed correlations without detail characterizations on devices for quantum state preparation and measurement. However, the efficiency of current strategies for DI randomness certification is still heavily constrained when it comes to non-maximal Bell values, especially for multiple parties. Here, we present a family of multipartite Bell inequalities that allows to certify optimal quantum randomness and self-test GHZ (Greenberger-Horne-Zeilinger) states, which are inspired from the stabilizer group of the GHZ state. Due to the simple representation of stabilizer group for GHZ states, this family of Bell inequalities is of simple structure and can be easily expanded to more parties. Compared with the Mermin-type inequalities, this family of Bell inequality is more efficient in certifying quantum randomness when non-maximal Bell values achieved. Meanwhile, the general analytical upper bound for the Holevo quantity is presented, and achieves better performance compared with the MABK (Mermin-Ardehali-Belinskii-Klyshko) inequality, Parity-CHSH (Clauser-Horne-Shimony-Holt) inequality and Holz inequality at $N=3$, which is of particular interests for experimental researches on DI quantum cryptography in quantum networks.

quant-pharXiv:2601.18534•Jan 27, 2026•3 citations
Bell inequality with a self-testing property has played an important role in quantum information processing with both fundamental and practical significance. However, it is generally challenging to find Bell inequalities used for self-testing multipartite states, and actually, there are not many known candidates. In this work we propose a systematic framework to construct Bell inequalities from stabilizers which are maximally violated by general stabilizer states, with two observables for each local party. We show that the constructed Bell inequalities can self-test any stabilizer state if and only if these stabilizers can uniquely determine the state in a device-dependent manner. This bridges the gap between device-independent and device-dependent verification methods. Our framework can provide plenty of Bell inequalities for self-testing NNN-party stabilizer states. Among them, we give two families of Bell inequalities with different advantages: (1) a family of Bell inequalities with a constant ratio of quantum and classical bounds using 2N2N2N correlations, and (2) single pair inequalities improving on all previous robustness self-testing bounds using N+1N+1N+1 correlations, which are both efficient and robust for realizations in multipartite systems.
Self-testing is a device-independent technique based on non-local correlations whose aim is to certify the effective uniqueness of the quantum state and measurements needed to produce these correlations. It is known that the maximal violation of some Bell inequalities suffices for this purpose. However, most of the existing self-testing protocols for two devices exploit the well-known Clauser–Horne–Shimony–Holt Bell inequality or modifications of it, and always with two measurements per party. Here, we generalize the previous results by demonstrating that one can construct self-testing protocols based on the chained Bell inequalities, defined for two devices implementing an arbitrary number of two-output measurements. On the one hand, this proves that the quantum state and measurements leading to the maximal violation of the chained Bell inequality are unique. On the other hand, in the limit of a large number of measurements, our approach allows one to self-test the entire plane of measurements spanned by the Pauli matrices X and Z . Our results also imply that the chained Bell inequalities can be used to certify two bits of perfect randomness.
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.
Abstract Self-testing was originally introduced as a device-independent method of certification of entangled quantum states and local measurements performed on them. Recently, in (Baccari et al 2020 Phys. Rev. Lett. 125 260507) the notion of state self-testing has been generalized to entangled subspaces and the first self-testing strategies for exemplary genuinely entangled subspaces have been given. The main aim of our work is to pursue this line of research and to address the question how ‘large’ (in terms of dimension) are genuinely entangled subspaces that can be self-tested, concentrating on the multiqubit stabilizer formalism. To this end, we first introduce a framework allowing to efficiently check whether a given stabilizer subspace is genuinely entangled. Building on it, we then determine the maximal dimension of genuinely entangled subspaces that can be constructed within the stabilizer subspaces and provide an exemplary construction of such maximally-dimensional subspaces for any number of qubits. Third, we construct Bell inequalities that are maximally violated by any entangled state from those subspaces and thus also any mixed states supported on them, and we show these inequalities to be useful for self-testing. Interestingly, our Bell inequalities allow for identification of higher-dimensional face structures in the boundaries of the sets of quantum correlations in the simplest multipartite Bell scenarios in which every observer performs two dichotomic measurements.
Practical robust self-testing of multipartite entanglement has so far been restricted to small-scale systems due to error bounds that degrade severely with system size. In this work, we establish multipartite self-testing with robustness independent of the size of the quantum network. We derive a fully analytic, device-independent self-testing bound for nnn-qubit Greenberger-Horne-Zeilinger (GHZ) states. The bound scales linearly with the observed violation error and lies universally within a constant factor of two from a theoretical upper bound. Furthermore, the operator-inequality framework reduces the verification of the conjectured optimal bound to a highly efficient numerical check, which we perform up to n=100n=100n=100. Consequently, GHZ entanglement can be certified under a fixed noise level in arbitrarily large systems, enabling scalable device-independent verification.
Bell nonlocality provides a robust scalable route to the efficient certification of quantum states. Here, we introduce a general framework for constructing Bell inequalities tailored to the Zd\mathbb{Z}_dZd​ toric code for odd prime local dimensions. Selecting a suitable subset of stabilizer operators and mapping them to generalized measurement observables, we compute multipartite Bell expressions whose quantum maxima admit a sum-of-squares decomposition. We show that these inequalities are maximally violated by all states in the ground-state manifold of the Zd\mathbb{Z}_dZd​ toric code, and determine their classical (local) bounds through a combination of combinatorial tiling arguments and explicit optimization. As a concrete application, we analyze the case of d=3d=3d=3 and demonstrate that the maximal violation self-tests the full qutrit toric-code subspace, up to local isometries and complex conjugation. This constitutes, to our knowledge, the first-ever example of self-testing a qutrit subspace. Extending these constructions, we further present schemes to enhance the ratio of classical--quantum bounds and thus improve robustness to experimental imperfections. Our results establish a pathway toward device-independent certification of highly entangled topological quantum matter and provide new tools for validating qudit states in error-correcting codes and quantum simulation platforms.
Bell nonlocality provides a device-independent (DI) way to certify quantum randomness, based on which true random numbers can be extracted from the observed correlations without detail characterizations on devices for quantum state preparation and measurement. However, the efficiency of current strategies for DI randomness certification is still heavily constrained when it comes to non-maximal Bell values, especially for multiple parties. Here, we present a family of multipartite Bell inequalities that allows to certify optimal quantum randomness and self-test GHZ (Greenberger-Horne-Zeilinger) states, which are inspired from the stabilizer group of the GHZ state. Due to the simple representation of stabilizer group for GHZ states, this family of Bell inequalities is of simple structure and can be easily expanded to more parties. Compared with the Mermin-type inequalities, this family of Bell inequality is more efficient in certifying quantum randomness when non-maximal Bell values achieved. Meanwhile, the general analytical upper bound for the Holevo quantity is presented, and achieves better performance compared with the MABK (Mermin-Ardehali-Belinskii-Klyshko) inequality, Parity-CHSH (Clauser-Horne-Shimony-Holt) inequality and Holz inequality at N=3N=3N=3, which is of particular interests for experimental researches on DI quantum cryptography in quantum networks.