We show that quantum oracles provide an advantage over classical oracles for answering classical counterfactual questions in causal models, or equivalently, for identifying unknown causal parameters such as distributions over functional dependences. In structural causal models with discrete classical variables, observational data and even ideal interventions generally fail to answer all counterfactual questions, since different causal parameters can reproduce the same observational and interventional data while disagreeing on counterfactuals. Using a simple binary example, we demonstrate that if the classical variables of interest are encoded in quantum systems and the causal dependence among them is encoded in a quantum oracle, coherently querying the oracle enables the identification of all causal parameters -- hence all classical counterfactuals. We generalize this to arbitrary finite cardinalities and prove that coherent probing 1) allows the identification of all two-way joint counterfactuals p(Y_x=y, Y_{x'}=y'), which is not possible with any number of queries to a classical oracle, and 2) provides tighter bounds on higher-order multi-way counterfactuals than with a classical oracle. This work can also be viewed as an extension to traditional quantum oracle problems such as Deutsch--Jozsa to identifying more causal parameters beyond just, e.g., whether a function is constant or balanced. Finally, we raise the question of whether this quantum advantage relies on uniquely non-classical features like contextuality. We provide some evidence against this by showing that in the binary case, oracles in some classically-explainable theories like Spekkens' toy theory also give rise to a counterfactual identifiability advantage over strictly classical oracles.
We show that quantum oracles provide an advantage over classical oracles for answering classical counterfactual questions in causal models, or equivalently, for identifying unknown causal parameters such as distributions over functional dependences. In structural causal models with discrete classical variables, observational data and even ideal interventions generally fail to answer all counterfactual questions, since different causal parameters can reproduce the same observational and interventional data while disagreeing on counterfactuals. Using a simple binary example, we demonstrate that if the classical variables of interest are encoded in quantum systems and the causal dependence among them is encoded in a quantum oracle, coherently querying the oracle enables the identification of all causal parameters -- hence all classical counterfactuals. We generalize this to arbitrary finite cardinalities and prove that coherent probing 1) allows the identification of all two-way joint counterfactuals p(Y_x=y, Y_{x'}=y'), which is not possible with any number of queries to a classical oracle, and 2) provides tighter bounds on higher-order multi-way counterfactuals than with a classical oracle. This work can also be viewed as an extension to traditional quantum oracle problems such as Deutsch--Jozsa to identifying more causal parameters beyond just, e.g., whether a function is constant or balanced. Finally, we raise the question of whether this quantum advantage relies on uniquely non-classical features like contextuality. We provide some evidence against this by showing that in the binary case, oracles in some classically-explainable theories like Spekkens' toy theory also give rise to a counterfactual identifiability advantage over strictly classical oracles.
Abstract We introduce a formalism for the evaluation of counterfactual queries in the framework of quantum causal models, generalising Pearl’s semantics for counterfactuals in classical causal models, thus completing the last rung in the quantum analogue of Pearl’s ‘ladder of causation’. To this end, we define a suitable extension of Pearl’s notion of a ‘structural causal model’, which we denote analogously by ‘quantum structural causal model (QSM)’ , and a corresponding extension of Pearl’s three-step procedure of abduction, action, and prediction. We show that every classical (probabilistic) structural causal model can be extended to a QSM, and prove that counterfactual queries that can be formulated within a classical structural causal model agree with their corresponding queries in the quantum extension—but the latter is more expressive. Counterfactuals in quantum causal models come in different forms: we distinguish between active and passive counterfactual queries, depending on whether or not an intervention is to be performed in the action step. This is in contrast to the classical case, where counterfactuals are always interpreted in the active sense. Another distinctive feature of our formalism is that it breaks the connection between causal and counterfactual dependence that exists in the classical case: quantum counterfactuals allow for counterfactual dependence without causal dependence . This distinction between classical and quantum causal models may shed light on how the latter can reproduce quantum correlations that violate Bell inequalities while being faithful to the relativistic causal structure.
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.
Quantum query complexity underpins much of our understanding of quantum speedups, yet nearly all existing lower and upper bounds are derived for simple Boolean oracles. Many practical tasks-noisy database search, stochastic optimization, adaptive learning, and time-varying systems-are best modeled by richer oracle classes. This paper systematically extends quantum query complexity theory to four non-standard oracle models: (1) stochastic oracles that return random outputs drawn from a distribution; (2) multi-solution oracles encoding a solution set of size k; (3) time-dependent oracles whose internal state evolves between queries; and (4) relational oracles encoding structured constraints rather than simple membership. Using generalized adversary methods, polynomial method techniques, and hybrid arguments, we derive tight (up to polylog factors) lower bounds for each model and construct matching algorithms where possible. For instance, we show that searching for any one of k marked items in an unstructured database still admits a Grover-like quadratic speedup, but with optimal complexity Θ(N/k), and that stochastic noise in oracle outputs degrades the advantage gracefully as a function of the noise parameter. For certain time-dependent and relational models, we prove that no better-than-classical speedup is possible, clarifying the limits of quantum advantage in adaptive settings. These results provide a more realistic foundation for quantum algorithms targeting noisy search, stochastic optimization, and constraint satisfaction, and they highlight the precise structural features that enable or preclude query-based quantum speedups.
Though the topic of causal inference is typically considered in the context of classical statistical models, recent years have seen great interest in extending causal inference techniques to quantum and generalized theories. Causal identification is a type of causal inference problem concerned with recovering from observational data and qualitative assumptions the causal mechanisms generating the data, and hence the effects of hypothetical interventions. A major obstacle to a theory of causal identification in the quantum setting is the question of what should play the role of "observational data," as any means of extracting data at a certain locus will almost certainly disturb the system. Hence, one might think a priori that quantum measurements are already too much like interventions, so that the problem of causal identification trivializes. This is not the case. Fixing a limited class of quantum instruments (namely the class of all projective measurements) to play the role of "observations," we note that as in the classical setting, there exist scenarios for which causal identification is not possible. We then present sufficient conditions for quantum causal identification, starting with a quantum analogue of the well-known "front-door criterion" and finishing with a broader class of scenarios for which the effect of a single intervention is identifiable. These results emerge from generalizing the process-theoretic account of classical causal inference due to Jacobs, Kissinger, and Zanasi beyond the setting of Markov categories, and thereby treating the classical and quantum problems uniformly.
Query complexity is a common tool for comparing quantum and classical computation, and it has produced many examples of how quantum algorithms differ from classical ones. Here we investigate in detail the role that oracles play for the advantage of quantum algorithms. We do so by using a simulation framework, Quantum Simulation Logic (QSL), to construct oracles and algorithms that solve some problems with the same success probability and number of queries as the quantum algorithms. The framework can be simulated using only classical resources at a constant overhead as compared to the quantum resources used in quantum computation. Our results clarify the assumptions made and the conditions needed when using quantum oracles. Using the same assumptions on oracles within the simulation framework we show that for some specific algorithms, such as the Deutsch-Jozsa and Simon's algorithms, there simply is no advantage in terms of query complexity. This does not detract from the fact that quantum query complexity provides examples of how a quantum computer can be expected to behave, which in turn has proved useful for finding new quantum algorithms outside of the oracle paradigm, where the most prominent example is Shor's algorithm for integer factorization.
Recent years have seen great interest in extending causal inference concepts developed in the context of classical statistical models to quantum theory. So far, this program has only barely addressed causal identification, a type of causal inference problem concerned with recovering from observational data and qualitative assumptions the causal relationships generating the data, and hence the effects of hypothetical interventions. A major obstacle to a theory of causal identification in the quantum setting is the question of what should play the role of “observational data,” as any means of extracting data at a locus will almost certainly disturb the system. One might think that quantum measurements are already too much like interventions, so that the problem of causal identification is trivialized. This is not the case: when we fix a limited class of quantum measurement instruments (namely, the class of all projective measurements) to play the role of “observations,” there exist scenarios for which causal identification is impossible. In this paper, we present a framework, based on process theories (also known as strict symmetric monoidal categories), for studying quantum causal identification scenarios on the same footing as their classical counterparts. Within this framework, we present sufficient conditions for quantum causal identification in networks with unobserved confounding systems, including quantum analogs of the well-known “back-door” and “front-door” criteria. These results arise from a type of causal model designed to facilitate the transfer of inference techniques from the classical to the quantum setting. Published by the American Physical Society 2024