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

Laser Physics Letters

Multi-setting biased causal game with indefinite causal order

Juan Gu, Xiaojing Yan

Published May 1, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1088/1612-202x/ae7051

Related papers

Biased causal inseparable game

Some Sankar Bhattacharya, Manik Banik

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.

•Sep 9, 2015•0 citations

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

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

Tsirelson bounds for quantum correlations with indefinite causal order

Zixuan Liu, Giulio Chiribella

Quantum theory is in principle compatible with processes that violate causal inequalities, an analogue of Bell inequalities that constrain the correlations observed by sets of parties operating in a definite causal order. Since the introduction of causal inequalities, determining their maximum quantum violation, analogue to Tsirelson’s bound for Bell inequalities, has remained an open problem. Here we provide a general method for bounding the violation of arbitrary causal inequalities, establishing limits to the correlations achievable by arbitrary local experiments and by arbitrary quantum processes with indefinite causal order. We prove that the maximum violation is generally smaller than the algebraic maximum of the corresponding correlation, and determine Tsirelson-like bounds for a class of causal inequalities including some of the most paradigmatic examples. Our results motivate a search for physical principles characterizing the boundary of the set of quantum correlations with indefinite causal order. Quantum theory has been shown to be compatible with processes violating a definite causal order, but no detailed analysis of the maximum allowed degree of violation has been carried out so far. Here, the authors fill this gap by providing the analogue of Tsirelson’s bound for the violation of causal inequalities.

arXiv:2403.02749•Nature Communications•Apr 7, 2025•17 citations

Operational Causality Without Definite Order: Certifying Indefinite Causal Structure via a Causal Inequality and Causal Witness

Horace T. Crogman

Quantum processes with indefinite causal order challenge the classical assumption that operations must occur in a single fixed temporal sequence. The quantum switch provides a concrete setting in which two operation orders, A≺B and B≺A, are coherently controlled by a quantum system. In the strict process matrix formulation of the lazy guess your neighbour’s input (LGYNI) game, however, quantum theory, including the quantum switch, does not violate the standard causal inequality when probabilities are computed solely from local instruments. In this work, we study an extended control-assisted operational protocol in which the control system of the quantum switch is measured and used to define the task output. We compare increasingly expressive strategy classes, including single-qubit SU(2) operations, product target-ancilla operations, and entangling Cartan-decomposed two-qubit operations with generalized POVMs. Restricted models saturate or remain below the 3/4 fixed-order benchmark, whereas the optimized Cartan + ancilla + POVM strategy reaches Psuccext≈0.83596, demonstrating enhanced task performance within the extended protocol. The optimized strategy remains operationally no-signaling to numerical precision and retains its extended protocol advantage under more than 25% white noise admixture. These results identify the operational resources required for control-assisted quantum switch enhancement and support the view that indefinite temporal order can be used as a quantum informational resource without implying a breakdown of operational causality.

Quantum Reports•Jun 3, 2026•0 citations
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 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.
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.
Quantum theory is in principle compatible with processes that violate causal inequalities, an analogue of Bell inequalities that constrain the correlations observed by sets of parties operating in a definite causal order. Since the introduction of causal inequalities, determining their maximum quantum violation, analogue to Tsirelson’s bound for Bell inequalities, has remained an open problem. Here we provide a general method for bounding the violation of arbitrary causal inequalities, establishing limits to the correlations achievable by arbitrary local experiments and by arbitrary quantum processes with indefinite causal order. We prove that the maximum violation is generally smaller than the algebraic maximum of the corresponding correlation, and determine Tsirelson-like bounds for a class of causal inequalities including some of the most paradigmatic examples. Our results motivate a search for physical principles characterizing the boundary of the set of quantum correlations with indefinite causal order. Quantum theory has been shown to be compatible with processes violating a definite causal order, but no detailed analysis of the maximum allowed degree of violation has been carried out so far. Here, the authors fill this gap by providing the analogue of Tsirelson’s bound for the violation of causal inequalities.
Quantum processes with indefinite causal order challenge the classical assumption that operations must occur in a single fixed temporal sequence. The quantum switch provides a concrete setting in which two operation orders, A≺B and B≺A, are coherently controlled by a quantum system. In the strict process matrix formulation of the lazy guess your neighbour’s input (LGYNI) game, however, quantum theory, including the quantum switch, does not violate the standard causal inequality when probabilities are computed solely from local instruments. In this work, we study an extended control-assisted operational protocol in which the control system of the quantum switch is measured and used to define the task output. We compare increasingly expressive strategy classes, including single-qubit SU(2) operations, product target-ancilla operations, and entangling Cartan-decomposed two-qubit operations with generalized POVMs. Restricted models saturate or remain below the 3/4 fixed-order benchmark, whereas the optimized Cartan + ancilla + POVM strategy reaches Psuccext≈0.83596, demonstrating enhanced task performance within the extended protocol. The optimized strategy remains operationally no-signaling to numerical precision and retains its extended protocol advantage under more than 25% white noise admixture. These results identify the operational resources required for control-assisted quantum switch enhancement and support the view that indefinite temporal order can be used as a quantum informational resource without implying a breakdown of operational causality.