The information-theoretic costs of simulating quantum measurements

Winter’s measurement compression theorem stands as one of the most penetrating insights of quantum information theory. In addition to making an original and profound statement about measurement in quantum theory, it also underlies several other general protocols used for entanglement distillation and local purity distillation. The theorem provides for an asymptotic decomposition of any quantum measurement into noise and information. This decomposition leads to an optimal protocol for having a sender simulate many independent instances of a quantum measurement and send the measurement outcomes to a receiver, using as little communication as possible. The protocol assumes that the parties have access to some amount of common randomness, which is a strictly weaker resource than classical communication. In this paper, we provide a full review of Winter’s measurement compression theorem, detailing the information processing task, giving examples for understanding it, reviewing Winter’s achievability proof, and detailing a new approach to its single-letter converse theorem. We prove an extension of the theorem to the case in which the sender is not required to receive the outcomes of the simulated measurement. The total cost of common randomness and classical communication can be lower for such a “non-feedback” simulation, and we prove a single-letter converse theorem demonstrating optimality. We then review the Devetak-Winter theorem on classical data compression with quantum side information, providing new proofs of its achievability and converse parts. From there, we outline a new protocol that we call “measurement compression with quantum side information,” announced previously by two of us in our work on triple trade-offs in quantum Shannon theory. This protocol has several applications, including its part in the “classically-assisted state redistribution” protocol, which is the most general protocol on the static side of the quantum information theory tree, and its role in reducing the classical communication cost in a task known as local purity distillation. We also outline a connection between measurement compression with quantum side information and recent work on entropic uncertainty relations in the presence of quantum memory. Finally, we prove a singleletter theorem characterizing measurement compression with quantum side information when the sender is not required to obtain the measurement outcome. 1 ar X iv :1 20 6. 41 21 v2 [ qu an tph ] 1 8 Se p 20 12