This PhD thesis contains a general introduction and three main chapters. Chapter 2 investigates Bell inequalities that generalize the CHSH and Braunstein-Caves inequalities. Chapter 3 shows a derivation of an upper bound on the success probability of a class of quantum teleportation protocols, denoted as port-based teleportation, from the no-cloning theorem and the no-signalling principle. Chapter 4 introduces the principle of quantum information causality. Chapter 2 considers the predictions of quantum theory and local hidden variable theories (LHVT) for the correlations obtained by measuring a pair of qubits by projections defined by randomly chosen axes separated by a given angle θ. The predictions of LHVT correspond to binary colourings of the Bloch sphere with antipodal points oppositely coloured. We show a Bell inequality for all θ, which generalizes the CHSH and the Braunstein-Caves inequalities in the sense that the measurement choices are not restricted to be in a finite set, but are constrained only by the angle θ. We motivate and explore the hypothesis that for a continuous range of θ > 0, the maximum correlation (anticorrelation) is obtained by assigning to one qubit the colouring with one hemisphere black and the other white, and assigning the same (reverse) colouring to the other qubit. We describe numerical tests that are consistent with this hypothesis and bound the range of θ. Chapter 3 shows a derivation of an upper bound on the success probability of port-based teleportation from the no-cloning theorem and the no-signalling principle. Chapter 4 introduces the principle of quantum information causality, a quantum version of the information causality principle. The quantum information causality principle states the maximum amount of quantum information that a transmitted quantum system can communicate as a function of its dimension, independently of any quantum physical resources previously shared by the communicating parties. These principles reduce to the no-signalling principle if no systems are transmitted. We present a new quantum information task, the quantum information causality game, whose success probability is upper bounded by the new principle, and show that an optimal strategy to perform it combines the quantum teleportation and superdense coding protocols with a task that has classical inputs.
This PhD thesis contains a general introduction and three main chapters. Chapter 2 investigates Bell inequalities that generalize the CHSH and Braunstein-Caves inequalities. Chapter 3 shows a derivation of an upper bound on the success probability of a class of quantum teleportation protocols, denoted as port-based teleportation, from the no-cloning theorem and the no-signalling principle. Chapter 4 introduces the principle of quantum information causality. Chapter 2 considers the predictions of quantum theory and local hidden variable theories (LHVT) for the correlations obtained by measuring a pair of qubits by projections defined by randomly chosen axes separated by a given angle θ. The predictions of LHVT correspond to binary colourings of the Bloch sphere with antipodal points oppositely coloured. We show a Bell inequality for all θ, which generalizes the CHSH and the Braunstein-Caves inequalities in the sense that the measurement choices are not restricted to be in a finite set, but are constrained only by the angle θ. We motivate and explore the hypothesis that for a continuous range of θ > 0, the maximum correlation (anticorrelation) is obtained by assigning to one qubit the colouring with one hemisphere black and the other white, and assigning the same (reverse) colouring to the other qubit. We describe numerical tests that are consistent with this hypothesis and bound the range of θ. Chapter 3 shows a derivation of an upper bound on the success probability of port-based teleportation from the no-cloning theorem and the no-signalling principle. Chapter 4 introduces the principle of quantum information causality, a quantum version of the information causality principle. The quantum information causality principle states the maximum amount of quantum information that a transmitted quantum system can communicate as a function of its dimension, independently of any quantum physical resources previously shared by the communicating parties. These principles reduce to the no-signalling principle if no systems are transmitted. We present a new quantum information task, the quantum information causality game, whose success probability is upper bounded by the new principle, and show that an optimal strategy to perform it combines the quantum teleportation and superdense coding protocols with a task that has classical inputs.
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.
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.
Quantum mechanics is nonlocal, meaning it cannot be described by any classical local hidden variable model. In this thesis we study two aspects of quantum nonlocality. Part I addresses the question of what classical resources are required to simulate nonlocal quantum correlations. We start by constructing new local models for noisy entangled quantum states. These constructions exploit the connection between nonlocality and Grothendieck's inequality, first noticed by Tsirelson. Next, we consider local models augmented by a limited amount of classical communication. After generalizing Bell inequalities to this setting, we show that (i) one bit of communication is sufficient to simulate the correlations of projective measurements on a maximally entangled state of two qubits, and (ii) five bits of communication are sufficient to simulate the joint correlation of two-outcome measurements on any bipartite quantum state. The latter result can be interpreted as a stronger (constrained) version of Grothendieck's inequality. In part II, we investigate the monogamy of nonlocal correlations. In a setting where three parties, A, B, and C, share an entangled quantum state of arbitrary dimension, we: (i) bound the trade-off between AB's and AC's violation of the CHSH inequality, obtaining an intriguing generalization of Tsirelson's bound, and (ii) demonstrate that forcing B and C to be classically correlated prevents A and B from violating certain Bell inequalities. We study not only correlations that arise within quantum theory, but also arbitrary correlations that do not allow signaling between separate groups of parties. These results are based on new techniques for obtaining Tsirelson bounds, or bounds on the quantum value of a Bell inequality, and have applications to interactive proof systems and cryptography.
How much information can a transmitted physical system fundamentally communicate? We introduce the principle of quantum information causality, which states the maximum amount of quantum information that a quantum system can communicate as a function of its dimension, independently of any previously shared quantum physical resources. We present a new quantum information task, whose success probability is upper bounded by the new principle, and show that an optimal strategy to perform it combines the quantum teleportation and superdense coding protocols with a task that has classical inputs.
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.
In port-based teleportation, Alice teleports an unknown quantum state $|\ensuremath{\psi}\ensuremath{\rangle}$ to one of N ports at Bob's site. Alice applies a measurement and sends Bob the outcome k. Bob only needs to select the kth port in order to obtain $|\ensuremath{\psi}\ensuremath{\rangle}$. We present a theorem in the spirit of the no-cloning theorem, which says that it is impossible to extract any information from an unknown quantum state if only a single copy of it is provided and if the state remains unchanged. We use this theorem and the no-signaling principle to prove an upper bound on the success probability of port-based teleportation.