Relevant multi-setting tight Bell inequalities for qubits and qutrits
Dong-Ling Deng, Zi-Sui Zhou, and Jing-Ling Chen

TL;DR
This paper develops new multi-setting tight Bell inequalities for qubits and qutrits, extending previous methods and demonstrating their relevance and maximal violation by certain entangled states.
Contribution
It introduces novel multi-setting tight Bell inequalities for qubits and qutrits, including the first three-setting inequality for two qutrits, based on generalized construction methods.
Findings
New multi-setting Bell inequalities relevant to CHSH and CG inequalities.
First three-setting tight Bell inequality for two qutrits.
Maximal violation achieved by nonmaximally entangled states.
Abstract
In the celebrated paper [J. Phys. A: Math. Gen. 37, 1775 (2004)], D. Collins and N. Gisin presented for the first time a three setting Bell inequality (here we call it CG inequality for simplicity) which is relevant to the Clauser-Horne-Shimony-Holt (CHSH) inequality. Inspired by their brilliant ideas, we obtained some multi-setting tight Bell inequalities, which are relevant to the CHSH inequality and the CG inequality. Moreover, we generalized the method in the paper [Phys.Rev. A 79, 012115 (2009)] to construct Bell inequality for qubits to higher dimensional system. Based on the generalized method, we present, for the first time, a three setting tight Bell inequality for two qutrits, which is maximally violated by nonmaximally entangled states and relevant to the Collins-Gisin- Linden-Massar-Popescu inequality.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Information and Cryptography · Quantum Computing Algorithms and Architecture
