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

Il Nuovo cimento della Società italiana di fisica. B/Il Nuovo cimento B

Constructive generalization of Bell’s inequalities

M. Froissart

Published Aug 1, 1981• 178 citations
Publisher
DOI
10.1007/bf02903286

Related papers

Constructing multipartite Bell inequalities from stabilizers

Qi Zhao, You Zhou

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.

arXiv:2002.01843•Physical Review Research•Dec 26, 2022•6 citations

Generalized Bell’s inequalities

Luigi Schiavulli

Lettere al nuovo cimento della societa italiana di fisica/Lettere al nuovo cimento•Nov 1, 1977•2 citations

Error-Tolerating Bell Inequalities via Graph States

Qing Chen, Sixia Yu, C. H. Oh

We investigate the Bell inequalities derived from the graph states with violations detectable even with the presence of noises, which generalizes the idea of error-correcting Bell inequalities [Phys. Rev. Lett. 101, 080501 (2008)]. Firstly we construct a family of valid Bell inequalities tolerating arbitrary $t$-qubit errors involving $3(t+1)$ qubits, e.g., 6 qubits suffice to tolerate single qubit errors. Secondly we construct also a single-error-tolerating Bell inequality with a violation that increases exponentially with the number of qubits. Exhaustive computer search for optimal error-tolerating Bell inequalities based on graph states on no more than 10 qubits shows that our constructions are optimal for single- and double-error tolerance.

arXiv:0903.3318•Mar 19, 2009•1 citation

A new view of Bell’s inequalities

Louis Sica

Springer eBooks•Jan 1, 2003•0 citations

Generalized iterative formula for Bell inequalities

Xing-Yan Fan, Zhen‐Peng Xu, Jia-Le Miao +7 more

Bell inequality is a vital tool to detect the nonlocal correlations, but the construction of it for multipartite systems is still a complicated problem. In this work, inspired via a decomposition of $(n+1)$-partite Bell inequalities into $n$-partite ones, we present a generalized iterative formula to construct nontrivial $(n+1)$-partite ones from the $n$-partite ones. Our iterative formulas recover the well-known Mermin-Ardehali-Belinsk\ifmmode \breve{\imath}\else \u{\i}\fi{}-Klyshko (MABK) and other families in the literature as special cases. Moreover, a family of ``dual-use'' Bell inequalities is proposed, in the sense that for the generalized Greenberger-Horne-Zeilinger states these inequalities lead to the same quantum violation as the MABK family and, at the same time, the inequalities are able to detect the nonlocality in the entire entangled region. Furthermore, we present a generalization of the I3322 inequality to any $n$-partite case which is still tight, and of the 46 \ifmmode \acute{S}\else \'{S}\fi{}liwa's inequalities to the four-partite tight ones, by applying our iteration method to each inequality and its equivalence class.

arXiv:2109.05521•Physical Review A•Dec 6, 2023•3 citations

Characterization and Deduction of Bell-Type Inequalities

Enrico G. Beltrametti, Carlo Del Noce, Maciej Mączyński

Springer eBooks•Jan 1, 1995•5 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.
We investigate the Bell inequalities derived from the graph states with violations detectable even with the presence of noises, which generalizes the idea of error-correcting Bell inequalities [Phys. Rev. Lett. 101, 080501 (2008)]. Firstly we construct a family of valid Bell inequalities tolerating arbitrary ttt-qubit errors involving 3(t+1)3(t+1)3(t+1) qubits, e.g., 6 qubits suffice to tolerate single qubit errors. Secondly we construct also a single-error-tolerating Bell inequality with a violation that increases exponentially with the number of qubits. Exhaustive computer search for optimal error-tolerating Bell inequalities based on graph states on no more than 10 qubits shows that our constructions are optimal for single- and double-error tolerance.
Bell inequality is a vital tool to detect the nonlocal correlations, but the construction of it for multipartite systems is still a complicated problem. In this work, inspired via a decomposition of (n+1)(n+1)(n+1)-partite Bell inequalities into nnn-partite ones, we present a generalized iterative formula to construct nontrivial (n+1)(n+1)(n+1)-partite ones from the nnn-partite ones. Our iterative formulas recover the well-known Mermin-Ardehali-Belinsk\ifmmode \breve{\imath}\else \u{\i}\fi{}-Klyshko (MABK) and other families in the literature as special cases. Moreover, a family of ``dual-use'' Bell inequalities is proposed, in the sense that for the generalized Greenberger-Horne-Zeilinger states these inequalities lead to the same quantum violation as the MABK family and, at the same time, the inequalities are able to detect the nonlocality in the entire entangled region. Furthermore, we present a generalization of the I3322 inequality to any nnn-partite case which is still tight, and of the 46 \ifmmode \acute{S}\else \'{S}\fi{}liwa's inequalities to the four-partite tight ones, by applying our iteration method to each inequality and its equivalence class.