Abstract Quantum direct coding or Schumacher compression generalised the ideas of Shannon theory, gave an operational meaning to the von Neumann entropy and established the term qubit. But remembering that information processing is carried out by physical processes prompts one to wonder what thermodynamic resources are required to compress quantum information and how they constrain one’s ability to perform this task. That is, if Alice and Bob only have access to thermal quantum states and clocks with finite accuracy, how well can they measure, encode and decode pure quantum state messages? In this work we examine these questions by modeling Alice’s typical measurement as a unitary involving a measurement probe, investigating imperfect timekeeping on encoding and decoding and considering the role of temperature in Bob’s appended qubits. In doing so, we derive fidelity bounds for this protocol involving the correlations Alice can form with their measurement probe, the variance of the clock’s ticks and the temperature of Bob’s qubits. Finally, we give an insight into the entropy produced by these two agents throughout the compression protocol by relating the resources they use to a quantum thermodynamic cooling protocol.
Abstract Quantum direct coding or Schumacher compression generalised the ideas of Shannon theory, gave an operational meaning to the von Neumann entropy and established the term qubit. But remembering that information processing is carried out by physical processes prompts one to wonder what thermodynamic resources are required to compress quantum information and how they constrain one’s ability to perform this task. That is, if Alice and Bob only have access to thermal quantum states and clocks with finite accuracy, how well can they measure, encode and decode pure quantum state messages? In this work we examine these questions by modeling Alice’s typical measurement as a unitary involving a measurement probe, investigating imperfect timekeeping on encoding and decoding and considering the role of temperature in Bob’s appended qubits. In doing so, we derive fidelity bounds for this protocol involving the correlations Alice can form with their measurement probe, the variance of the clock’s ticks and the temperature of Bob’s qubits. Finally, we give an insight into the entropy produced by these two agents throughout the compression protocol by relating the resources they use to a quantum thermodynamic cooling protocol.
This chapter begins our first exciting application of the postulates of the quantum theory to quantum communication. We study the fundamental, unit quantum communication protocols. These protocols involve a single sender Alice and a single receiver Bob. The protocols are ideal and noiseless because we assume that Alice and Bob can exploit perfect classical communication, perfect quantum communication, and perfect entanglement. At the end of this chapter, we suggest how to incorporate imperfections into these protocols for later study. Alice and Bob may wish to perform one of several quantum informationprocessing tasks, such as the transmission of classical information, quantum information, or entanglement. Several fundamental protocols make use of these resources: 1. We will see that noiseless entanglement is an important resource in quantum Shannon theory because it enables Alice and Bob to perform other protocols that are not possible with classical resources only. We will present a simple, idealized protocol for generating entanglement, named entanglement distribution . 2. Alice may wish to communicate classical information to Bob. A trivial method, named elementary coding , is a simple way of doing so and we discuss it briefly. 3. A more interesting technique for transmitting classical information is superdense coding . It exploits a noiseless qubit channel and shared entanglement to transmit more classical information than would be possible with a noiseless qubit channel alone. 4. Finally, Alice may wish to transmit quantum information to Bob. A trivial method for her to do so is to exploit a noiseless qubit channel. However, it is useful to have other ways for transmitting quantum information because such a resource is difficult to engineer in practice. An alternative, surprising method for transmitting quantum information is quantum teleportation . The teleportation protocol exploits classical communication and shared entanglement to transmit quantum information. Each of these protocols is a fundamental unit protocol and provides a foundation for asking further questions in quantum Shannon theory. In fact, the discovery of these latter two protocols was the stimulus for much of the original research in quantum Shannon theory. One could take each of these protocols and ask about its performance if one or more of the resources involved is noisy rather than noiseless. Later chapters of this book explore many of these possibilities.
Quantum algorithms require quantum computers performing logical operations on a sufficiently large number of entangled qubits. Unfortunately, state-of-the-art quantum computers can only operate on tens of qubits. A solution to this scalability challenge is to employ the distributed paradigm, where a network of small-scale quantum computers are used in a distributed manner. It is the aim of my work to study the fundamental limits of distributed quantum problems and to further enhance their performance by exploiting the structure inherent to these problems employing asymptotically good Algebraic codes. This thesis consists of two parts. The first part studies the task of faithfully simulating a distributed quantum measurement, wherein we provide a protocol for the three parties, Alice, Bob and {Charlie}, to simulate a repeated action of a distributed quantum measurement using a pair of non-product approximating measurements by Alice and Bob, followed by a stochastic mapping at {Charlie}. The objective of the protocol is to utilize minimum resources, in terms of classical bits needed by Alice and Bob to communicate their measurement outcomes to {Charlie}, and the common randomness shared among the three parties, while faithfully simulating independent repeated instances of the original measurement. We characterize a set of sufficient communication and common randomness rates required for asymptotic simulatability in terms of single-letter quantum information quantities. We further improve the results obtained in the above by exploiting the structure present in the Charlie's stochastic bivariate mapping using random structured POVMs based on asymptotically good algebraic codes. The algebraic structure of these codes is matched to that of the bivariate function that models the action of Charlie. This leads to the computation being performed on the fly, thus obviating the need to reconstruct individual measurement outcomes at Charlie. We provide examples to illustrate the information-theoretic gains attained by endowing POVMs with algebraic structure. As an application of the distributed measurement compression problem, we also demonstrate a multi-party purity distillation protocol. Concluding this part, we consider the lossy quantum source coding problem where the objective is to compress a given quantum source below its von Neumann entropy. Inspired by the duality connections between the rate-distortion and channel coding problems in the classical setting, we propose a new formulation for the lossy quantum source coding problem. We require that the reconstruction of the compressed quantum source fulfill a global error constraint and employ the notion of a ``posterior reference map'' to measure the reconstruction error. Using these, we characterize the asymptotic performance limit of this problem in terms of single-letter coherent information of the given posterior reference map. In the second part of this thesis, we study the advantage algebraic structured codes can provide, to the class of the classical-quantum network problems. In particular, we investigate two problems. Firstly, we consider the problem of communicating a general bivariate function of two classical sources observed at the encoders of a classical-quantum multiple access channel. We propose and analyze a coding scheme based on algebraic structured coset codes that enables the decoder to recover the desired function without recovering the sources themselves. We derive a new set of sufficient conditions that are weaker than the current known for identified examples. In addition, we analyze the performance of these algebraic codes toward studying the capacity of a special class of 3-user classical-quantum interference channel.
We introduce and analyse the problem of encoding classical information into different resources of a quantum state. More precisely, we consider a general class of communication scenarios characterised by encoding operations that commute with a unique resource destroying map and leave free states invariant. Our motivating example is given by encoding information into coherences of a quantum system with respect to a fixed basis (with unitaries diagonal in that basis as encodings and the decoherence channel as a resource destroying map), but the generality of the framework allows us to explore applications ranging from super-dense coding to thermodynamics. For any state, we find that the number of messages that can be encoded into it using such operations in a one-shot scenario is upper bounded in terms of the information spectrum relative entropy between the given state and its version with erased resources. Furthermore, if the resource destroying map is the twirling channel over some unitary group, we find matching one-shot lower bounds as well. In the asymptotic setting where we encode into many copies of the resource state, our bounds yield an operational interpretation of resource monotones such as the relative entropy of coherence and its corresponding relative entropy variance.
Even though our microscopic physical theories, such as classical or quantum mechanics, are time-reversal invariant, time appears to march forward irreversibly. It is widely believed that effective entropy increase due to the second law of thermodynamics is at the origin of this emergent arrow of time. Any system that is out of thermal equilibrium and produces entropy can thus be used as a clock, be it a melting ice cube or a sophisticated atomic clock. The understanding of entropy in physics has significantly advanced with the advent of information theory in the last century. It has also led to the insight that the amount of entropy a clock produces is linked to how precisely the clock works, and thereby, how much information the clock reveals about the passage of time. In this thesis, we ask: what fundamental limits does the underlying physical theory impose on the precision of clocks within that theory? To rigorously answer this question, we devise a minimal clock model within quantum theory. By consistently modeling all clock constituents as quantum systems, we can ensure we account for all the resources used by the clock. This includes, in particular, the readout. Classically, one can obtain this for free, but quantum mechanically, this has a resource cost associated with it. To this end, we consolidate existing frameworks that describe clocks in both classical and quantum theory. Revising fluctuation theorems from quantum thermodynamics, we demonstrate how such theorems impose limits on the attainable precision of clocks. These precision bounds turn out to be more stringent for classical systems than for quantum ones. Quantum clocks can harness coherence and correlations to suppress fluctuations, allowing them to exponentially surpass precision bounds that hold for classical clocks. We show this separation between classical and quantum clocks by constructing an explicit example that uses quantum dynamics to saturate the quantum precision bounds. Finally, we close the thesis by exploring implications of these timekeeping bounds beyond fundamental science in quantum technologies. We show how quantum clocks can be used to quantify the energetic cost of quantum computation by linking computational fidelity to thermodynamic entropy production.
This thesis addresses problems in the field of quantum information theory. The first part of the thesis is opened with concrete definitions of general quantum source models and their compression, and each subsequent chapter addresses the compression of a specific source model as a special case of the initially defined general models. First, we find the optimal compression rate of a general mixed state source which includes as special cases all the previously studied models such as Schumacher's pure and ensemble sources and other mixed state ensemble models. For an interpolation between the visible and blind Schumacher's ensemble model, we find the optimal compression rate region for the entanglement and quantum rates. Later, we study the classical-quantum variation of the celebrated Slepian-Wolf problem and the ensemble model of quantum state redistribution for which we find the optimal compression rate considering per-copy fidelity and single-letter achievable and converse bounds matching up to continuity of functions which appear in the corresponding bounds. The second part of the thesis revolves around information theoretical perspective of quantum thermodynamics. We start with a resource theory point of view of a quantum system with multiple non-commuting charges. Subsequently, we apply this resource theory framework to study a traditional thermodynamics setup with multiple non-commuting conserved quantities consisting of a main system, a thermal bath and batteries to store various conserved quantities of the system. We state the laws of the thermodynamics for this system, and show that a purely quantum effect happens in some transformations of the system, that is, some transformations are feasible only if there are quantum correlations between the final state of the system and the thermal bath.
The idea that information can be localized is pervasive in physics. In thermodynamics, entropy flows from one reservoir to another, and in quantum gravity, the entropy content of some spatial regions is bounded. In quantum information theory, information is transmitted from one place to another, and entanglement can provide an advantage when there are constraints on such transmission.
Shannon entropy quantifies localizable information in the sense that marginalization defines an outer measure on the set of parts of a classical multipartite system. In contrast, von Neumann entropy does not quantify localizable information in this sense. However, a variant of von Neumann entropy, which originates in noncommutative geometry, does.
We prove that this adjusted von Neumann entropy is the minimum quantum entropy that quantifies localizable information. We also prove that this is the unique quantum entropy that characterizes Bell states in terms of redundant information, directly generalizing the classical case. We work with finite-dimensional C∗-algebras throughout, modeling finite quantum systems that may have superselection sectors.