Biased causal inseparable game
Some Sankar Bhattacharya, Manik Banik
Abstract
We study the biased version of the \emph{causal inseparable} game introduced in [Nat. Commun. {\bf3}, 1092 (2012)]. Two separated parties, Alice and Bob, generate biased bits (say input bit) in their respective local laboratories. Bob generates another biased bit (say decision bit) which determines their goal: whether Alice has to guess Bob's bit or vice-verse. Under the assumption that events are ordered with respect to some global causal relation, we show that the success probability of this biased causal game is upper bounded, giving rise to \emph{biased causal inequality} (BCI). However there exist valid \emph{inseparable} process matrices that violate the BCI for arbitrary bias in the decision bit. We provide a \emph{causal witness} that can detect the causal inseparability of these process matrices. We also derive the maximal violation of the BCI under local operations involving traceless binary observables. However for biased input bit we find that there is a threshold bias beyond which no valid qubit process matrix can violate the causal inequality under \emph{measurement-repreparation} type operation.