Quantum theory challenges classical causal explanations for physical phenomena, calling for a quantum generalisation of causal structure. This thesis advances the study of causal decompositions, a research programme that aims to bridge two prominent, yet conceptually distinct types of structural assumption found across the quantum causality literature. The first is in terms of the global dependency relations between input and output systems of quantum transformations, which in the unitary case we shall refer to as causal structure; the second is in terms of the compositional structure of quantum circuits or networks. Concretely, a causal decomposition is a circuit representation of a unitary transformation in which no-influence relations that hold between its inputs and outputs are made manifest in the absence of paths through the circuit connecting them. Applications include translating between different quantum causal modelling frameworks; equipping a framework based on unitary causal structure with a local, bottom-up description via generalised autonomous causal mechanisms; and relating notions of compatibility between quantum transformations and relativistic causality. Whether causal decompositions always exist remains an open problem. The contributions of this thesis are threefold. First, we develop an order-theoretic account of circuit syntax and demonstrate that every circuit with a given input-output connectivity can be rewritten into a one of a canonical form given by the concept lattice construction from lattice theory. This systematises the search for causal decompositions by providing the shape of the quantum circuit one should look for. Second, we establish a combinatorial condition that fully characterises when causal decompositions into unitary quantum circuits exist without requiring the generalisation to routed quantum circuits prompted by earlier research. This solves a well-defined subproblem of the broader quest, and our proof, an interplay of order theory and operator algebra, lays a foundation for future extensions. Third, we detail the application to relativistic causality. Within a multipartite framework generalising existing literature, we emphasise that the mere lack of superluminal signalling through a quantum channel is not sufficient to conclude its realisability by dynamics that are locally consistent with relativity theory. We conjecture that, on the other hand, a lack of superluminal causal influences through its unitary dilations is sufficient—at least up to arbitrarily small errors. We demonstrate this in various special cases and show that the general statement reduces to the existence of a weak version of causal decompositions.
Quantum theory challenges classical causal explanations for physical phenomena, calling for a quantum generalisation of causal structure. This thesis advances the study of causal decompositions, a research programme that aims to bridge two prominent, yet conceptually distinct types of structural assumption found across the quantum causality literature. The first is in terms of the global dependency relations between input and output systems of quantum transformations, which in the unitary case we shall refer to as causal structure; the second is in terms of the compositional structure of quantum circuits or networks. Concretely, a causal decomposition is a circuit representation of a unitary transformation in which no-influence relations that hold between its inputs and outputs are made manifest in the absence of paths through the circuit connecting them. Applications include translating between different quantum causal modelling frameworks; equipping a framework based on unitary causal structure with a local, bottom-up description via generalised autonomous causal mechanisms; and relating notions of compatibility between quantum transformations and relativistic causality. Whether causal decompositions always exist remains an open problem. The contributions of this thesis are threefold. First, we develop an order-theoretic account of circuit syntax and demonstrate that every circuit with a given input-output connectivity can be rewritten into a one of a canonical form given by the concept lattice construction from lattice theory. This systematises the search for causal decompositions by providing the shape of the quantum circuit one should look for. Second, we establish a combinatorial condition that fully characterises when causal decompositions into unitary quantum circuits exist without requiring the generalisation to routed quantum circuits prompted by earlier research. This solves a well-defined subproblem of the broader quest, and our proof, an interplay of order theory and operator algebra, lays a foundation for future extensions. Third, we detail the application to relativistic causality. Within a multipartite framework generalising existing literature, we emphasise that the mere lack of superluminal signalling through a quantum channel is not sufficient to conclude its realisability by dynamics that are locally consistent with relativity theory. We conjecture that, on the other hand, a lack of superluminal causal influences through its unitary dilations is sufficient—at least up to arbitrarily small errors. We demonstrate this in various special cases and show that the general statement reduces to the existence of a weak version of causal decompositions.
If a unitary transformation has a circuit representation with no directed path from input a to output b , then a does not influence b through the overall unitary. Conversely, if a unitary satisfies a number of no-influence conditions, it is natural to wonder whether a circuit decomposition exists in which all of them are represented by absences of paths. Such decompositions are known as causal decompositions; determining their existence in general is a central open problem in the study of causal structure in quantum theory. We present progress towards a general solution by considering the special case of unitary causal decompositions, i.e. decompositions in terms of unitary circuits in the traditional quantum circuit formalism that do not require the generalisation to 'extended' or 'routed' quantum circuits prompted by earlier research on this topic. We identify a combinatorial condition that characterises precisely those sets of no-influence constraints G for which any unitary transformation satisfying G admits a unitary causal decomposition representing the constraints. Our approach is systematic, grounded in lattice theory and finite-dimensional operator algebra, and offers hope for extensions to more general (e.g. routed unitary) causal decompositions in the future.
The causal structure of a unitary transformation is the set of relations of possible influence between any input subsystem and any output subsystem. We study whether such causal structure can be understood in terms of compositional structure of the unitary. Given a quantum circuit with no path from input system A to output system B , system A cannot influence system B . Conversely, given a unitary U with a no-influence relation from input A to output B , it follows from [B. Schumacher and M. D. Westmoreland, Quantum Information Processing 4 no. 1, (Feb, 2005)] that there exists a circuit decomposition of U with no path from A to B . However, as we argue, there are unitaries for which there does not exist a circuit decomposition that makes all causal constraints evident simultaneously . To address this, we introduce a new formalism of `extended circuit diagrams', which goes beyond what is expressible with quantum circuits, with the core new feature being the ability to represent direct sum structures in addition to sequential and tensor product composition. A causally faithful extended circuit decomposition, representing a unitary U , is then one for which there is a path from an input A to an output B if and only if there actually is influence from A to B in U . We derive causally faithful extended circuit decompositions for a large class of unitaries, where in each case, the decomposition is implied by the unitary's respective causal structure. We hypothesize that every finite-dimensional unitary transformation has a causally faithful extended circuit decomposition.
Quantum mechanics has achieved unparalleled success as an operational theory, describing a wide range of experiments to remarkable accuracy. However, the physical foundations on which it rests remain as puzzling as they were a century ago, and a concise statement of the physical principles that underlie quantum mechanics is still outstanding. One promising approach holds that these principles should be formulated in terms of information, since many of the counter-intuitive effects in quantum theory concern questions such as what one can know about a quantum system and how the information encoded therein can be processed and distributed between parties. Another challenging feature of quantum theory is its incompatibility with the other cornerstone of modern physics, general relativity. In order to reconcile the two, one must identify and retain only the essential concepts and principles of each theory, and in the case of general relativity, causality has been identified as such a concept. This raises the question of how our classical understanding of causality must change when quantum theory is taken into account. In order to address these questions about information, knowledge and causality, I turn to the framework of causal models. In classical statistics, causal models explain the relations among a set of variables in terms of causal influences, which makes them a powerful tool for structuring our knowledge about complex systems and developing strategies for interacting with them. More importantly, the framework provides the conceptual underpinnings and mathematical methods for addressing questions about causation, information and knowledge in a rigorous manner. In this thesis, I develop a version of the classical causal models framework that is compatible with quantum theory and explore its physical implications. \n \n \nA first step is to define quantum versions of fundamental elements such as variables, conditionals and belief propagation rules. This allows one to consider the question of what one can come to know about a quantum variable from the point of view of causal modelling. The conditionals relating quantum variables are found to have a richer structure than their classical counterparts, which can be exploited for the task of discerning causal relations given limited data -- a central problem in classical causal modelling. The mathematical properties of quantum conditionals also establish a correspondence between various classes of two-party correlations, such as bound and distillable entanglement, and the types of causal structures that can give rise to them, which may become a useful tool for entanglement theory and quantum information processing. In the context of open quantum systems dynamics, quantum causal models provide a clear physical explanation of not completely positive maps and, more broadly, of non-Markovian quantum dynamics. Finally, I consider the possibility of non-classical effects in the way that different causal mechanisms are combined -- that is, non-classical causal structures. For the simple case of two causally ordered variables, I propose indicators that witness different classes of combinations of causal mechanisms, including a non-classical mixture, and describe an experiment realizing examples of the different classes. \n \n \nAs these results illustrate, the framework of quantum causal models provides both greater conceptual clarity and a comprehensive mathematical formalism for studying a diverse set of problems, ranging from foundational questions to applications in open systems dynamics and the exploration of non-classical causal structures, which are likely to feature in a future theory of quantum gravity. The material presented in this thesis is intended as a foundation and inspiration for further applications of quantum causal models.
Abstracting from a low level to a more explanatory high level of description, and ideally while preserving causal structure, is fundamental to scientific practice, to causal inference problems, and to robust, efficient and interpretable AI. We present a general account of abstractions between low and high level models as natural transformations, focusing on the case of causal models. This provides a new formalisation of causal abstraction, unifying several notions in the literature, including constructive causal abstraction, Q-τ consistency, abstractions based on interchange interventions, and `distributed' causal abstractions. Our approach is formalised in terms of category theory, and uses the general notion of a compositional model with a given set of queries and semantics in a monoidal, cd- or Markov category; causal models and their queries such as interventions being special cases. We identify two basic notions of abstraction: downward abstractions mapping queries from high to low level; and upward abstractions, mapping concrete queries such as Do-interventions from low to high. Although usually presented as the latter, we show how common causal abstractions may, more fundamentally, be understood in terms of the former. Our approach also leads us to consider a new stronger notion of `component-level' abstraction, applying to the individual components of a model. In particular, this yields a novel, strengthened form of constructive causal abstraction at the mechanism-level, for which we prove characterisation results. Finally, we show that abstraction can be generalised to further compositional models, including those with a quantum semantics implemented by quantum circuits, and we take first steps in exploring abstractions between quantum compositional circuit models and high-level classical causal models as a means to explainable quantum AI.
We take an order-theoretic approach to circuit (string diagram) syntax, treating a circuit as a partial order with additional input-output structure. We define morphisms between circuits and prove a factorisation theorem showing that these can, in the finite case, be regarded as formalising a notion of syntactical circuit rewrites, with quotient maps in particular corresponding to gate composition. We then consider the connectivity of a circuit, expressed as a binary relation between its inputs and outputs, and characterise the concept lattice from formal concept analysis as the unique smallest circuit that admits morphisms from all other circuits with the same connectivity. This has significance for quantum causality, particularly to the study of causal decompositions of unitary transformations. We close by constructing the circuit characterised by the dual statement.
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.