Classical correlations without predefined causal order arise from processes where parties manipulate random variables, and where the order of these interactions is not predefined. No assumption on the causal order of the parties is made, but the processes are restricted to be logically consistent under any choice of the parties' operations. It is known that for three parties or more, this set of processes is larger than the set of processes achievable in a predefined ordering of the parties. Here, we model all classical processes without predefined causal order geometrically and find that the set of such processes forms a polytope. Additionally, we model a smaller polytope—the deterministic-extrema polytope—where all extremal points represent deterministic processes. This polytope excludes probabilistic processes that must be—quite unnaturally—fine-tuned, because any variation of the weights in a decomposition into deterministic processes leads to a logical inconsistency.
Quantum theory in a global spacetime gives rise to nonlocal correlations, which cannot be explained causally in a satisfactory way; this motivates the study of theories with reduced global assumptions. Oreshkov, Costa, and Brukner [ Nat. Commun. 3, 1092 (2012)] proposed a framework in which quantum theory is valid locally but where, at the same time, no global spacetime, i.e., predefined causal order, is assumed beyond the absence of logical paradoxes. It was shown for the two-party case, however, that a global causal order always emerges in the classical limit. Quite naturally, it has been conjectured that the same also holds in the multiparty setting. We show that, counter to this belief, classical correlations locally compatible with classical probability theory exist that allow for deterministic signaling between three or more parties incompatible with any predefined causal order.
One way to study the physical plausibility of closed timelike curves (CTCs) is to examine their computational power. This has been done for Deutschian CTCs (D-CTCs) and postselection CTCs (P-CTCs), with the result that they allow for the efficient solution of problems in PSPACE and PP, respectively. Since these are extremely powerful complexity classes, which are not expected to be solvable in reality, this can be taken as evidence that these models for CTCs are pathological. This problem is closely related to the nonlinearity of this models, which also allows, for example, cloning quantum states, in the case of D-CTCs, or distinguishing nonorthogonal quantum states, in the case of P-CTCs. In contrast, the process matrix formalism allows one to model indefinite causal structures in a linear way, getting rid of these effects and raising the possibility that its computational power is rather tame. In this paper, we show that process matrices correspond to a linear particular case of P-CTCs, and therefore that its computational power is upperbounded by that of PP. We show, furthermore, a family of processes that can violate causal inequalities but nevertheless can be simulated by a causally ordered quantum circuit with only a constant overhead, showing that indefinite causality is not necessarily hard to simulate.
The paradigmatic view where information is seen as a more fundamental concept than the laws of physics leads to a different understanding of spacetime, where the causal order of events emerges from correlations between random variables representing physical quantities. In particular, such an information-theoretic approach does not enforce a global spacetime structure. By following this path, we conclude that perfect signaling correlations among three parties are possible which do not obey the restrictions imposed by global spacetime. We show this using a recent framework based on the sole assumptions that locally, quantum theory is valid and random variables can be described by probability distributions. Our result is of zero-error type and can be seen as an analog to a three-party appearance of quantum non-locality which manifests itself by satisfying a condition with certainty, whereas the same is impossible for any local theory.
Superposition of two or more states is one of the most fundamental concepts of quantum mechanics and provides a basis for several advantages offered by quantum information processing. This work reports the experimental demonstration of two‐way communication between two distant parties that can exchange only a single particle once, an impossible task in classical physics. This is achieved through preparation of a single photon in a coherent superposition of the two parties' locations. Furthermore, it is shown that this concept allows the parties to perform secure and anonymous quantum communication employing one particle per transmitted bit. These important features can lead to the realization of new quantum communication schemes, which are simultaneously anonymous, secure, and resource‐efficient.