It is a relatively new insight of classical statistics that empirical data can contain information about causation rather than mere correlation. First algorithms have been proposed that are capable of testing whether a presumed causal relationship is compatible with an observed distribution. However, no systematic method is known for treating such problems in a way that generalizes to quantum systems. Here, we describe a general algorithm for computing information–theoretic constraints on the correlations that can arise from a given causal structure, where we allow for quantum systems as well as classical random variables. The general technique is applied to two relevant cases: first, we show that the principle of information causality appears naturally in our framework and go on to generalize and strengthen it. Second, we derive bounds on the correlations that can occur in a networked architecture, where a set of few-body quantum systems is distributed among some parties. Empirical data can contain information about causation rather than mere correlation. Here Chaves et al. present an algorithm for computing constraints on the correlations arising from a given quantum causal structure, and apply this framework to the information causality principle and networked architectures.
It is a relatively new insight of classical statistics that empirical data can contain information about causation rather than mere correlation. First algorithms have been proposed that are capable of testing whether a presumed causal relationship is compatible with an observed distribution. However, no systematic method is known for treating such problems in a way that generalizes to quantum systems. Here, we describe a general algorithm for computing information–theoretic constraints on the correlations that can arise from a given causal structure, where we allow for quantum systems as well as classical random variables. The general technique is applied to two relevant cases: first, we show that the principle of information causality appears naturally in our framework and go on to generalize and strengthen it. Second, we derive bounds on the correlations that can occur in a networked architecture, where a set of few-body quantum systems is distributed among some parties. Empirical data can contain information about causation rather than mere correlation. Here Chaves et al. present an algorithm for computing constraints on the correlations arising from a given quantum causal structure, and apply this framework to the information causality principle and networked architectures.
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.
I introduce an algorithm to detect one-way quantum information between two interacting quantum systems, i.e. the direction and orientation of the information transfer in arbitrary quantum dynamics. I then build an information-theoretic quantifier of one-way information which satisfies a set of desirable axioms. In particular, it correctly evaluates whether correlation implies one-way quantum information, and when the latter is transferred between uncorrelated systems. In the classical scenario, the quantity measures information transfer between random variables. I also generalize the method to identify and rank concurrent sources of quantum information flow in many-body dynamics, enabling to reconstruct causal patterns in complex networks.
Quantum mechanics has been a paradigm shift and a revolutionary framework in our understanding of the physical world. The theory has been able to describe a wide variety of phenomena and has been experimentally verified with great precision. Despite that, to this day, the seemingly ad hoc formulation of quantum theory and several of its features still elude an intuitive understanding. At the same time, the applications of quantum mechanics in information theory have emerged as a promising avenue. Namely, its potential advantages in computation, in the so-called nascent field of quantum computation and in communication and information processing tasks such as quantum teleportation and super-dense coding. In all these endeavours, a significant effort has been made in understanding the maximum extent to which quantum mechanics can provide an advantage. This thesis explores an intersection of these two research lines, i.e. to have a physical explanation of some of the features of quantum mechanics and at the same time, study the outer limits of quantum mechanics. The combining insight rests on a newer foundational idea: that information itself is physical rather than an abstract entity and thus, is subject to physical laws. In this thesis, we explore the principle of information causality, which states that in any communication scenario, the amount of information carried is bounded by the degrees of freedom of the carrier. Information causality was initially proposed as a physical principle aimed at deriving the predictions of quantum mechanics on the type of correlations observed in a Bell scenario, which is a communication scenario involving multiple parties with access to a shared randomness resource. This principle has been proposed to recover some of the well-known features of quantum mechanics, specifically Tsirelson’s bound of the Clauser-Horne-Shimony-Holt inequality. Earlier results found limited generalisations due to the difficulty of deducing implications of the information causality principle. In this thesis, we greatly expand the scope of applicability of the principle. We develop a general-purpose algorithm to derive constraints on the set of quantum correlations. We extend the principle to be applicable to a wider variety of Bell scenarios, derive new families of quantum Bell inequalities and prove new bounds on the success probabilities of Entanglement Assisted Random Access Codes. We introduce an extension of the principle which applies to any distributed computing scenario. Using this extension, we improve on several previously known results in the field, and in certain cases, we even recover part of the quantum set as well. This extension provides rich insights into the communication complexity of distributed functions, using which we prove theory-independent randomised communication complexity bounds for several well-known functions and provide another general-purpose algorithm to bound the randomised quantum communication complexity of any function. As a consequence of the extension, we also establish that the extension supersedes the principle of non-trivial communication complexity.
Information Causality was introduced as a physical principle for constraining the set of nonlocal correlations. In recent work, we proposed an extension of Information Causality that allows correlations among Alice's inputs. This extended principle yields tighter constraints than the original formulation and recovers part of the quantum boundary in certain Bell scenarios. In this work, we further investigate the implications of extended Information Causality and apply it to scenarios beyond binary inputs and outputs. We derive a family of quantum Bell inequalities that strengthen previously known constraints on quantum correlations. Using these inequalities, we obtain an improved analytical bound for the Collins-Gisin family of Bell inequalities. We also apply Information Causality to entanglement-assisted random access codes and derive new theory-independent analytical bounds on the winning probability. For this latter task, we prove that, despite being stronger in general, the extended principle does not improve the bounds obtained from the original Information Causality principle. This suggests that the existing Information Causality bounds are optimal for this class of random access codes.
Bell's theorem asserts that no local hidden variable theory can explain the predictions of quantum theory in an experiment where spacelike separated measurements are performed in distant laboratories. Loophole-free Bell tests performed in the last decade demonstrate Bell nonlocality as a property of Nature. However, the amount of nonlocality allowed in quantum theory is limited, compared to the sole restriction of no-signaling, meaning the impossibility of faster-than-light communication implied by special relativity. Information causality is a physical principle that generalizes no-signaling and is satisfied by quantum theory. It is based on the idea that shared quantum entanglement cannot enable a receiver to obtain more classical information than how much was sent by a distant sender. Remarkably, the principle was shown to imply the maximal quantum bound for the violation of the most well-known Bell inequality. The aim of this thesis is to widen our understanding of information causality and compare its predictions with other known outer approximations of the quantum set of correlations. We build upon the recent realization that most of the known consequences of information causality can be derived with a single copy of the shared systems, whereas before it was thought that many copies were necessary. We develop a novel optimization framework which bounds the possible violations of information causality by other sets of correlations, allowing us to certify when violations are not possible. We generalize the statement of information causality and reach a precise definition for the set of correlations satisfying this principle. We show that when searching for violations of information causality by physical theories, considering many copies is not necessary. Our aforementioned optimization framework approximates the information causality set from the outside. Conversely, we propose a different approach which allows us to approximate this set from the inside.
Bayesian networks provide a powerful tool for reasoning about probabilistic causation, used in many areas of science. They are, however, intrinsically classical. In particular, Bayesian networks naturally yield the Bell inequalities. Inspired by this connection, we generalise the formalism of classical Bayesian networks in order to investigate non-classical correlations in arbitrary causal structures. Our framework of `generalised Bayesian networks' replaces latent variables with the resources of any generalised probabilistic theory, most importantly quantum theory, but also, for example, Popescu-Rohrlich boxes. We obtain three main sets of results. Firstly, we prove that all of the observable conditional independences required by the classical theory also hold in our generalisation; to obtain this, we extend the classical d-separation theorem to our setting. Secondly, we find that the theory-independent constraints on probabilities can go beyond these conditional independences. For example we find that no probabilistic theory predicts perfect correlation between three parties using only bipartite common causes. Finally, we begin a classification of those causal structures, such as the Bell scenario, that may yield a separation between classical, quantum and general-probabilistic correlations.