Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2206.10042 · Quantum

Consistent circuits for indefinite causal order

Augustin Vanrietvelde, Nick Ormrod, Hlér Kristjánsson, Jonathan Barrett

Published Dec 2, 2025• 1 citation
arXivHTMLPDF

Abstract

Over the past decade, a number of quantum processes have been proposed which are logically consistent, yet feature a cyclic causal structure. However, there is no general formal method to construct a process with an exotic causal structure in a way that ensures, and makes clear why, it is consistent. Here we provide such a method, given by an extended circuit formalism. This only requires directed graphs endowed with Boolean matrices, which encode basic constraints on operations. Our framework (a) defines a set of elementary rules for checking the validity of any such graph, (b) provides a way of constructing consistent processes as a circuit from valid graphs, and (c) yields an intuitive interpretation of the causal relations within a process and an explanation of why they do not lead to inconsistencies. We display how several standard examples of exotic processes, including ones that violate causal inequalities, are among the class of processes that can be generated in this way; we conjecture that this class in fact includes all unitarily extendible processes.

DOI
10.22331/q-2025-12-02-1923

Related papers

Routed quantum circuits: an extended framework for coherent control and indefinite causal order

Augustin Vanrietvelde

Quantum circuits form the standard framework of quantum computing, and have started playing the same role for some parts of quantum foundations. However, they cannot satisfactorily capture some possibilities offered by quantum theory, in particular coherent control and indefinite causal order. In this thesis, we therefore propose an extension to this framework, given by routed quantum circuits. Our extension is based on the addition of sectorial constraints, which specify the basic sectorial structure of the scenarios at hand, on top of the factorial structure described by the connectivity of circuits. This yields a consistent and scalable framework, applicable to pure and mixed quantum theory. It admits a sound and intuitive diagrammatic notation. We show that this framework allows to properly model all forms of coherent control of the application of a channel, for instance the superposition of a quantum information carrier's trajectory, or the 'extended circuit diagrams' recently introduced for the study of causal decompositions. We demonstrate how this leads to a redefinition of the task of coherently controlling a channel, and study in detail the necessary resources for this task. We further show that the scenarios featuring indefinite causal order also fit within our framework once feedback loops are introduced. The connectivity and sectorial constraints are then sufficient to specify the core behaviour of a process, and in particular to check that it is valid, i.e. that its cycles do not lead to any logical inconsistency. We display how several standard examples of exotic processes, including ones that violate causal inequalities, are among the class of processes that can be generated in this way; we conjecture that this class in fact includes all unitarily extendible processes.

•Sep 1, 2022•0 citations

Correlations and quantum circuits with dynamical causal order

Raphaël Mothe, Alastair A. Abbott, Cyril Branciard

Requiring that the causal structure between different parties is well-defined imposes constraints on the correlations they can establish, which define so-called causal correlations. Some of these are known to have a "dynamical" causal order in the sense that their causal structure is not fixed a priori but is instead established on the fly, with for instance the causal order between future parties depending on some choice of action of parties in the past. Here we identify a new way that the causal order between the parties can be dynamical: with at least four parties, there can be some dynamical order which can nevertheless not be influenced by the actions of past parties. This leads us to introduce an intermediate class of correlations with what we call non-influenceable causal order, in between the set of correlations with static (non-dynamical) causal order and the set of general causal correlations. We then define analogous classes of quantum processes, considering recently introduced classes of quantum circuits with classical or quantum control of causal order---the latter being the largest class within the process matrix formalism known to have a clear interpretation in terms of coherent superpositions of causal orders. This allows us to formalise precisely in which sense certain quantum processes can have both indefinite and dynamical causal order.

arXiv:2507.07992•Jul 10, 2025•0 citations

Routing Quantum Control of Causal Order

Maarten Grothus, Alastair A. Abbott, Augustin Vanrietvelde +1 more

In recent years, various frameworks have been proposed for the study of quantum processes with indefinite causal order. In particular, quantum circuits with quantum control of causal order (QC-QCs) form a broad class of physical supermaps obtained from a bottom-up construction and are believed to represent all quantum processes physically realisable in a fixed spacetime. Complementarily, the formalism of routed quantum circuits introduces quantum operations constrained by "routes" to represent processes in terms of a more fine-grained routed circuit decomposition. This decomposition, formalised using a so-called routed graph, represents the information flow within the respective process. However, the existence of routed circuit decompositions has only been established for a small set of processes so far, including both certain specific QC-QCs and more exotic processes as examples. In this work, we remedy this fact by connecting these two frameworks. We prove that for any given $N$, one can use a single routed graph to systematically obtain a routed circuit decomposition for any QC-QC with $N$ parties. We detail this construction explicitly and contrast it with other routed circuit decompositions of QC-QCs, which we obtain from alternative routed graphs. We conclude by pointing out how this connection can be useful to tackle various open problems in the field of indefinite causal order, particularly establishing circuit representations of subclasses of QC-QCs.

arXiv:2507.08781•Jul 11, 2025•0 citations

What Can Be Computed with Indefinite Causal Structure?

