Tight upper bound of the maximal quantum violation of Gisin's elegant Bell inequality and its application in randomness certification
Dan-Dan Hu, Meng-Yan Li, Fen-Zhuo Guo, Yu-Kun Wang, Hai-Feng Dong, Fei, Gao

TL;DR
This paper establishes a precise upper limit for the quantum violation of Gisin's elegant Bell inequality, enabling improved device-independent randomness certification and revealing advantages over other inequalities in certain quantum states.
Contribution
It provides the first tight upper bound for the maximal quantum violation of Gisin's elegant Bell inequality and characterizes conditions for violation across various two-qubit states.
Findings
Tight upper bound for EBI violation derived.
Conditions for violation of EBI in pure and Werner states identified.
EBI shows advantages over CHSH and chained inequalities near maximally entangled states.
Abstract
The violation of a Bell inequality implies the existence of nonlocality, making device-independent randomness certification possible. This paper derives a tight upper bound for the maximal quantum violation of Gisin's elegant Bell inequality (EBI) for arbitrary two-qubit states, along with the constraints required to achieve this bound. This method provides the necessary and sufficient conditions for violating the EBI for several quantum states, including pure two-qubit states and the Werner states. The lower bound of certifiable global randomness is analyzed based on the tight upper bound of the EBI for pure two-qubit states, with a comparison to the Clauser-Horne-Shimony-Holt (CHSH) inequality. The relationship between the noise level and the lower bound of certifiable global randomness with respect to the Werner states is also explored, and the comparisons with both the CHSH…
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
TopicsBenford’s Law and Fraud Detection · Computability, Logic, AI Algorithms · Quantum Mechanics and Applications
