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

Intrinsic Sequentiality in P: Causal Limits of Parallel Computation

Jing-Yuan Wei

Published Mar 9, 2026• 0 citations
arXivHTMLPDF

Abstract

We study a polynomial-time decision problem in which each input encodes a depth-$N$ causal execution in which a single non-duplicable token must traverse an ordered sequence of steps, revealing at most $O(1)$ bits of routing information at each step. The uncertainty in the problem lies in identifying the delivery path through the relay network rather than in the final accept/reject outcome, which is defined solely by completion of the prescribed execution. A deterministic Turing machine executes the process in $Θ(N)$ time. Using information-theoretic tools - specifically cut-set bounds for relay channels and Fano's inequality - we prove that any execution respecting the causal constraints requires $Ω(N)$ units of causal time, thereby ruling out asymptotic parallel speedup. We further show that no classical $\mathbf{NC}$ circuit family can implement the process when circuit depth is interpreted as realizable parallel time. This identifies a class of polynomial-time problems with intrinsic causal structure and highlights a gap between logical parallelism and causal executability.

DOI
10.48550/arxiv.2603.08471

Related papers

Agent policies from higher-order causal functions

Matt Wilson

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.

cs.AICross-listedarXiv:2512.10937•Dec 12, 2025•0 citations

Solving the P/NP Problem under Intrinsic Uncertainty

Stefan Jaeger

Heisenberg's uncertainty principle states that it is not possible to compute both the position and momentum of an electron with absolute certainty. However, this computational limitation, which is central to quantum mechanics, has no counterpart in theoretical computer science. Here, I will show that we can distinguish between the complexity classes P and NP when we consider intrinsic uncertainty in our computations, and take uncertainty about whether a bit belongs to the program code or machine input into account. Given intrinsic uncertainty, every output is uncertain, and computations become meaningful only in combination with a confidence level. In particular, it is impossible to compute solutions with absolute certainty as this requires infinite run-time. Considering intrinsic uncertainty, I will present a function that is in NP but not in P, and thus prove that P is a proper subset of NP. I will also show that all traditional hard decision problems have polynomial-time algorithms that provide solutions with confidence under uncertainty.

arXiv:0811.0463•Nov 4, 2008•3 citations

Revisiting the simulation of quantum Turing machines by quantum circuits

Abel Molina, John Watrous

Yao's 1995 publication ‘Quantum circuit complexity’ in Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science , pp. 352–361, proved that quantum Turing machines and quantum circuits are polynomially equivalent computational models: t ≥ n steps of a quantum Turing machine running on an input of length n can be simulated by a uniformly generated family of quantum circuits with size quadratic in t , and a polynomial-time uniformly generated family of quantum circuits can be simulated by a quantum Turing machine running in polynomial time. We revisit the simulation of quantum Turing machines with uniformly generated quantum circuits, which is the more challenging of the two simulation tasks, and present a variation on the simulation method employed by Yao together with an analysis of it. This analysis reveals that the simulation of quantum Turing machines can be performed by quantum circuits having depth linear in t , rather than quadratic depth, and can be extended to variants of quantum Turing machines, such as ones having multi-dimensional tapes. Our analysis is based on an extension of method described by Arright, Nesme and Werner in 2011 in Journal of Computer and System Sciences 77 , 372–378. ( doi:10.1016/j.jcss.2010.05.004 ), that allows for the localization of causal unitary evolutions.

arXiv:1808.01701•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Jun 1, 2019•60 citations

Quantum Observation Constraints on Pre-Solution Information in SAT

AI Trinity Labo

This paper introduces an observation-respecting computational principle that forbids the existence of pre-solution “cheat sheets” for canonical SAT instances. Classical complexity theory implicitly allows auxiliary information that encodes solution-relevant structure prior to solving, erasing any notion of causal or observational order. In contrast, physically grounded models of computation—motivated by quantum mechanics—permit classical information only as the irreversible outcome of explicit measurement. We formalize this distinction by introducing non-resolving preprocessing procedures, defined as polynomial-time processes that avoid satisfiability-correlated measurement. For a canonical non-uniform family of satisfiable SAT instances, we define a hierarchy of solution structures and show that no such preprocessing can significantly compress these structures prior to observation. The obstruction arises from a fundamental mismatch between distribution-level information available before measurement and realization-dependent information that emerges only after satisfiability is resolved. Rather than claiming a resolution of P versus NP in the classical Turing model, this work isolates a precise conceptual barrier: realization-dependent solution information cannot be generated in advance without violating observation-respecting constraints. The result provides a physically motivated explanation for persistent pre-solution information asymmetry in NP-complete problems and suggests new directions for examining computational hardness through the lens of information generation.

•Jan 29, 2026•0 citations

Perspectives on signalling and causal order in physical theories

Maarten Grothus