Omri Shmueli

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 $\textbf{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 $\textbf{BQP}$ within the process matrix formalism, even while preserving unitarity.

quant-pharXiv:2610.40573•Oct 30, 2026•0 citations

Cyclic quantum causal models

Jonathan Barrett, Robin Lorenz, Ognyan Oreshkov

Causal reasoning is essential to science, yet quantum theory challenges it. Quantum correlations violating Bell inequalities defy satisfactory causal explanations within the framework of classical causal models. What is more, a theory encompassing quantum systems and gravity is expected to allow causally nonseparable processes featuring operations in indefinite causal order, defying that events be causally ordered at all. The first challenge has been addressed through the recent development of intrinsically quantum causal models, allowing causal explanations of quantum processes - provided they admit a definite causal order, i.e. have an acyclic causal structure. This work addresses causally nonseparable processes and offers a causal perspective on them through extending quantum causal models to cyclic causal structures. Among other applications of the approach, it is shown that all unitarily extendible bipartite processes are causally separable and that for unitary processes, causal nonseparability and cyclicity of their causal structure are equivalent.

arXiv:2002.12157•Nature Communications•Feb 9, 2021•66 citations

Extensibly Causally Separable Processes Admit Realizations as Quantum Circuits with Classical Control of Causal Order

Wenjie Wei, Shengshi Pang

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.

quant-pharXiv:2609.18559•Sep 17, 2026•0 citations
Over the past decade, a number of quantum processes have been proposed which are logically consistent, yet feature a cyclic causal structure. However, there is no general formal method to construct a process with an exotic causal structure in a way that ensures, and makes clear why, it is consistent. Here we provide such a method, given by an extended circuit formalism. This only requires directed graphs endowed with Boolean matrices, which encode basic constraints on operations. Our framework (a) defines a set of elementary rules for checking the validity of any such graph, (b) provides a way of constructing consistent processes as a circuit from valid graphs, and (c) yields an intuitive interpretation of the causal relations within a process and an explanation of why they do not lead to inconsistencies. We display how several standard examples of exotic processes, including ones that violate causal inequalities, are among the class of processes that can be generated in this way; we conjecture that this class in fact includes all unitarily extendible processes.
Quantum circuits form the standard framework of quantum computing, and have started playing the same role for some parts of quantum foundations. However, they cannot satisfactorily capture some possibilities offered by quantum theory, in particular coherent control and indefinite causal order. In this thesis, we therefore propose an extension to this framework, given by routed quantum circuits. Our extension is based on the addition of sectorial constraints, which specify the basic sectorial structure of the scenarios at hand, on top of the factorial structure described by the connectivity of circuits. This yields a consistent and scalable framework, applicable to pure and mixed quantum theory. It admits a sound and intuitive diagrammatic notation. We show that this framework allows to properly model all forms of coherent control of the application of a channel, for instance the superposition of a quantum information carrier's trajectory, or the 'extended circuit diagrams' recently introduced for the study of causal decompositions. We demonstrate how this leads to a redefinition of the task of coherently controlling a channel, and study in detail the necessary resources for this task. We further show that the scenarios featuring indefinite causal order also fit within our framework once feedback loops are introduced. The connectivity and sectorial constraints are then sufficient to specify the core behaviour of a process, and in particular to check that it is valid, i.e. that its cycles do not lead to any logical inconsistency. We display how several standard examples of exotic processes, including ones that violate causal inequalities, are among the class of processes that can be generated in this way; we conjecture that this class in fact includes all unitarily extendible processes.
Requiring that the causal structure between different parties is well-defined imposes constraints on the correlations they can establish, which define so-called causal correlations. Some of these are known to have a "dynamical" causal order in the sense that their causal structure is not fixed a priori but is instead established on the fly, with for instance the causal order between future parties depending on some choice of action of parties in the past. Here we identify a new way that the causal order between the parties can be dynamical: with at least four parties, there can be some dynamical order which can nevertheless not be influenced by the actions of past parties. This leads us to introduce an intermediate class of correlations with what we call non-influenceable causal order, in between the set of correlations with static (non-dynamical) causal order and the set of general causal correlations. We then define analogous classes of quantum processes, considering recently introduced classes of quantum circuits with classical or quantum control of causal order---the latter being the largest class within the process matrix formalism known to have a clear interpretation in terms of coherent superpositions of causal orders. This allows us to formalise precisely in which sense certain quantum processes can have both indefinite and dynamical causal order.
In recent years, various frameworks have been proposed for the study of quantum processes with indefinite causal order. In particular, quantum circuits with quantum control of causal order (QC-QCs) form a broad class of physical supermaps obtained from a bottom-up construction and are believed to represent all quantum processes physically realisable in a fixed spacetime. Complementarily, the formalism of routed quantum circuits introduces quantum operations constrained by "routes" to represent processes in terms of a more fine-grained routed circuit decomposition. This decomposition, formalised using a so-called routed graph, represents the information flow within the respective process. However, the existence of routed circuit decompositions has only been established for a small set of processes so far, including both certain specific QC-QCs and more exotic processes as examples. In this work, we remedy this fact by connecting these two frameworks. We prove that for any given NNN, one can use a single routed graph to systematically obtain a routed circuit decomposition for any QC-QC with NNN parties. We detail this construction explicitly and contrast it with other routed circuit decompositions of QC-QCs, which we obtain from alternative routed graphs. We conclude by pointing out how this connection can be useful to tackle various open problems in the field of indefinite causal order, particularly establishing circuit representations of subclasses of QC-QCs.
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\textbf{NP}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\textbf{BQP}BQP within the process matrix formalism, even while preserving unitarity.
Causal reasoning is essential to science, yet quantum theory challenges it. Quantum correlations violating Bell inequalities defy satisfactory causal explanations within the framework of classical causal models. What is more, a theory encompassing quantum systems and gravity is expected to allow causally nonseparable processes featuring operations in indefinite causal order, defying that events be causally ordered at all. The first challenge has been addressed through the recent development of intrinsically quantum causal models, allowing causal explanations of quantum processes - provided they admit a definite causal order, i.e. have an acyclic causal structure. This work addresses causally nonseparable processes and offers a causal perspective on them through extending quantum causal models to cyclic causal structures. Among other applications of the approach, it is shown that all unitarily extendible bipartite processes are causally separable and that for unitary processes, causal nonseparability and cyclicity of their causal structure are equivalent.
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.