Generalized Iterative Formula for Bell Inequalities

Abstract

Bell inequalities are a vital tool to detect the nonlocal correlations, but the construction of them 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-Belinski{\uı}-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 non-locality in the entire entangled region. Furthermore, we present generalizations of the the I3322 inequality to any $n$-partite case which are still tight, and of the $46$ Śliwa's inequalities to the four-partite tight ones, by applying our iteration method to each inequality and its equivalence class.

References in corpus (8)

• Certified randomness in quantum physics
• Bell Inequalities for Graph States
• Device-independent quantum key distribution with asymmetric CHSH inequalities
• On the Relationship between Convex Bodies Related to Correlation Experiments with Dichotomic Observables
• Converting contextuality into nonlocality
• Two-Setting Bell Inequalities for Many Qubits
• Explicit form of correlation function three-settings tight Bell inequalities for three qubits
• Finding optimal Bell inequalities using the cone-projection technique