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.
Consider a source of pure quantum states with density matrix ρ and von Neumann entropy S . It is known that the quantum information of the source may be faithfully compressed to 5 qubits/signal (asymptotically for long sequences) and that this limit is optimal if we demand high fidelity for long strings of signals. The usual method for achieving this compression, based on the typical subspace of the source, requires knowledge of the density matrix. We describe a new “universal” compression scheme which does not even require knowledge of ρ. More precisely, suppose that the source is known to have von Neumann entropy less than some given bound S 0 but is otherwise completely unspecified. Our method will faithfully compress the quantum information of any such source to S 0 qubits/signal. It is known that S is always less than or equal to the Shannon entropy H of the prior distribution of the source. According to Shannon’s theorem, H provides the limit for compression of classical signals, so one may ask the question: what is the physical origin of the extra compression available in the quantum case compared to the classical case (where the prior probabilities are the same)? One may suggest that this effect is a consequence of possible non-orthogonality of signal states. However we demonstrate that it is possible to make each pair of signal states of a source more parallel (keeping the prior probabilities the same) while increasing the von Neumann entropy. This casts doubt on the conventional wisdom that overlap of quantum states is a measure of their (non-)distinguishability. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This chapter describes the principle of compression in quantum communication channels. The underlying concept is that it is possible to convey “faithfully” a quantum message with a large number of qubits, while transmitting a compressed version of this message with a reduced number of qubits through the channel. Beyond the mere notion of fidelity , which characterizes the quality of quantum message transmission, the description brings the new concept of typicality in the space defined by all possible “quantum codewords.” The theorem of Schumacher's quantum compression states that for a qubit source with von Neumann entropy S , the message compression factor R has S − ε for the lower bound, where ε is any nonnegative parameter that can be made arbitrarily small for sufficiently long messages (hence, R ≈ S is the best possible compression factor). An original graphical and numerical illustration of the effect of Schumacher's quantum compression and the evolution of the typical quantum-codeword subspace with increasing message length is provided. Quantum data compression and fidelity In this chapter, we have reached the stage where it is possible to start addressing the issues that are central to information theory, namely, “How efficiently can we code information in a quantum communication channel?” both in terms of economy of means – the concept of data compression – and accuracy of transmission – the concept of message integrity or minimal data error , referred to here as fidelity .
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, whom we name Alice, and a single receiver, whom we name 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 information-processing 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 for 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. […]
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.
Data compression is a fundamental problem in quantum and classical information theory. A typical version of the problem is that the sender Alice receives a (classical or quantum) state from some known ensemble and needs to transmit them to the receiver Bob with average error below some specified bound. We consider the case in which the message can have a variable length and the goal is to minimize its expected length. For classical messages this problem has a well-known solution given by Huffman coding. In this scheme, the expected length of the message is equal to the Shannon entropy of the source (with a constant additive factor) and the scheme succeeds with zero error. This is a single-shot result which implies the asymptotic result, viz. Shannon's source coding theorem, by encoding each state sequentially. For the quantum case, the asymptotic compression rate is given by the von-Neumann entropy. However, we show that there is no one-shot scheme which is able to match this rate, even if interactive communication is allowed. This is a relatively rare case in quantum information theory when the cost of a quantum task is significantly different than the classical analogue. Our result has implications for direct sum theorems in quantum communication complexity and one-shot formulations of Quantum Reverse Shannon theorem.
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.