Causal loops escape paradoxes if they generate valid probabilities under arbitrary independent local interventions. We show that a deterministic classical process is logically consistent if and only if it contains no signaling loops: cyclic signaling is forbidden but cyclic causation is not, allowing indefinite causal order. Logical consistency is then found to hold exactly when the list of events of a process is pairwise exclusive and complete, providing the first event-based, intervention-free, non-recursive characterization of consistent causal loops. Our results repair a previously introduced intervention-free criterion that misses global loops and reveal that what makes deterministic classical communications without causal order consistent is a multipartite form of Specker's principle: if any two of several questions can be answered jointly, so can all of them.
AI Summary
The paper asks how to characterize logical consistency of deterministic classical communication processes without testing every independent local intervention. A process function $\mathbf w:\mathcal A\to\mathcal X$ is consistent when composition with any collection of local response functions has exactly one fixed point, excluding both contradictions and multiple self-consistent outcomes while permitting indefinite causal order.
Its main result is an event-based characterization: the events $\{(\mathbf a\mid\mathbf w(\mathbf a))\}$ define a valid process exactly when every distinct pair is exclusive—some party receives the same input but produces different outputs. More generally, an event list characterizes a process function iff it is pairwise exclusive and contains $|\mathcal A|$ events. The proof connects nonexclusive pairs to interventions with multiple fixed points and uses an existing equivalence between excluding multiple fixed points and consistency. This links process functions to local orthogonality and a multipartite reading of Specker’s principle.
The paper also shows why output-fixing reductions miss global loops, using cyclic Guess-Your-Neighbor’s-Input maps as counterexamples. It supplies corrected recursive criteria and translates process-matrix linear constraints into Fourier “phase-erasure” conditions for arbitrary finite output alphabets, recovering parity-erasure constraints for binary outputs.
The results concern deterministic classical processes, not a general characterization of probabilistic or quantum processes. The added full-output process-matrix constraint is not independently a diagnostic of global loops when other defects coexist. Physical realizability of the full class, beyond postselection-based simulation, and the proposed application to admissible causal structures remain open.
Little sign of AI-generated textOverclaims
Error found: The Discussion incorrectly states that complete Boolean event lists are always pairwise exclusive: the paper's own GYNI map has a complete eight-event list containing the nonexclusive pair (000|000) and (111|111).
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
Causal loops escape paradoxes if they generate valid probabilities under arbitrary independent local interventions. We show that a deterministic classical process is logically consistent if and only if it contains no signaling loops: cyclic signaling is forbidden but cyclic causation is not, allowing indefinite causal order. Logical consistency is then found to hold exactly when the list of events of a process is pairwise exclusive and complete, providing the first event-based, intervention-free, non-recursive characterization of consistent causal loops. Our results repair a previously introduced intervention-free criterion that misses global loops and reveal that what makes deterministic classical communications without causal order consistent is a multipartite form of Specker's principle: if any two of several questions can be answered jointly, so can all of them.
The paper asks how to characterize logical consistency of deterministic classical communication processes without testing every independent local intervention. A process function w:A→X is consistent when composition with any collection of local response functions has exactly one fixed point, excluding both contradictions and multiple self-consistent outcomes while permitting indefinite causal order.
Its main result is an event-based characterization: the events {(a∣w(a))} define a valid process exactly when every distinct pair is exclusive—some party receives the same input but produces different outputs. More generally, an event list characterizes a process function iff it is pairwise exclusive and contains ∣A∣ events. The proof connects nonexclusive pairs to interventions with multiple fixed points and uses an existing equivalence between excluding multiple fixed points and consistency. This links process functions to local orthogonality and a multipartite reading of Specker’s principle.
The paper also shows why output-fixing reductions miss global loops, using cyclic Guess-Your-Neighbor’s-Input maps as counterexamples. It supplies corrected recursive criteria and translates process-matrix linear constraints into Fourier “phase-erasure” conditions for arbitrary finite output alphabets, recovering parity-erasure constraints for binary outputs.
The results concern deterministic classical processes, not a general characterization of probabilistic or quantum processes. The added full-output process-matrix constraint is not independently a diagnostic of global loops when other defects coexist. Physical realizability of the full class, beyond postselection-based simulation, and the proposed application to admissible causal structures remain open.
Bell non-local correlations cannot be naturally explained in a fixed causal structure. This serves as a motivation for considering models where no global assumption is made beyond logical consistency. The assumption of a fixed causal order between a set of parties, together with free randomness, implies device-independent inequalities—just as the assumption of locality does. It is known that local validity of quantum theory is consistent with violating such inequalities. Moreover, for three parties or more, even the (stronger) assumption of local classical probability theory plus logical consistency allows for violating causal inequalities. Here, we show that a classical environment (with which the parties interact), possibly containing loops, is logically consistent if and only if whatever the involved parties do, there is exactly one fixed-point, the latter being representable as a mixture of deterministic fixed-points. We further show that the non-causal view allows for a model of computation strictly more powerful than computation in a world of fixed causal orders.
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.
Bell scenarios are multipartite scenarios that exclude any signalling between parties. This leads to a strict hierarchy of classical, quantum, and non-signalling correlations in such scenarios. Here we consider a minimal relaxation of non-signalling: each party is allowed to receive a system once, implement any local intervention on it, and send out the resulting system once. Crucially, unlike Bell, we make no global assumption about causal relations between parties, e.g., they could be embedded in some exotic spacetime with indefinite causal order. We do make a causal assumption local to each party, i.e., the input received by it causally precedes the output it sends out. We then ask: Can we device-independently certify the nonclassicality of multipartite correlations in such scenarios, just as Bell inequality violations do so in Bell scenarios? A priori, this is not clear: without some assumptions on the underlying physics (e.g., non-signalling), parties can realize arbitrary correlations. We therefore make a minimal assumption of logical consistency on the underlying physics, i.e., it must be free of time-travel antinomies without imposing any restrictions on local interventions of the parties. We then define antinomicity as a device-independent notion of nonclassicality and prove a strict hierarchy between correlation sets based on their antinomicity. An antinomic correlation cannot be explained by a classical physical theory compatible with free local interventions on pain of logical contradictions in the theory. On the other hand, parties exchanging quantum systems can witness antinomicity while respecting logical consistency. Antinomicity reduces to Bell nonlocality for non-signalling parties. It also resolves a conceptual puzzle, namely, the failure of causal inequalities as witnesses of nonclassicality: antinomicity implies causal inequality violations, but not conversely.
Quantum theory is in principle compatible with scenarios where physical processes occur in an indefinite order, potentially yielding advantages in a broad range of information processing tasks. However, advantages in communication, the most basic form of information processing, have so far remained controversial and hard to prove. Here we provide a framework for assessing the role of causal order in communication, by comparing different causal structures under the constraint that the allowed operations must not generate signaling from signaling-incapable devices. Using this framework, we establish a clear-cut advantage of indefinite causal order, and, at the same time, we identify a series of fundamental limits to the communication power of causal structures in quantum mechanics. Notably, we find that a special form of indefinite causal order, obtained by coherently controlling the order of two processes, enhances the transmission of classical messages in a one-shot scenario, but no quantum operation with indefinite order can offer advantages over shared entanglement when asymptotically many uses of the same communication device are employed. Overall, our results unveil non-trivial relations between communication, causal order, entanglement, and no-signaling quantum processes.
By relating and ordering events, causality constitutes a pivotal feature of our world. On the one hand, there are information-theoretic notions of causality defined in terms of the information processing ability of agents and on the other hand, there are relativistic notions of causality tied to a spacetime. In this thesis, we improve upon a framework introduced by V. Vilasini and R. Colbeck in PRA, 106, 032204 (2022) and PRL, 129, 110401 (2022) for connecting these notions, where the possibility of operationally detectable causal loops embedded in (1+1)-Minkowski spacetime without superluminal signalling was demonstrated. In the first part, we take the information-theoretic point of view, where the concept of higher-order (HO) affects relations was proposed to generically model signalling in the presence of cyclic, fine-tuned and non-classical causal influences. We establish new properties of HO affects relations and apply them to infer causal structures. We then demonstrate a complete and constructive way to detect causal loops from a set of HO affects relations. In the second part, we study the embedding of information-theoretic causal structures into partially ordered spacetimes. We propose stability conditions on the spacetime embedding to rule out a class of operationally detectable loops that cannot be ruled out by the principle of no-signalling (outside the relativistic future) alone. We then propose novel order-theoretic properties that we conjecture to hold in Minkowski spacetime with d≥2 spatial dimensions. This would imply that in contrast to (1+1)-Minkowski spacetime, in higher dimensions, the no-signalling principle is indeed sufficient for ruling out this class of loops. Finally, we introduce a relation which allows for causal inference through knowledge about the absence of signalling relations and we relate it to novel order-theoretic features of spacetime.
It is well known that if one assumes quantum theory to hold locally, then processes with indefinite causal order and cyclic causal structures become feasible.Here we study qualitative limitations on causal structures and correlations imposed by local quantum theory.We find a necessary graph-theoretic criterion-the "siblings-on-cycles" property-for a causal structure to be admissible: only such causal structures admit a realization consistent with local quantum theory.We conjecture that this property is moreover sufficient.This conjecture is motivated by an explicit construction of quantum causal models, and is supported by numerical calculations.We show that these causal models, in a restricted setting, are indeed consistent.We identify two sets of causal structures that, in the classical-deterministic case, forbid and give rise to noncausal correlations, respectively.