On quantum coding for ensembles of mixed states

We consider the problem of optimal asymptotically faithful compression for ensembles of mixed quantum states. Although the optimal rate is unknown, we prove upper and lower bounds and describe a series of illustrative examples of compression of mixed states. We also discuss a classical analogue of the problem.Comment: 23 pages, LaTe

Information transmission through a noisy quantum channel

Noisy quantum channels may be used in many information-carrying applications. We show that different applications may result in different channel capacities. Upper bounds on several of these capacities are proved. These bounds are based on the coherent information, which plays a role in quantum information theory analogous to that played by the mutual information in classical information theory. Many new properties of the coherent information and entanglement fidelity are proved. Two nonclassical features of the coherent information are demonstrated: the failure of subadditivity, and the failure of the pipelining inequality. Both properties arise as a consequence of quantum entanglement, and give quantum information new features not found in classical information theory. The problem of a noisy quantum channel with a classical observer measuring the environment is introduced, and bounds on the corresponding channel capacity proved. These bounds are always greater than for the unobserved channel. We conclude with a summary of open problems

One-shot lossy quantum data compression

We provide a framework for one-shot quantum rate distortion coding, in which the goal is to determine the minimum number of qubits required to compress quantum information as a function of the probability that the distortion incurred upon decompression exceeds some specified level. We obtain a one-shot characterization of the minimum qubit compression size for an entanglement-assisted quantum rate-distortion code in terms of the smooth max-information, a quantity previously employed in the one-shot quantum reverse Shannon theorem. Next, we show how this characterization converges to the known expression for the entanglement-assisted quantum rate distortion function for asymptotically many copies of a memoryless quantum information source. Finally, we give a tight, finite blocklength characterization for the entanglement-assisted minimum qubit compression size of a memoryless isotropic qubit source subject to an average symbol-wise distortion constraint.Comment: 36 page