An elegant proof of self-testing for multipartite Bell inequalities
Abstract
The predictions of quantum theory are incompatible with local-causal explanations. This phenomenon is called Bell non-locality and is witnessed by violation of Bell-inequalities. The maximal violation of certain Bell-inequalities can only be attained in an essentially unique manner. This feature is referred to as self-testing and constitutes the most accurate form of certification of quantum devices. While self-testing in bipartite Bell scenarios has been thoroughly studied, self-testing in the more complex multipartite Bell scenarios remains largely unexplored. This work presents a simple and broadly applicable self-testing argument for N-partite correlation Bell inequalities with two binary outcome observables per party. Our proof technique forms a generalization of the Mayer-Yao formulation and is not restricted to linear Bell-inequalities, unlike the usual sum of squares method. To showcase the versatility of our proof technique, we obtain self-testing statements for N party Mermin-Ardehali-Belinskii-Klyshko (MABK) and Werner-Wolf-Weinfurter-\.Zukowski-Brukner (WWW\.ZB) family of linear Bell inequalities, and Uffink's family of N party quadratic Bell-inequalities.
Keywords
Cite
@article{arxiv.2202.06908,
title = {An elegant proof of self-testing for multipartite Bell inequalities},
author = {Ekta Panwar and Palash Pandya and Marcin Wieśniak},
journal= {arXiv preprint arXiv:2202.06908},
year = {2023}
}
Comments
First draft, comments are welcome