Incompressibility of classical distributions
Anurag Anshu, Debbie Leung, and Dave Touchette

TL;DR
This paper establishes a fundamental lower bound on the data transmission rate for classical state ensembles in quantum compression, demonstrating that certain classical ensembles are inherently incompressible even with shared entanglement and constant error tolerance.
Contribution
It provides a general, robust lower bound on the compression rate for classical states, showing that some ensembles cannot be significantly compressed beyond the Holevo information.
Findings
Proves a near-maximal separation between achievable rate and Holevo information for a two-state ensemble.
Demonstrates that classical ensembles can be inherently incompressible, with minimal reduction in communication cost.
Links incompressibility to limitations in cloning and distinguishing classical states.
Abstract
In blind compression of quantum states, a sender Alice is given a specimen of a quantum state drawn from a known ensemble (but without knowing what is), and she transmits sufficient quantum data to a receiver Bob so that he can decode a near perfect specimen of . For many such states drawn iid from the ensemble, the asymptotically achievable rate is the number of qubits required to be transmitted per state. The Holevo information is a lower bound for the achievable rate, and is attained for pure state ensembles, or in the related scenario of entanglement-assisted visible compression of mixed states wherein Alice knows what state is drawn. In this paper, we prove a general and robust lower bound on the achievable rate for ensembles of classical states, which holds even in the least demanding setting when Alice and Bob share free entanglement and a constant per-copy…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
