arXiv:2610.14785
Classical Communication Helps Single-Shot Quantum Compression
Omri Farber, Gilad Gour
Abstract
Free classical communication can yield an unbounded single-shot saving in quantum compression, even though it leaves the asymptotic rate of an i.i.d. source unchanged. At every fixed error in $(0,1)$, we exhibit sources whose unassisted compression cost is arbitrarily large, yet a single qubit suffices with classical communication and no preshared entanglement. We establish this separation by determining the exact optimal source fidelity for compression through an $m$-dimensional noiseless quantum channel, with and without free classical communication, while preserving correlations with an inaccessible reference. Without classical assistance, the optimal fidelity is exactly the Ky Fan norm $\|ρ\|_{(m)}$, the sum of the $m$ largest eigenvalues of the source state. With classical assistance, we obtain an explicit spectral threshold formula and a protocol attaining it. Classical communication strictly improves fidelity whenever $m$ is smaller than the source rank. The corresponding compression costs are two smoothed versions of the log-rank entropy, also called max-entropy: trace-distance smoothing under local operations and quadratic smoothing under LOCC. For i.i.d. copies of a fixed source with positive entropy variance, however, the two costs have identical first-, second-, and third-order asymptotic terms. For nonlattice spectra, we determine the constant-order advantage: classical communication saves $\log_2(e)-1$ bits per block asymptotically, and the ratio of assisted to unassisted minimum communication dimensions converges to $2/e$.
AI Summary
The paper asks how free classical communication changes single-shot quantum compression without preshared entanglement, when reconstruction must preserve correlations with an inaccessible reference. Accuracy is measured by source fidelity, the square root of entanglement fidelity. It determines the optimal fidelity through an $m$-dimensional noiseless quantum channel exactly. With local encoding and decoding alone, the optimum is $\sum_{i=1}^m p_i$, where $p_i$ are the source eigenvalues in decreasing order. With LOCC, it is $\max_{0\leq\Lambda\leq I,\,\operatorname{tr}\Lambda^2\leq m}\operatorname{tr}(\rho\Lambda)$, with an explicit clipped spectral optimizer. Classical communication strictly improves fidelity whenever $m<\operatorname{rank}\rho$. The corresponding minimum dimensions are characterized by trace-distance-smoothed log-rank and a quadratic effect smoothing, respectively. At every fixed fidelity threshold $1-\epsilon\in(0,1)$, an explicit family of rank-$n^2+1$ sources requires dimension $n+1$ without assistance but only dimension two with classical communication. For i.i.d. copies of a fixed source with positive entropy variance, both costs share the first three asymptotic orders. For nonlattice log-spectra, the assisted-to-unassisted dimension ratio converges to $2/e$, saving $\log_2(e)-1\approx0.442695$ bits per block. Proofs combine channel converses, a reduction of LOCC implementations to rank-bounded Kraus operators, an explicit instrument attaining the previously studied quadratic optimum, and spectral asymptotics. The constant-order limit excludes lattice spectra; uniform spectra have a different limit. Minimum classical communication is not determined, and extensions to quantum side information remain open.
the authors used GPT-6 Astra via Codex for substantial assistance in exploring, developing, and checking the i.i.d. asymptotic analysis leading to Theorem~\ref{thm:higher-order}, as well as in preparing the manuscript and organizing references.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 23 pages, no figures, comments are welcome