This thesis explores various perspectives on quantum phenomena, and how our understanding of these phenomena is informed by the study of general probabilistic theories. Particular attention is given to quantum nonlocality, and its interaction with areas of physical and mathematical interest such as entropy, reversible dynamics, information-based games and the idea of negative probability. We begin with a review of non-signaling distributions and convex operational theories, including “black box” descriptions of experiments and the mathematics of convex vector spaces. In Chapter 3 we derive various classical and quantum-like quasiprobabilistic representations of arbitrary non-signaling distributions. Previously, results in which the density operator is allowed to become non-positive [1] have proved useful in derivations of quantum theory from physical requirements [2]; we derive a dual result in which the measurement operators instead are allowed to become non-positive, and show that the generation of any non-signaling distribution is possible using a fixed separable state with negligible correlation. We also derive two distinct “quasi-local” models of non-signaling correlations. Chapter 4 investigates non-local games, in particular the game known as Information Causality. By analysing the probability of success in this game, we prove the conjectured tightness of a bound given in [3] concerning how well entanglement allows us to perform the task of random access coding, and introduce a quadratic bias bound which seems to capture a great deal of information about the set of quantum-achievable correlations. By reformulating Information Causality in terms of entropies, we find that a sensible measure of entropy precludes many general probabilistic theories whose non-locality is stronger than that of quantum theory. Chapter 5 explores the role that reversible transitivity (the principle that any two pure states are joined by a reversible transformation) plays as a characteristic feature of quantum theory. It has previously been shown that in Boxworld, the theory allowing for the full set of non-signaling correlations, any reversible transformation on a restricted class of composite systems is merely a composition of relabellings of measurement choices and outcomes, and permutations of subsystems [4]. We develop a tabular description of Boxworld states and effects first introduced in [5], and use this to extend this reversibility result to any composite Boxworld system in which none of the subsystems are classical.
This thesis explores various perspectives on quantum phenomena, and how our understanding of these phenomena is informed by the study of general probabilistic theories. Particular attention is given to quantum nonlocality, and its interaction with areas of physical and mathematical interest such as entropy, reversible dynamics, information-based games and the idea of negative probability. We begin with a review of non-signaling distributions and convex operational theories, including “black box” descriptions of experiments and the mathematics of convex vector spaces. In Chapter 3 we derive various classical and quantum-like quasiprobabilistic representations of arbitrary non-signaling distributions. Previously, results in which the density operator is allowed to become non-positive [1] have proved useful in derivations of quantum theory from physical requirements [2]; we derive a dual result in which the measurement operators instead are allowed to become non-positive, and show that the generation of any non-signaling distribution is possible using a fixed separable state with negligible correlation. We also derive two distinct “quasi-local” models of non-signaling correlations. Chapter 4 investigates non-local games, in particular the game known as Information Causality. By analysing the probability of success in this game, we prove the conjectured tightness of a bound given in [3] concerning how well entanglement allows us to perform the task of random access coding, and introduce a quadratic bias bound which seems to capture a great deal of information about the set of quantum-achievable correlations. By reformulating Information Causality in terms of entropies, we find that a sensible measure of entropy precludes many general probabilistic theories whose non-locality is stronger than that of quantum theory. Chapter 5 explores the role that reversible transitivity (the principle that any two pure states are joined by a reversible transformation) plays as a characteristic feature of quantum theory. It has previously been shown that in Boxworld, the theory allowing for the full set of non-signaling correlations, any reversible transformation on a restricted class of composite systems is merely a composition of relabellings of measurement choices and outcomes, and permutations of subsystems [4]. We develop a tabular description of Boxworld states and effects first introduced in [5], and use this to extend this reversibility result to any composite Boxworld system in which none of the subsystems are classical.
Quantum theory is considered to be the most fundamental and most accurate physical theory of today. Although quantum theory is conceptually difficult to understand, its mathematical structure is quite simple. What determines this particularly simple and elegant mathematical structure? In short: Why is quantum theory as it is? Addressing such questions is the aim of investigating the foundations of quantum theory. In the past this field of research was sometimes considered as an academic subject without much practical impact. However, with the emergence of quantum information theory this perception has changed significantly and both fields started to fruitfully influence each other. Today fundamental aspects of quantum theory attract increasing attention and the field belongs to the most exciting subjects of theoretical physics. This thesis is concerned with a particular branch in this field, namely, with so-called Generalized Probabilistic Theories (GPTs), which provide a unified theoretical framework in which classical and quantum theory emerge as special cases. This is used to examine nonlocal features that help to distinguish quantum theory from alternative toy theories. In order to extend the scope of theories that can be examined with the framework, we also introduce several generalizations to the framework itself. We start in Chapter 1 with introducing the standard GPT framework and summarize previous results, based on a review paper of the author [New J. Phys. 13, 063024 (2011)]. To keep the introduction accessible to a broad readership, we follow a constructive approach. Starting from few basic physically motivated assumptions we show how a given set of observations can be manifested in an operational theory. Furthermore, we characterize consistency conditions limiting the range of possible extensions. We point out that non-classical features of single systems can equivalently result from higher dimensional classical theories that have been restricted. Entanglement and non-locality, however, are shown to be genuine non-classical features. We review features that have been found to be specific for quantum theory separably or single and joint systems. Chapter 2 incorporates results published in [J. Phys. A 47(32), pp. 1-32 (2014)] and [Proc. QPL 2011 via EPTCS vol. 95, pp. 183–192 (2012)]. The GPT framework is applied to show how the structure of local state spaces indirectly affects possible nonlocal correlations, which are global properties of a theory. These correlations are stronger than those possible in a classical theory, but happen to show different restrictions that can be linked to the structure of subsystems. We first illustrate the phenomenon with toy theories with particular local state spaces. We than show that a particular class of joint states (inner product states), whose existence depends on geometrical properties of the local subsystems, can only have correlations for a known limited set called Q1. All bipartite correlations of both, quantum and classical correlations, can be mapped to measurement statistics from such joint states. Chapter 3 shows unpublished results on entanglement swapping in GPTs. This protocol, which is well known in quantum information theory, allows to nonlocally transfer entanglement to initially unentangled parties with the help of a third party that shares entanglement with each. We review our approach published in [Proc. QPL 2011 via EPTCS vol. 95, pp. 183–192 (2012)], which mimics the joint systems' structure of quantum theory by modifying a popular toy theory known as boxworld. However, it is illustrated that this approach fails for bigger multipartite systems due to inconsistencies evoked by entanglement swapping. It turns out that the GPT framework does not allow entanglement swapping for general subsystems with two-dimensional state spaces with transitive pure states. Altering the GPT framework to allow completely globally degrees of freedom, however, enables us to construct consistent entanglement swapping for these subsystems. This construction resembles the situation in quantum theory on a real Hilbert space. A questionable assumption usually taken in the standard GPT framework is the so-called no-restriction hypothesis. It states that the measurement that are possible in a theory can be derived from the state space. In fact, this assumption seems to exist for reasons of mathematical convenience, but it seems to lack physical motivation. We generalize the GPT framework to also account for systems that do not obey the no-restriction hypothesis in Chapter 4, which presents results published in [Phys. Rev. A 87, 052131 (2013)] and [Proc. QPL 2013, to be published in EPTCS]. The extended framework includes new classes of probabilistic theories. As an example, we show how to construct theories that include intrinsic noise. We also provide a "self-dualization" procedure that requires the violation of the no-restriction hypothesis. This procedure restricts the measurement of arbitrary theories such that the theories act as if they were self-dual. Self-duality has recently gathered lots of interest, since such theories share many features of quantum theory. For example Tsirelson’s bound holds for correlations on the maximally entangled state in these theories. Finally, we characterize the maximal set of joint states that can be consistently defined for given subsystems. This generalizes the maximal tensor product of the standard GPT framework.
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.
Physics has two main ambitions: to predict and to understand. Indeed, physics aims for the prediction of all natural phenomena. Prediction entails modeling the correlation between an action, the input, and what is subsequently observed, the output.Understanding, on the other hand, involves developing insightful principles and models that can explain the widest possible varietyof correlations present in nature. Remarkably, advances in both prediction and understanding foster our physical intuition and, as a consequence, novel and powerful applications are discovered. Quantum mechanics is a very successful physical theory both in terms of its predictive power as well as in its wide applicability. Nonetheless and despite many decades of development, we do not yet have a proper physical intuition of quantum phenomena. I believe that improvements in our understanding of quantum theory will yield better, and more innovative, protocols and vice versa.This dissertation aims at advancing our understanding and developing novel protocols. This is done through four approaches. The first one is to study quantum theory within a broad family of theories. In particular, we study quantum theory within the family of locally quantum theories. We found out that the principle that singles out quantum theory out of this family, thus connecting quantum local and nonlocal structure, is dynamical reversibility. This implies that the viability of large scale quantum computing can be based on concrete physical principles that can be experimentally tested at a local level without needing to test millions of qubits simultaneously. The second approach is to study quantum correlations from a black box perspective thus making as few assumptions as possible. The strategy is to study the completeness of quantum predictions by benchmarking them against alternative models. Three main results and applications come out of our study. Firstly, we prove that performing complete amplification of randomness starting from a source of arbitrarily weak randomness - a task that is impossible with classical resources - is indeed possible via nonlocality. This establishes in our opinion the strongest evidence for a truly random event in nature so far. Secondly, we prove that there exist finite events where quantum theory gives predictions as complete as any no-signaling theory can give, showing that the completeness of quantum theory is not an asymptotic property. Finally, we prove that maximally nonlocal theories can never be maximally random while quantum theory can, showing a trade-off between the nonlocality of a theory and its randomness capabilities. We also prove that quantum theory is not unique in this respect. The third approach we follow is to study quantum correlations in scenarios where some parties have a restriction on the available quantum degrees of freedom. The future progress of semi-device-independent quantum information depends crucially on our ability to bound the strength of these correlations. Here we provide a full characterization via a complete hierarchy of sets that approximate the target set from the outside. Each set can be in turn characterized using standard numerical techniques. One application of our work is certifying multidimensional entanglement device-independently.The fourth approach is to confront quantum theory with computer science principles. In particular, we establish two interesting implications for quantum theory results of raising the Church-Turing thesis to the level of postulate. Firstly, we show how different preparations of the same mixed state, indistinguishable according to the quantum postulates, become distinguishable when prepared computably. Secondly, we identify a new loophole for Bell-like experiments: if some parties in a Bell-like experiment use private pseudorandomness to choose their measurement inputs, the computational resources of an eavesdropper have to be limited to observe a proper violation of non locality.
We investigate the concept of entropy in probabilistic theories more general than quantum mechanics, with particular reference to the notion of information causality (IC) recently proposed by Pawlowski et al (2009 arXiv:0905.2292). We consider two entropic quantities, which we term measurement and mixing entropy. In the context of classical and quantum theory, these coincide, being given by the Shannon and von Neumann entropies, respectively; in general, however, they are very different. In particular, while measurement entropy is easily seen to be concave, mixing entropy need not be. In fact, as we show, mixing entropy is not concave whenever the state space is a non-simplicial polytope. Thus, the condition that measurement and mixing entropies coincide is a strong constraint on possible theories. We call theories with this property monoentropic . Measurement entropy is subadditive, but not in general strongly subadditive. Equivalently, if we define the mutual information between two systems A and B by the usual formula I ( A : B )= H ( A )+ H ( B )- H ( AB ), where H denotes the measurement entropy and AB is a non-signaling composite of A and B , then it can happen that I ( A : BC )< I ( A : B ). This is relevant to IC in the sense of Pawlowski et al : we show that any monoentropic non-signaling theory in which measurement entropy is strongly subadditive, and also satisfies a version of the Holevo bound, is informationally causal, and on the other hand we observe that Popescu–Rohrlich boxes, which violate IC, also violate strong subadditivity. We also explore the interplay between measurement and mixing entropy and various natural conditions on theories that arise in quantum axiomatics.
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.
Chapter 1: On the existence of quantum representations for two dichotomic measurements. Under which conditions do outcome probabilities of measurements possess a quantum-mechanical model? This kind of problem is solved here for the case of two dichotomic von Neumann measurements which can be applied repeatedly to a quantum system with trivial dynamics. The solution uses methods from the theory of operator algebras and the theory of moment problems. The ensuing conditions reveal surprisingly simple relations between certain quantum-mechanical probabilities. It also shown that generally, none of these relations holds in general probabilistic models. This result might facilitate further experimental discrimination between quantum mechanics and other general probabilistic theories. Chapter 2: Possibilistic Physics. I try to outline a framework for fundamental physics where the concept of probability gets replaced by the concept of possibility. Whereas a probabilistic theory assigns a state-dependent probability value to each outcome of each measurement, a possibilistic theory merely assigns one of the state-dependent labels "possible to occur" or "impossible to occur" to each outcome of each measurement. It is argued that Spekkens' combinatorial toy theory of quantum mechanics is inconsistent in a probabilistic framework, but can be regarded as possibilistic. Then, I introduce the concept of possibilistic local hidden variable models and derive a class of possibilistic Bell inequalities which are violated for the possibilistic Popescu-Rohrlich boxes. The chapter ends with a philosophical discussion on possibilistic vs. probabilistic. It can be argued that, due to better falsifiability properties, a possibilistic theory has higher predictive power than a probabilistic one. Chapter 3: The quantum region for von Neumann measurements with postselection. It is determined under which conditions a probability distribution on a finite set can occur as the outcome distribution of a quantum-mechanical von Neumann measurement with hyphenation given that the scalar product between the initial and the final state is known as well as the success probability of the postselection. An intermediate von Neumann measurement can enhance transition probabilities between states such that the error probability shrinks by a factor of up to 2. Chapter 4: A presentation of the category of stochastic matrices. This chapter gives generators and relations for the strict monoidal category of probabilistic maps on finite cardinals (i.e., stochastic matrices). Chapter 5: Convex Spaces: Definition and Examples. We try to promote convex spaces as an abstract concept of convexity which was introduced by Stone as "barycentric calculus''. A convex space is a set where one can take convex combinations in a consistent way. By identifying the corresponding Lawvere theory as the category from chapter 4 and using the results obtained there, we give a different proof of a result of Swirszcz which shows that convex spaces can be identified with algebras of a finitary version of the Giry monad. After giving an extensive list of examples of convex sets as they appear throughout mathematics and theoretical physics, we note that there also exist convex spaces that cannot be embedded into a vector space: semilattices are a class of examples of purely combinatorial type. In an information-theoretic interpretation, convex subsets of vector spaces are probabilistic, while semilattices are possibilistic. Convex spaces unify these two concepts.