Strength of the nonlocality of two-qubit entangled state and its applications
Anuma Garg, Satyabrata Adhikari

TL;DR
This paper introduces a new measure called the strength of non-locality ($S_{NL}$) for two-qubit entangled states using XOR games, compares it with existing measures, and explores its applications in quantum teleportation and multi-qubit non-locality linkage.
Contribution
It defines a novel quantifier of non-locality based on XOR game success probability and refines it to detect non-locality undetected by traditional Bell inequalities.
Findings
$S_{NL}$ correlates with the maximum winning probability in XOR games.
Modified $S_{NL}$ can detect non-locality in states undetected by CHSH.
Applications demonstrated in quantum teleportation and multi-qubit non-locality linking.
Abstract
Non-locality is a feature of quantum mechanics that cannot be explained by local realistic theory. It can be detected by the violation of Bell's inequality. In this work, we have considered the evaluation of Bell's inequality with the help of the XOR game. In the XOR game, a two-qubit entangled state is shared between the two distant players. It may generate a non-local correlation between the players which contributes to the maximum probability of winning of the game. We have aimed to determine the strength of the non-locality through XOR game. Thus, we have defined a quantity called the strength of non-locality, purely on the basis of the maximum probability of winning of the XOR game. We have also derived the relation between the introduced quantity and the quantity introduced in \cite{horo3}, to study the non-locality of a two-qubit entangled state problem in…
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 Information and Cryptography · Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
