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:2610.40573

What Can Be Computed with Indefinite Causal Structure?

Omri Shmueli

quant-phcs.CCSubmitted Oct 29, 2026• Announced Oct 30, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks whether indefinite causal structure increases computational power in the process-matrix formalism, including under purity and purification requirements. Computation is modeled by polynomial-size ordinary circuits with designated feedback connections; access to the resulting channel is granted at cost proportional to the generating circuit’s size, rather than its implementation cost. For general processes, it proves $\mathbf{NP}\subseteq\mathbf{BQP}_{\mathrm{lCTC}}$. The valid processes used are purifiable and generate unitary channels, although their generating circuits are nonunitary. The main construction converts an exact circuit preparing an isometry’s Choi state into a process generator implementing that isometry. Teleportation measurements and feedback enforce the desired outcome while preserving normalization under arbitrary inserted channels. An efficiently prepared Choi state for a unique-witness swap, combined with Valiant–Vazirani isolation and classical verification, yields the NP algorithm. The construction also enables coherent permutation inversion. For pure processes, it explicitly constructs polynomial-size unitary generators that coherently invert unique-sink-orientation outmaps. One generated-channel call finds the sink with probability $1$. Validity follows from the pairwise USO characterization, which guarantees operator-valued row orthogonality even with arbitrary local auxiliary systems. The argument extends to certain product-basis transformations. A separation from $\mathbf{BQP}$ for pure processes remains conditional on USO lacking a quantum polynomial-time algorithm. Physical realizability and efficient implementation of these channels are unknown. Purifiability establishes existence of a pure extension, not an efficient way to construct it; existing switch-based proposals cover only particular cases.

Little sign of AI-generated textStrong assumptions

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Unitary Closed Timelike Curves can Solve all of NP

