To study which are the most general causal structures which are compatible with local quantum mechanics, Oreshkov e t a l . \cite{oreshkov12} introduced the notion of a process: a resource shared between some parties that allows for quantum communication between them without a predetermined causal order. These processes can be used to perform several tasks that are impossible in standard quantum mechanics: they allow for the violation of causal inequalities, and provide an advantage for computational and communication complexity. Nonetheless, no process that can be used to violate a causal inequality is known to be physically implementable. There is therefore considerable interest in determining which processes are physical and which are just mathematical artefacts of the framework. Here we make key progress in this direction by proposing a purification postulate: processes are physical only if they are purifiable. We derive necessary conditions for a process to be purifiable, and show that several known processes do not satisfy them.
To study which are the most general causal structures which are compatible with local quantum mechanics, Oreshkov e t a l . \cite{oreshkov12} introduced the notion of a process: a resource shared between some parties that allows for quantum communication between them without a predetermined causal order. These processes can be used to perform several tasks that are impossible in standard quantum mechanics: they allow for the violation of causal inequalities, and provide an advantage for computational and communication complexity. Nonetheless, no process that can be used to violate a causal inequality is known to be physically implementable. There is therefore considerable interest in determining which processes are physical and which are just mathematical artefacts of the framework. Here we make key progress in this direction by proposing a purification postulate: processes are physical only if they are purifiable. We derive necessary conditions for a process to be purifiable, and show that several known processes do not satisfy them.
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.
Can quantum computation become more powerful when operations do not need to follow a definite causal order? We study this question in the process matrix formalism of Oreshkov et al. (Nature Communications, 2012), which allows quantum operations to be connected without a fixed global order. In the computational model, a quantum circuit succinctly describes a process matrix, and the algorithm is given access to its generated channel, with computational cost measured by the size of the generating circuit.
We give polynomial-time algorithms in two settings. First, general process matrix computation suffices to solve every problem in NP. The valid processes used by our algorithm satisfy the purification postulate of Araújo et al. (Quantum, 2017), and their generated channels are unitary, although their generating circuits are not. Second, requiring the process matrices themselves to be pure, we give a polynomial-time algorithm for unique-sink orientation, a general problem capturing several longstanding computational problems in optimization. Our unitary generators are constructed explicitly and efficiently. Assuming that unique-sink orientation has no quantum polynomial-time algorithm, our result shows that indefinite causal order can provide computational power beyond BQP within the process matrix formalism, even while preserving unitarity.
Recent frameworks describing quantum mechanics in the absence of a global causal order admit the existence of causally indefinite processes, where it is impossible to ascribe causal order for events A and B. These frameworks even allow for processes that violate so-called causal inequalities, which are analogous to Bell's inequalities.However, the physicality of these exotic processes is, in the general case, still under debate, bringing into question their foundational relevance.While it is known that causally indefinite processes can be probabilistically realized by means of a quantum circuit, along with an additional conditioning event C, concrete insights into the ontological meaning of such implementation schemes have heretofore been limited.Here, we show that causally indefinite processes can be realized with schemes where C serves only as a classical flag heralding which causally indefinite process was realized.We then show that there are processes where any pure conditioning measurement of C leads to a causally indefinite process for A and B, thus establishing causal indefiniteness as a basis-independent quantity.Finally, we demonstrate that quantum mechanics allows for phenomena where C can deterministically decide whether A comes before B or vice versa, without signaling to either.This is akin to Wheeler's famous delayedchoice experiment establishing definite causal order in quantum mechanics as an instrument-dependent property.
The idea that events obey a definite causal order is deeply rooted in our understanding of the world and at the basis of the very notion of time. But where does causal order come from, and is it a necessary property of nature? Here, we address these questions from the standpoint of quantum mechanics in a new framework for multipartite correlations that does not assume a pre-defined global causal structure but only the validity of quantum mechanics locally. All known situations that respect causal order, including space-like and time-like separated experiments, are captured by this framework in a unified way. Surprisingly, we find correlations that cannot be understood in terms of definite causal order. These correlations violate a 'causal inequality' that is satisfied by all space-like and time-like correlations. We further show that in a classical limit causal order always arises, which suggests that space-time may emerge from a more fundamental structure in a quantum-to-classical transition. Causal order is a concept that is engrained in the standard understanding of time, both in classical and quantum mechanics. Oreshkovet al.generalize the standard formalism of quantum theory to a framework with no pre-existing causal order, and find a new class of correlations that have no analogue in the classical world.
Born in the intersection between quantum mechanics and general relativity, indefinite causal structure is the idea that in the continuum of time, some sets of events do not have an inherent causal order between them. Process matrices, introduced by Oreshkov, Costa and Brukner (Nature Communications, 2012), define quantum information processing with indefinite causal structure -- a generalization of the operations allowed in standard quantum information processing, and to date, are the most studied such generalization.
Araujo et al. (Physical Review A, 2017) defined the computational complexity of process matrices, and showed that polynomial-time process matrix computation is equivalent to standard polynomial-time quantum computation with access to a weakening of post-selection Closed Timelike Curves (CTCs), that are restricted to be linear. Araujo et al. accordingly defined the complexity class for efficient process matrix computation as BQPℓCTC (which trivially contains BQP), and posed the open question of whether BQPℓCTC contains computational tasks that are outside BQP.
In this work we solve this open question under a widely believed hardness assumption, by showing that NP⊆BQPℓCTC. Our solution is captured by an even more restricted subset of process matrices that are purifiable (Araujo et al., Quantum, 2017), which (1) is conjectured more likely to be physical than arbitrary process matrices, and (2) is equivalent to polynomial-time quantum computation with access to unitary (which are in particular linear) post-selection CTCs. Conceptually, our work shows that the previously held belief, that non-linearity is what enables CTCs to solve NP, is false, and raises the importance of understanding whether purifiable process matrices are physical or not.
The idea that events are equipped with a partial causal order is central to our understanding of physics in the tested regimes: given two pointlike events A and B , either A is in the causal past of B , B is in the causal past of A , or A and B are space-like separated. Operationally, the meaning of these order relations corresponds to constraints on the possible correlations between experiments performed in the vicinities of the respective events: if A is in the causal past of B , an experimenter at A could signal to an experimenter at B but not the other way around, while if A and B are space-like separated, no signaling is possible in either direction. In the context of a concrete physical theory, the correlations compatible with a given causal configuration may obey further constraints. For instance, space-like correlations in quantum mechanics arise from local measurements on joint quantum states, while time-like correlations are established via quantum channels. Similarly to other variables, however, the causal order of a set of events could be random, and little is understood about the constraints that causality implies in this case. A main difficulty concerns the fact that the order of events can now generally depend on the operations performed at the locations of these events, since, for instance, an operation at A could influence the order in which B and C occur in A ’s future. So far, no formal theory of causality compatible with such dynamical causal order has been developed. Apart from being of fundamental interest in the context of inferring causal relations, such a theory is imperative for understanding recent suggestions that the causal order of events in quantum mechanics can be indefinite. Here, we develop such a theory in the general multipartite case. Starting from a background-independent definition of causality, we derive an iteratively formulated canonical decomposition of multipartite causal correlations. For a fixed number of settings and outcomes for each party, these correlations form a polytope whose facets define causal inequalities. The case of quantum correlations in this paradigm is captured by the process matrix formalism. We investigate the link between causality and the closely related notion of causal separability of quantum processes, which we here define rigorously in analogy with the link between Bell locality and separability of quantum states. We show that causality and causal separability are not equivalent in general by giving an example of a physically admissible tripartite quantum process that is causal but not causally separable. We also show that there are causally separable quantum processes that become non-causal if extended by supplying the parties with entangled ancillas. This motivates the concepts of extensibly causal and extensibly causally separable (ECS) processes, for which the respective property remains invariant under extension. We characterize the class of ECS quantum processes in the tripartite case via simple conditions on the form of the process matrix. We show that the processes realizable by classically controlled quantum circuits are ECS and conjecture that the reverse also holds.