Indefinite causal order extends the conventional circuit paradigm by allowing local quantum operations to be connected without a predetermined global order. Within the process-matrix framework, it is characterized by causal nonseparability, whereas extensible causal separability (ECS) requires that, under arbitrary input-ancilla extensions, a process admit a recursive decomposition into components, each compatible with a particular operation acting first. Quantum circuits with classical control of causal order (QC-CC), in which previous outcomes dynamically determine which operation acts next, are known to generate ECS processes, but whether every ECS process admits such a realization has remained a longstanding open problem. We settle it through a generalized teleportation construction that realizes every multipartite ECS process as a QC-CC. We further establish consistency between ECS definitions for trivial and nontrivial global past and future systems. These results provide ECS with an exact operational interpretation and identify QC-CC as the complete circuit structure underlying this class of processes.
AI Summary
The paper asks whether every extensibly causally separable (ECS) process matrix can be realized by a quantum circuit with classical control of causal order (QC-CC). ECS requires recursive causal separability to survive arbitrary shared input-ancilla extensions; QC-CC circuits choose the next unused operation dynamically through internal instrument outcomes. The inclusion $\mathrm{QC\text{-}CC}\subseteq\mathrm{ECS}$ was known, while the converse remained open.
It proves $\mathrm{ECS}_N^{P\to F}=\mathrm{QC\text{-}CC}_N^{P\to F}$ for every finite number of parties $N$ and finite-dimensional input, output, global-past, and global-future systems. Consequently, ECS membership has a finite semidefinite-programming characterization: the process decomposes into positive semidefinite components indexed by the $N!$ complete orders, whose prefix sums satisfy linear history constraints. This allows dynamical ordering rather than merely a mixture of fixed-order circuits.
The converse proof combines an extension-independent first-party decomposition with generalized teleportation. An isometry coherently encodes the first party’s input-output system into orthogonal ancillary sectors at all candidate remaining parties. Induction produces a common complete-order decomposition, and compression through the isometry transfers its history constraints back to the original process space. A known circuit-realization characterization then supplies the QC-CC implementation.
The paper also establishes consistency when global past and future are represented as additional parties, and extends the equivalence to outcome-resolved probabilistic process families. The results are finite-dimensional; the finite SDP characterization is not accompanied by an efficient-scaling claim.
Little sign of AI-generated text
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
Indefinite causal order extends the conventional circuit paradigm by allowing local quantum operations to be connected without a predetermined global order. Within the process-matrix framework, it is characterized by causal nonseparability, whereas extensible causal separability (ECS) requires that, under arbitrary input-ancilla extensions, a process admit a recursive decomposition into components, each compatible with a particular operation acting first. Quantum circuits with classical control of causal order (QC-CC), in which previous outcomes dynamically determine which operation acts next, are known to generate ECS processes, but whether every ECS process admits such a realization has remained a longstanding open problem. We settle it through a generalized teleportation construction that realizes every multipartite ECS process as a QC-CC. We further establish consistency between ECS definitions for trivial and nontrivial global past and future systems. These results provide ECS with an exact operational interpretation and identify QC-CC as the complete circuit structure underlying this class of processes.
The paper asks whether every extensibly causally separable (ECS) process matrix can be realized by a quantum circuit with classical control of causal order (QC-CC). ECS requires recursive causal separability to survive arbitrary shared input-ancilla extensions; QC-CC circuits choose the next unused operation dynamically through internal instrument outcomes. The inclusion QC-CC⊆ECS was known, while the converse remained open.
It proves ECSNP→F=QC-CCNP→F for every finite number of parties N and finite-dimensional input, output, global-past, and global-future systems. Consequently, ECS membership has a finite semidefinite-programming characterization: the process decomposes into positive semidefinite components indexed by the N! complete orders, whose prefix sums satisfy linear history constraints. This allows dynamical ordering rather than merely a mixture of fixed-order circuits.
The converse proof combines an extension-independent first-party decomposition with generalized teleportation. An isometry coherently encodes the first party’s input-output system into orthogonal ancillary sectors at all candidate remaining parties. Induction produces a common complete-order decomposition, and compression through the isometry transfers its history constraints back to the original process space. A known circuit-realization characterization then supplies the QC-CC implementation.
The paper also establishes consistency when global past and future are represented as additional parties, and extends the equivalence to outcome-resolved probabilistic process families. The results are finite-dimensional; the finite SDP characterization is not accompanied by an efficient-scaling claim.
The concept of causal (non)separability describes whether the causal order between parties that perform local quantum operations is well-defined or indefinite. Causal (non)separability in the general multipartite setting was introduced and studied in [Oreshkov and Giarmatzi, New J. Phys. 18, 093020 (2016); Wechs, Abbott, and Branciard, New J. Phys. 21, 013027 (2019)]. We resolve an open problem from these earlier works by showing -- using a novel "coherent teleportation technique" -- that a sufficient condition for causal separability identified in [Wechs, Abbott, and Branciard, New J. Phys. 21, 013027 (2019)] is also necessary, and thus provides a complete characterisation of multipartite causal separability. A consequence of this result is that all causally separable processes admit a realisation as generalised quantum circuits in which the order between the operations is classically controlled, known as "quantum circuits with classical control of causal order".
The concept of causal (non)separability describes whether the causal order between parties that perform local quantum operations is well-defined or indefinite. Causal (non)separability in the general multipartite setting was introduced and studied in [Oreshkov and Giarmatzi, New J. Phys. 18, 093020 (2016); Wechs, Abbott, and Branciard, New J. Phys. 21, 013027 (2019)]. We resolve an open problem from these earlier works by showing -- using a novel "coherent teleportation technique" -- that a sufficient condition for causal separability identified in [Wechs, Abbott, and Branciard, New J. Phys. 21, 013027 (2019)] is also necessary, and thus provides a complete characterisation of multipartite causal separability. A consequence of this result is that all causally separable processes admit a realisation as generalised quantum circuits in which the order between the operations is classically controlled, known as "quantum circuits with classical control of causal order". Source: http://arxiv Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
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.
Quantum processes with indefinite causal order -- so-called causally nonseparable processes -- can exhibit various advantages over quantum circuits with a fixed or a well-defined causal structure. A natural question is how much nonclassicality is required for a process to display causal nonseparability. Here we address this by investigating how many systems can be dephased (or decohered) before this property vanishes. First, for bipartite processes with open past and future we show that if all systems are dephased, or if only the future system is kept undephased, then the process becomes causally separable. However, if any single system other than the future system remains undephased, then there exist processes that retain causal nonseparability. Next, we demonstrate a similar behaviour in the multipartite case, when restricted to the physically motivated class of quantum circuits with quantum control (QC-QCs). Namely, dephasing all systems or keeping only the future system undephased renders any QC-QC causally separable; while causal nonseparability can persist if any non-future system is left undephased.
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.
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.