One-Shot Classical Data Compression with Quantum Side Information and the Distillation of Common Randomness or Secret Keys

TL;DR

This paper investigates one-shot classical data compression with quantum side information, establishing entropy-based bounds and exploring the distillation of common randomness and secret keys in hybrid classical-quantum systems.

Contribution

It introduces a smooth max-entropy framework for one-shot classical data compression with quantum side information and derives bounds on common randomness and secret key distillation.

Findings

Smooth max-entropy governs compression limits with quantum side information.

Bounds on common randomness and secret keys are established in one-shot hybrid systems.

Results connect classical data compression with quantum information theory.

Abstract

The task of compressing classical information in the one-shot scenario is studied in the setting where the decompressor additionally has access to some given quantum side information. In this hybrid classical-quantum version of the famous Slepian-Wolf problem, the smooth max-entropy is found to govern the number of bits into which classical information can be compressed so that it can be reliably recovered from the compressed version and quantum side information. Combining this result with known results on privacy amplification then yields bounds on the amount of common randomness and secret key that can be recovered in one-shot from hybrid classical-quantum systems using one-way classical communication.