Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Biased causal inseparable game

Some Sankar Bhattacharya, Manik Banik

Published Sep 9, 2015• 0 citations
OpenAlex

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.

Related papers

Biased Non-Causal Game

Some Sankar Bhattacharya, Manik Banik

The standard formulation of quantum theory assumes that events are ordered is a background global causal structure. Recently in Ref.[$\href{http://www.nature.com/ncomms/journal/v3/n10/full/ncomms2076.html}{Nat. Commun. {\bf3}, 1092 (2012)}$], the authors have developed a new formalism, namely, the \emph{process matrix} formalism, which is locally in agreement with quantum physics but assumes no global causal order. They have further shown that there exist \emph{non-causal} correlations originating from \emph{inseparable} process matrices that violate a \emph{causal inequality} (CI) derived under the assumption that events are ordered with respect to some global causal relation. This CI can be understood as a guessing game, where two separate parties, say Alice and Bob, generate random bits (say input bit) in their respective local laboratories. Bob generates another random bit (say decision bit) which determines their goal: whether Alice has to guess Bob's bit or vice-verse. Here we study this causal game but with biased bits and derive a biased causal inequality (BCI). We then study the possibility of violation of this BCI by inseparable process matrices. Interestingly, we show that there exist \emph{inseparable} qubit process matrices that can be used to violate the BCI for an arbitrary bias in the decision bit. In such scenario, we also derive the maximal violation of the BCI under local operations involving traceless binary observables. However, for biased input bits, we find that there is a threshold bias beyond which no valid qubit process matrix can be used to violate the causal inequality under \emph{measurement-repreparation} type operation.

arXiv:1509.02721•Sep 9, 2015•6 citations

Multi-setting biased causal game with indefinite causal order

Juan Gu, Xiaojing Yan

Abstract In this paper, we introduce a two player multi-input biased causal game. For scenarios with bias in either control bits or input bits, we derive two biased causal inequalities by calculating the upper bound on the game’s winning probability. Within the process matrix framework, we prove that the corresponding causal inequality can always be violated when the control bit exhibits arbitrary bias. Furthermore, maximum violation is achieved when the set of local operations is restricted to those involving binary observables. For biased input bits, we identify a critical bias threshold: within this range, there exist valid process matrices that enable the violation of the causal inequality.

Laser Physics Letters•May 1, 2026•0 citations

A Bipartite Quantum Key Distribution Protocol Based on Indefinite Causal Order

Mateusz Leśniak, Ryszard Kukulski, Paulina Lewandowska +2 more

We propose a bipartite quantum key distribution (QKD) protocol based on causal nonseparability: the presence of a resource -- a process matrix -- that does not correspond to any definite causal order between two parties. In our protocol, Alice and Bob perform local operations arranged in a ``causal-order guessing game,'' whereby each round yields an 85.35\% probability of matching bits when the communication is undisturbed. This raw matching probability (or equivalently, a $\sim14.65\%$ error rate) is amenable to standard forward error-correction strategies. We further discuss the practical construction of the QKD protocol using indefinite causal order, where several different scenarios are deeply analyzed.

quant-pharXiv:2603.08204•Mar 10, 2026•2 citations

Bounding quantum correlations with indefinite causal order

Časlav Brukner

Causal inequalities are bounds on correlations obtained when operations take place in a causal sequence, i.e. in which the background time or definite causal structure pre-exists such that every operation is either in the future, in the past or space-like separated from any other operation. Recently, a framework was developed where quantum theory is assumed to be valid in local laboratories, but where no reference is made to any global causal relations between the operations in the laboratories. The framework was shown to allow for correlations that violate a bipartite causal inequality. Here we prove that the maximal violation of the causal inequality is upper bounded (analogously to the Tsirelson bound) under a restricted set of local operations involving binary observables. The bound is lower than what is algebraically possible.

arXiv:1404.0721•New Journal of Physics•Aug 18, 2015•41 citations

Indefinite causal order with output-signalling instruments

Ricardo Silveira, Patrick Andriolo, Davide Poderini +2 more

Quantum processes can exhibit indefinite causal order, allowing coherent superpositions of distinct orderings of events. Whether such processes generate genuinely noncausal statistics, however, depends not only on their global causal structure but also on the local operations available to the parties. Here, we restrict communication to the classical outcomes of local operations, yielding a causal polytope with new causal inequalities that can be violated using measure-and-reprepare, entanglement-breaking instruments requiring no coherent transmission through the laboratories. Using a semidefinite-programming framework, we bound the achievable violations and reveal noncausal correlations that satisfy all conventional input-signalling inequalities, demonstrating that restricting the information available for communication can uncover forms of indefinite causal order inaccessible under less restrictive operational assumptions.

quant-pharXiv:2609.31863•Sep 29, 2026•0 citations

The simplest causal inequalities and their violation

Cyril Branciard, Mateus Araújo, Adrien Feix +2 more

In a scenario where two parties share, act on and exchange some physical resource, the assumption that the parties' actions are ordered according to a definite causal structure yields constraints on the possible correlations that can be established. We show that the set of correlations that are compatible with a definite causal order forms a polytope, whose facets define causal inequalities . We fully characterize this causal polytope in the simplest case of bipartite correlations with binary inputs and outputs. We find two families of nonequivalent causal inequalities; both can be violated in the recently introduced framework of process matrices , which extends the standard quantum formalism by relaxing the implicit assumption of a fixed causal structure. Our work paves the way to a more systematic investigation of causal inequalities in a theory-independent way, and of their violation within the framework of process matrices.

arXiv:1508.01704•New Journal of Physics•Dec 23, 2015•128 citations
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.
The standard formulation of quantum theory assumes that events are ordered is a background global causal structure. Recently in Ref.[\href\href{http://www.nature.com/ncomms/journal/v3/n10/full/ncomms2076.html}{Nat. Commun. {\bf3}, 1092 (2012)}\href], the authors have developed a new formalism, namely, the \emph{process matrix} formalism, which is locally in agreement with quantum physics but assumes no global causal order. They have further shown that there exist \emph{non-causal} correlations originating from \emph{inseparable} process matrices that violate a \emph{causal inequality} (CI) derived under the assumption that events are ordered with respect to some global causal relation. This CI can be understood as a guessing game, where two separate parties, say Alice and Bob, generate random bits (say input bit) in their respective local laboratories. Bob generates another random bit (say decision bit) which determines their goal: whether Alice has to guess Bob's bit or vice-verse. Here we study this causal game but with biased bits and derive a biased causal inequality (BCI). We then study the possibility of violation of this BCI by inseparable process matrices. Interestingly, we show that there exist \emph{inseparable} qubit process matrices that can be used to violate the BCI for an arbitrary bias in the decision bit. In such scenario, we also derive the maximal violation of the BCI under local operations involving traceless binary observables. However, for biased input bits, we find that there is a threshold bias beyond which no valid qubit process matrix can be used to violate the causal inequality under \emph{measurement-repreparation} type operation.
Abstract In this paper, we introduce a two player multi-input biased causal game. For scenarios with bias in either control bits or input bits, we derive two biased causal inequalities by calculating the upper bound on the game’s winning probability. Within the process matrix framework, we prove that the corresponding causal inequality can always be violated when the control bit exhibits arbitrary bias. Furthermore, maximum violation is achieved when the set of local operations is restricted to those involving binary observables. For biased input bits, we identify a critical bias threshold: within this range, there exist valid process matrices that enable the violation of the causal inequality.
We propose a bipartite quantum key distribution (QKD) protocol based on causal nonseparability: the presence of a resource -- a process matrix -- that does not correspond to any definite causal order between two parties. In our protocol, Alice and Bob perform local operations arranged in a ``causal-order guessing game,'' whereby each round yields an 85.35\% probability of matching bits when the communication is undisturbed. This raw matching probability (or equivalently, a ∼14.65%\sim14.65\%∼14.65% error rate) is amenable to standard forward error-correction strategies. We further discuss the practical construction of the QKD protocol using indefinite causal order, where several different scenarios are deeply analyzed.
Causal inequalities are bounds on correlations obtained when operations take place in a causal sequence, i.e. in which the background time or definite causal structure pre-exists such that every operation is either in the future, in the past or space-like separated from any other operation. Recently, a framework was developed where quantum theory is assumed to be valid in local laboratories, but where no reference is made to any global causal relations between the operations in the laboratories. The framework was shown to allow for correlations that violate a bipartite causal inequality. Here we prove that the maximal violation of the causal inequality is upper bounded (analogously to the Tsirelson bound) under a restricted set of local operations involving binary observables. The bound is lower than what is algebraically possible.
Quantum processes can exhibit indefinite causal order, allowing coherent superpositions of distinct orderings of events. Whether such processes generate genuinely noncausal statistics, however, depends not only on their global causal structure but also on the local operations available to the parties. Here, we restrict communication to the classical outcomes of local operations, yielding a causal polytope with new causal inequalities that can be violated using measure-and-reprepare, entanglement-breaking instruments requiring no coherent transmission through the laboratories. Using a semidefinite-programming framework, we bound the achievable violations and reveal noncausal correlations that satisfy all conventional input-signalling inequalities, demonstrating that restricting the information available for communication can uncover forms of indefinite causal order inaccessible under less restrictive operational assumptions.
In a scenario where two parties share, act on and exchange some physical resource, the assumption that the parties' actions are ordered according to a definite causal structure yields constraints on the possible correlations that can be established. We show that the set of correlations that are compatible with a definite causal order forms a polytope, whose facets define causal inequalities . We fully characterize this causal polytope in the simplest case of bipartite correlations with binary inputs and outputs. We find two families of nonequivalent causal inequalities; both can be violated in the recently introduced framework of process matrices , which extends the standard quantum formalism by relaxing the implicit assumption of a fixed causal structure. Our work paves the way to a more systematic investigation of causal inequalities in a theory-independent way, and of their violation within the framework of process matrices.