Omri Shmueli

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 $\textit{linear}$. Araujo et al. accordingly defined the complexity class for efficient process matrix computation as $\mathbf{BQP}_{\ell CTC}$ (which trivially contains $\mathbf{BQP}$), and posed the open question of whether $\mathbf{BQP}_{\ell CTC}$ contains computational tasks that are outside $\mathbf{BQP}$. In this work we solve this open question under a widely believed hardness assumption, by showing that $\mathbf{NP} \subseteq \mathbf{BQP}_{\ell 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 $\textit{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 $\mathbf{NP}$, is false, and raises the importance of understanding whether purifiable process matrices are physical or not.

quant-pharXiv:2410.04630•Oct 8, 2024•0 citations

Quantum computation with indefinite causal structures

Mateus Araújo, Philippe Allard Guérin, Ämin Baumeler

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.

arXiv:1706.09854•Physical Review A•Nov 13, 2017•73 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•1 citation

Connecting processes with indefinite causal order and multi-time quantum states

Ralph Silva, Yelena Guryanova, Anthony J. Short +3 more

Recently, the possible existence of quantum processes with indefinite causal order has been extensively discussed, in particular using the formalism of process matrices. Here we give a new perspective on this question, by establishing a direct connection to the theory of multi-time quantum states. Specifically, we show that process matrices are equivalent to a particular class of pre- and post-selected quantum states. This offers a new conceptual point of view to the nature of process matrices. Our results also provide an explicit recipe to experimentally implement any process matrix in a probabilistic way, and allow us to generalize some of the previously known properties of process matrices. Finally we raise the issue of the difference between the notions of indefinite temporal order and indefinite causal order, and show that one can have indefinite causal order even with definite temporal order.

arXiv:1701.08638•New Journal of Physics•Oct 23, 2017•49 citations

Superposition of dynamics, indefinite causal order, and quantum histories

Charis Anastopoulos, Ntina Savvidou

The process-matrix formalism describes quantum processes without assuming a fixed global causal order, but the physical meaning of indefinite causal order remains open. We address this question within histories theory, where temporal ordering and dynamical evolution are distinct structures. We show that the decoherence functional admits coherent superpositions of dynamics. In measurement settings, under suitable factorization conditions, these generate process matrices. In the bipartite setting considered here, process-matrix indefinite causal order is thereby identified as an operationally restricted realization of the more general phenomenon of superposition of dynamics. Histories theory also admits a distinct kinematical notion of indefinite order, in which the ordering of physical events is itself a history observable. The resulting distinction between event order and intervention order clarifies the relation between indefinite causal order, quantum dynamics, and spacetime structure.

quant-pharXiv:2608.16694•Aug 18, 2026•1 citation

Reassessing the computational advantage of quantum-controlled ordering of gates

Martin J. Renner, Časlav Brukner

Research on indefinite causal structures is a rapidly evolving field that has a potential not only to make a radical revision of the classical understanding of space-time but also to achieve enhanced functionalities of quantum information processing. For example, it is known that indefinite causal structures provide exponential advantage in communication complexity when compared to causal protocols. In quantum computation, such structures can decide whether two unitary gates commute or anticommute with a single call to each gate, which is impossible with conventional (causal) quantum algorithms. A generalization of this effect to $n$ unitary gates, originally introduced in Ara\'ujo et al. [Phys. Rev. Lett. 113, 250402 (2014)] and often called Fourier promise problem (FPP), can be solved with the quantum-$n$-switch and a single call to each gate, while the best known causal algorithm so far calls $O({n}^{2})$ gates. In this article, we show that this advantage is smaller than expected. In fact, we present a causal algorithm that solves the only known specific FPP with $O(nlog(n))$ queries and a causal algorithm that solves every FPP with $O(n\sqrt{n})$ queries. Besides the interest in such algorithms on their own, our results limit the expected advantage of indefinite causal structures for these problems.

arXiv:2102.11293•Physical Review Research•Oct 6, 2021•17 citations
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.
The paper asks whether indefinite causal structure increases computational power in the process-matrix formalism, including under purity and purification requirements. Computation is modeled by polynomial-size ordinary circuits with designated feedback connections; access to the resulting channel is granted at cost proportional to the generating circuit’s size, rather than its implementation cost.
For general processes, it proves NP⊆BQPlCTC\mathbf{NP}\subseteq\mathbf{BQP}_{\mathrm{lCTC}}NP⊆BQPlCTC​. The valid processes used are purifiable and generate unitary channels, although their generating circuits are nonunitary. The main construction converts an exact circuit preparing an isometry’s Choi state into a process generator implementing that isometry. Teleportation measurements and feedback enforce the desired outcome while preserving normalization under arbitrary inserted channels. An efficiently prepared Choi state for a unique-witness swap, combined with Valiant–Vazirani isolation and classical verification, yields the NP algorithm. The construction also enables coherent permutation inversion.
For pure processes, it explicitly constructs polynomial-size unitary generators that coherently invert unique-sink-orientation outmaps. One generated-channel call finds the sink with probability 111. Validity follows from the pairwise USO characterization, which guarantees operator-valued row orthogonality even with arbitrary local auxiliary systems. The argument extends to certain product-basis transformations.
A separation from BQP\mathbf{BQP}BQP for pure processes remains conditional on USO lacking a quantum polynomial-time algorithm. Physical realizability and efficient implementation of these channels are unknown. Purifiability establishes existence of a pure extension, not an efficient way to construct it; existing switch-based proposals cover only particular cases.
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\textit{linear}linear. Araujo et al. accordingly defined the complexity class for efficient process matrix computation as BQPℓCTC\mathbf{BQP}_{\ell CTC}BQPℓCTC​ (which trivially contains BQP\mathbf{BQP}BQP), and posed the open question of whether BQPℓCTC\mathbf{BQP}_{\ell CTC}BQPℓCTC​ contains computational tasks that are outside BQP\mathbf{BQP}BQP. In this work we solve this open question under a widely believed hardness assumption, by showing that NP⊆BQPℓCTC\mathbf{NP} \subseteq \mathbf{BQP}_{\ell CTC}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\textit{unitary}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\mathbf{NP}NP, is false, and raises the importance of understanding whether purifiable process matrices are physical or not.
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.
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.
Recently, the possible existence of quantum processes with indefinite causal order has been extensively discussed, in particular using the formalism of process matrices. Here we give a new perspective on this question, by establishing a direct connection to the theory of multi-time quantum states. Specifically, we show that process matrices are equivalent to a particular class of pre- and post-selected quantum states. This offers a new conceptual point of view to the nature of process matrices. Our results also provide an explicit recipe to experimentally implement any process matrix in a probabilistic way, and allow us to generalize some of the previously known properties of process matrices. Finally we raise the issue of the difference between the notions of indefinite temporal order and indefinite causal order, and show that one can have indefinite causal order even with definite temporal order.
The process-matrix formalism describes quantum processes without assuming a fixed global causal order, but the physical meaning of indefinite causal order remains open. We address this question within histories theory, where temporal ordering and dynamical evolution are distinct structures. We show that the decoherence functional admits coherent superpositions of dynamics. In measurement settings, under suitable factorization conditions, these generate process matrices. In the bipartite setting considered here, process-matrix indefinite causal order is thereby identified as an operationally restricted realization of the more general phenomenon of superposition of dynamics. Histories theory also admits a distinct kinematical notion of indefinite order, in which the ordering of physical events is itself a history observable. The resulting distinction between event order and intervention order clarifies the relation between indefinite causal order, quantum dynamics, and spacetime structure.
Research on indefinite causal structures is a rapidly evolving field that has a potential not only to make a radical revision of the classical understanding of space-time but also to achieve enhanced functionalities of quantum information processing. For example, it is known that indefinite causal structures provide exponential advantage in communication complexity when compared to causal protocols. In quantum computation, such structures can decide whether two unitary gates commute or anticommute with a single call to each gate, which is impossible with conventional (causal) quantum algorithms. A generalization of this effect to nnn unitary gates, originally introduced in Ara\'ujo et al. [Phys. Rev. Lett. 113, 250402 (2014)] and often called Fourier promise problem (FPP), can be solved with the quantum-nnn-switch and a single call to each gate, while the best known causal algorithm so far calls O(n2)O({n}^{2})O(n2) gates. In this article, we show that this advantage is smaller than expected. In fact, we present a causal algorithm that solves the only known specific FPP with O(nlog(n))O(nlog(n))O(nlog(n)) queries and a causal algorithm that solves every FPP with O(nn)O(n\sqrt{n})O(nn​) queries. Besides the interest in such algorithms on their own, our results limit the expected advantage of indefinite causal structures for these problems.