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.
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.
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.