Causality is pivotal to our understanding of the world, presenting itself in different forms: information-theoretic and relativistic, the former linked to the flow of information, and the latter to the structure of space-time.To operationally infer causal relations across a variety of different theories, the operational notion of signalling plays a central role.In particular, this includes the affects framework, formalising signalling in general physical theories using a causal modelling approach, and notions of signalling in quantum theory.In the first part of this thesis, we leverage the affects framework to improve the characterisation of information-theoretic signalling as defined through so-called affects relations. Specifically, we provide conditions for identifying redundancies in such a relation, introducing techniques for causal inference in unfaithful causal models (where the observable data does not “faithfully” reflect the causal dependences), and demonstrate how affects relations can be applied to describe signalling in quantum theory.Beyond capturing information-theoretic signalling alone, the affects framework allows one to study its interplay with relativistic principles. We define an order-theoretic property called conicality, showing that it is satisfied for Minkowski space-times with d > 1 spatial dimensions. Embedding of information-theoretic causal models in space-time without violating relativistic principles such as no superluminal signalling (NSS), we observe that constraints imposed by NSS in a space-time and those imposed by purely information-theoretic causal inference behave differently. We then prove a correspondence between conical space-times and faithful causal models: in both cases, there emerges a parallel between these two types of constraints. This indicates a connection between informational and geometric notions of causality, which we use to prove the impossibility of non-degenerate embeddings of causal loops into conical spacetimes.In the second part of this thesis, we study quantum processes with indefinite causal order (ICO), for which various frameworks have been proposed. In particular, quantum circuits with quantum control of causal order (QC-QCs) form a broad class of higher-order maps which 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, representing the information flow in the respective process. However, the existence of routed circuit decompositions has only been established for a small set of processes so far.We remedy this fact by connecting these two frameworks, proving that for any given N, one can systematically obtain a routed circuit decomposition for any QC-QC with N parties. We detail this construction explicitly and contrast it with alternative routed circuit decompositions of QC-QCs.We additionally provide representations of subclasses of QC-QCs, including a proposed class of agent-localised processes and the QC-supFO class capturing processes with non-dynamical causal order. We conclude this part by applying affects relations to describe processes with dynamical causal order.

•Apr 13, 2026•0 citations

Quantum circuit design for universal distribution using a superposition of classical automata

Aritra Sarkar, Zaid Al-Ars, Koen Bertels

In this research, we present a quantum circuit design and implementation for a parallel universal linear bounded automata. This circuit is able to accelerate the inference of algorithmic structures in data for discovering causal generative models. The computation model is practically restricted in time and space resources. A classical exhaustive enumeration of all possible programs on the automata is shown for a couple of example cases. The precise quantum circuit design that allows executing a superposition of programs, along with a superposition of inputs as in the standard quantum Turing machine formulation, is presented. This is the first time, a superposition of classical automata is implemented on the circuit model of quantum computation, having the corresponding mechanistic parts of a classical Turing machine. The superposition of programs allows our model to be used for experimenting with the space of program-output behaviors in algorithmic information theory. Our implementations on OpenQL and Qiskit quantum programming language is copy-left and is publicly available on GitHub.

