Pseudo-telepathy: input cardinality and Bell-type inequalities

Article Article scientifique Article Pseudo-telepathy: input cardinality and Bell-type inequalities eng 2007 author Gisin Nicolas 23716 author Methot André 638055 author Scarani Valerio 133558 525-534 10.1142/S021974990700289X 0219-7499 quant-ph/0610175 Pseudo-telepathy is the most recent form of rejection of locality. Many of its properties have already been discovered: for instance, the minimal entanglement, as well as the minimal cardinality of the output sets, have been characterized. This paper contains two main results. First, we prove that no bipartite pseudo-telepathy game exists, in which one of the partners receives only two questions; as a corollary, we show that the minimal "input cardinality", that is, the minimal number of questions required in a bipartite pseudo-telepathy game, is 3x3. Second, we study the Bell-type inequality derived from the pseudo-telepathy game known as the Magic Square game: we demonstrate that it is a tight inequality for 3 inputs and 4 outputs on each side and discuss its weak resistance to noise. Pseudo-telepathy Bell inequalities Input cardinality Dewey 500.2 arxiv quant-ph 35 Groupe de physique appliquée 135 false International journal of quantum information 5 4 627d5c48-7ae9-4ce3-9df4-0ca736da0ac3 Article Public quant-ph_0610175v1.pdf 170757 application/pdf openAccess Faculté des sciences / Section de physique / Groupe de physique appliquée

Title	Published in	Access level	OA Policy	Year	Views	Downloads

Pseudo-telepathy: input cardinality and Bell-type inequalities	International journal of quantum information			2007	741	2,408

Archive ouverte UNIGE

Methot, André