We establish a correspondence between equivalence classes of agent-state policies for deterministic POMDPs and one-input process functions (the classical-deterministic limit of higher-order quantum operations). We use this correspondence to build a bridge between the agent-environment interaction in artificial intelligence, causal structure in the foundations of physics, and logic in computer science. We construct a *-autonomous category PF of types which supports an interpretation of one-step evaluation of policies, and multi-agent observation constraints, into cuts and monoidal products. In terms of types, we develop the correspondence further by identifying observation-independent decentralised POMDPs as the natural domain for the multi-input process functions used to model indefinite causality. We then prove a strict separation between general multi-input process function and definite-ordered process function performance on such dec-POMDPs, by finding an instance for which policies utilizing an indefinite causal structure can achieve greater finite-horizon rewards than policies which are restricted to a fixed background causal structure.
We establish a correspondence between equivalence classes of agent-state policies for deterministic POMDPs and one-input process functions (the classical-deterministic limit of higher-order quantum operations). We use this correspondence to build a bridge between the agent-environment interaction in artificial intelligence, causal structure in the foundations of physics, and logic in computer science. We construct a *-autonomous category PF of types which supports an interpretation of one-step evaluation of policies, and multi-agent observation constraints, into cuts and monoidal products. In terms of types, we develop the correspondence further by identifying observation-independent decentralised POMDPs as the natural domain for the multi-input process functions used to model indefinite causality. We then prove a strict separation between general multi-input process function and definite-ordered process function performance on such dec-POMDPs, by finding an instance for which policies utilizing an indefinite causal structure can achieve greater finite-horizon rewards than policies which are restricted to a fixed background causal structure.
Abstract Recent developments in quantum information science have revealed that the quantum circuit model, while foundational, does not exhaust the computational possibilities permitted by quantum mechanics. It allows for higher-order models of quantum computing based on an hierarchy of supermaps starting by transformations of quantum operations instead of quantum states. Experimental implementations of quantum SWITCH and quantum time flip, supermaps that allow for indefinite causal order and input-output direction of operations, respectively, and their applications have triggered a high interest on higher-order generalizations of quantum theory. In this paper, we review a framework for higher-order quantum theory with indefinite time direction based on an axiomatic type-theoretic characterization of quantum operations of arbitrary complexity. This framework can be naturally used to generalize process matrices, which introduce indefinite causal order of local agents’ operations into quantum theory, to include indefinite time direction.
Processes with indefinite causal orders (ICOs), such as the quantum switch, are higher-order quantum processes that superpose the order in which quantum operations are performed. Such coherent control yields computational advantages but is not faithfully captured by existing quantum programming languages: either they are restricted to the unitary case, and thus cannot combine ICOs with measurement, or they treat coherent control nonlinearly. In both cases, they do not realize the full computational power of ICOs. We introduce a higher-order quantum functional language that supports general quantum computation, not merely the permutation of channels, and whose linear type system allows quantum control to be well-defined beyond the unitary case, on arbitrary quantum channels. We equip this language with a small-step operational semantics that synchronizes measurement outcomes across superposed branches, using device references and a memory function. We also give a denotational semantics by means of completely positive maps. With linearity as the only constraint, some well-typed terms would denote unphysical maps. We therefore impose a typing discipline that goes beyond linearity, and interpret programs in the causal category Caus[CPM], under which every well-typed program is physically meaningful, a property that can be checked statically and efficiently. We prove soundness, and study the language's expressive power: it can express every quantum channel at first order, and at second order a large subclass of the so-called quantum circuits with quantum control (QC-QCs), containing the quantum switch. Last but not least, we show that this language is well-designed enough to be extended to the nonlinear setting with recursion.
We present a categorical construction for modelling causal structures within a general class of process theories that include the theory of classical probabilistic processes as well as quantum theory. Unlike prior constructions within categorical quantum mechanics, the objects of this theory encode fine-grained causal relationships between subsystems and give a new method for expressing and deriving consequences for a broad class of causal structures. We show that this framework enables one to define families of processes which are consistent with arbitrary acyclic causal orderings. In particular, one can define one-way signalling (a.k.a. semi-causal) processes, non-signalling processes, and quantum n-combs. Furthermore, our framework is general enough to accommodate recently-proposed generalisations of classical and quantum theory where processes only need to have a fixed causal ordering locally, but globally allow indefinite causal ordering. To illustrate this point, we show that certain processes of this kind, such as the quantum switch, the process matrices of Oreshkov, Costa, and Brukner, and a classical three-party example due to Baumeler, Feix, and Wolf are all instances of a certain family of processes we refer to as SOCn in the appropriate category of higher-order causal processes. After defining these families of causal structures within our framework, we give derivations of their operational behaviour using simple, diagrammatic axioms.
In quantum causality and quantum information, there is a vast landscape of abstract quantum protocols permitting cyclic or non-acyclic causal structures between operations, including frameworks for indefinite causal order and higher-order quantum processes such as process matrices. A longstanding open question is what is the largest class of abstract processes that admit physical realisations without post-selection. In this work, we provide a rigorous answer using a top-down approach grounded in relativistic causality principles. Building on the framework of causal boxes, which characterise the most general quantum information-processing protocols compatible with fixed background spacetimes, we formalise additional constraints (Acting Once + Local Order) capturing the closed-laboratory assumptions of the process matrix framework at a fine-grained spacetime level. We prove that any protocol in a classical acyclic spacetime satisfying these conditions is behaviourally equivalent to a quantum circuit with quantum control of causal order (QC-QC), providing a top-down derivation of QC-QCs from physical principles. Our results show that QC-QCs constitute precisely the class of higher-order quantum processes, including those with indefinite order, that can be physically realised within classical spacetime, ruling out more general non-causal processes under the closed-labs assumption. This clarifies the relationship between abstract higher-order process matrix frameworks and experimentally accessible quantum protocols, as well as the interplay between coarse-grained cyclic and fine-grained acyclic operational causal structures. We also develop characterisation techniques for process box protocols that lead to new causality-based open questions concerning spacetime quantum protocols and relativistic quantum experiments.
We present a categorical construction for modelling causal structures within a general class of process theories that include the theory of classical probabilistic processes as well as quantum theory. Unlike prior constructions within categorical quantum mechanics, the objects of this theory encode fine-grained causal relationships between subsystems and give a new method for expressing and deriving consequences for a broad class of causal structures. We show that this framework enables one to define families of processes which are consistent with arbitrary acyclic causal orderings. In particular, one can define one-way signalling (a.k.a. semi-causal) processes, non-signalling processes, and quantum n-combs. Furthermore, our framework is general enough to accommodate recently-proposed generalisations of classical and quantum theory where processes only need to have a fixed causal ordering locally, but globally allow indefinite causal ordering. To illustrate this point, we show that certain processes of this kind, such as the quantum switch, the process matrices of Oreshkov, Costa, and Brukner, and a classical three-party example due to Baumeler, Feix, and Wolf are all instances of a certain family of processes we refer to as SOCn in the appropriate category of higher-order causal processes. After defining these families of causal structures within our framework, we give derivations of their operational behaviour using simple, diagrammatic axioms. Comment: Extended version of a LICS 2017 paper with the same title
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.