arXiv:2006.00987•Jun 1, 2020•0 citations
We study a polynomial-time decision problem in which each input encodes a depth-NNN causal execution in which a single non-duplicable token must traverse an ordered sequence of steps, revealing at most O(1)O(1)O(1) bits of routing information at each step. The uncertainty in the problem lies in identifying the delivery path through the relay network rather than in the final accept/reject outcome, which is defined solely by completion of the prescribed execution. A deterministic Turing machine executes the process in Θ(N)Θ(N)Θ(N) time. Using information-theoretic tools - specifically cut-set bounds for relay channels and Fano's inequality - we prove that any execution respecting the causal constraints requires Ω(N)Ω(N)Ω(N) units of causal time, thereby ruling out asymptotic parallel speedup. We further show that no classical NC\mathbf{NC}NC circuit family can implement the process when circuit depth is interpreted as realizable parallel time. This identifies a class of polynomial-time problems with intrinsic causal structure and highlights a gap between logical parallelism and causal executability.
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.
Heisenberg's uncertainty principle states that it is not possible to compute both the position and momentum of an electron with absolute certainty. However, this computational limitation, which is central to quantum mechanics, has no counterpart in theoretical computer science. Here, I will show that we can distinguish between the complexity classes P and NP when we consider intrinsic uncertainty in our computations, and take uncertainty about whether a bit belongs to the program code or machine input into account. Given intrinsic uncertainty, every output is uncertain, and computations become meaningful only in combination with a confidence level. In particular, it is impossible to compute solutions with absolute certainty as this requires infinite run-time. Considering intrinsic uncertainty, I will present a function that is in NP but not in P, and thus prove that P is a proper subset of NP. I will also show that all traditional hard decision problems have polynomial-time algorithms that provide solutions with confidence under uncertainty.
Yao's 1995 publication ‘Quantum circuit complexity’ in Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science , pp. 352–361, proved that quantum Turing machines and quantum circuits are polynomially equivalent computational models: t ≥ n steps of a quantum Turing machine running on an input of length n can be simulated by a uniformly generated family of quantum circuits with size quadratic in t , and a polynomial-time uniformly generated family of quantum circuits can be simulated by a quantum Turing machine running in polynomial time. We revisit the simulation of quantum Turing machines with uniformly generated quantum circuits, which is the more challenging of the two simulation tasks, and present a variation on the simulation method employed by Yao together with an analysis of it. This analysis reveals that the simulation of quantum Turing machines can be performed by quantum circuits having depth linear in t , rather than quadratic depth, and can be extended to variants of quantum Turing machines, such as ones having multi-dimensional tapes. Our analysis is based on an extension of method described by Arright, Nesme and Werner in 2011 in Journal of Computer and System Sciences 77 , 372–378. ( doi:10.1016/j.jcss.2010.05.004 ), that allows for the localization of causal unitary evolutions.
This paper introduces an observation-respecting computational principle that forbids the existence of pre-solution “cheat sheets” for canonical SAT instances. Classical complexity theory implicitly allows auxiliary information that encodes solution-relevant structure prior to solving, erasing any notion of causal or observational order. In contrast, physically grounded models of computation—motivated by quantum mechanics—permit classical information only as the irreversible outcome of explicit measurement. We formalize this distinction by introducing non-resolving preprocessing procedures, defined as polynomial-time processes that avoid satisfiability-correlated measurement. For a canonical non-uniform family of satisfiable SAT instances, we define a hierarchy of solution structures and show that no such preprocessing can significantly compress these structures prior to observation. The obstruction arises from a fundamental mismatch between distribution-level information available before measurement and realization-dependent information that emerges only after satisfiability is resolved. Rather than claiming a resolution of P versus NP in the classical Turing model, this work isolates a precise conceptual barrier: realization-dependent solution information cannot be generated in advance without violating observation-respecting constraints. The result provides a physically motivated explanation for persistent pre-solution information asymmetry in NP-complete problems and suggests new directions for examining computational hardness through the lens of information generation.
Causality is pivotal to our understanding of the world, presenting itself in different forms: information-theoretic and relativistic, the former linked to the flow of information, and the latter to the structure of space-time.To operationally infer causal relations across a variety of different theories, the operational notion of signalling plays a central role.In particular, this includes the affects framework, formalising signalling in general physical theories using a causal modelling approach, and notions of signalling in quantum theory.In the first part of this thesis, we leverage the affects framework to improve the characterisation of information-theoretic signalling as defined through so-called affects relations. Specifically, we provide conditions for identifying redundancies in such a relation, introducing techniques for causal inference in unfaithful causal models (where the observable data does not “faithfully” reflect the causal dependences), and demonstrate how affects relations can be applied to describe signalling in quantum theory.Beyond capturing information-theoretic signalling alone, the affects framework allows one to study its interplay with relativistic principles. We define an order-theoretic property called conicality, showing that it is satisfied for Minkowski space-times with d > 1 spatial dimensions. Embedding of information-theoretic causal models in space-time without violating relativistic principles such as no superluminal signalling (NSS), we observe that constraints imposed by NSS in a space-time and those imposed by purely information-theoretic causal inference behave differently. We then prove a correspondence between conical space-times and faithful causal models: in both cases, there emerges a parallel between these two types of constraints. This indicates a connection between informational and geometric notions of causality, which we use to prove the impossibility of non-degenerate embeddings of causal loops into conical spacetimes.In the second part of this thesis, we study quantum processes with indefinite causal order (ICO), for which various frameworks have been proposed. In particular, quantum circuits with quantum control of causal order (QC-QCs) form a broad class of higher-order maps which 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, representing the information flow in the respective process. However, the existence of routed circuit decompositions has only been established for a small set of processes so far.We remedy this fact by connecting these two frameworks, proving that for any given N, one can systematically obtain a routed circuit decomposition for any QC-QC with N parties. We detail this construction explicitly and contrast it with alternative routed circuit decompositions of QC-QCs.We additionally provide representations of subclasses of QC-QCs, including a proposed class of agent-localised processes and the QC-supFO class capturing processes with non-dynamical causal order. We conclude this part by applying affects relations to describe processes with dynamical causal order.
In this research, we present a quantum circuit design and implementation for a parallel universal linear bounded automata. This circuit is able to accelerate the inference of algorithmic structures in data for discovering causal generative models. The computation model is practically restricted in time and space resources. A classical exhaustive enumeration of all possible programs on the automata is shown for a couple of example cases. The precise quantum circuit design that allows executing a superposition of programs, along with a superposition of inputs as in the standard quantum Turing machine formulation, is presented. This is the first time, a superposition of classical automata is implemented on the circuit model of quantum computation, having the corresponding mechanistic parts of a classical Turing machine. The superposition of programs allows our model to be used for experimenting with the space of program-output behaviors in algorithmic information theory. Our implementations on OpenQL and Qiskit quantum programming language is copy-left and is publicly available on GitHub.