arXiv:2609.38328
Exponential strong converse for blind quantum data compression
Kohdai Kuroiwa
Abstract
We establish exponential strong converse theorems for blind quantum data compression of finite-dimensional mixed-state sources, with and without entanglement assistance. Blind compression is a fundamental quantum information processing task in which the sender aims to transmit quantum states without direct access to the classical label. Strong converse is a notable aspect of data compression: the accuracy of the compression abruptly drops down to zero once the compression rate goes below a threshold. Strong converses for data compression have been established for pure-state sources; however, for mixed-state sources, the optimal compression rate is determined by a structural decomposition of quantum states and can change substantially under small perturbations. This sensitivity makes it difficult to quantitatively analyze the trade-off between compression rate and error. Despite recent progress, whether a strong converse holds at the optimal rate has remained unresolved in general. In this work, we resolve this question affirmatively. For unassisted compression, we show that at every rate below the optimum, the accuracy decays exponentially with the block length for general mixed-state sources without restrictions on protocols. We also prove exponential strong converse for blind compression with unlimited entanglement assistance at its optimal rate. Combining the two strong converse bounds yields exponential decay at every compression-entanglement rate pair outside the complete achievable rate region. Our proof introduces a new overlap quantity based on the structure of quantum states; this quantity connects preservation of the source information to the dimension of the transmitted system. We expect that this approach provides useful tools for converse analyses of other quantum information-processing tasks involving mixed states.
AI Summary
The paper asks whether the optimal rates for blind compression of general finite-dimensional mixed-state sources are strong-converse thresholds under global squared fidelity, without restrictions on encoding or decoding. Unlike pure-state compression, these rates depend on the Koashi–Imoto (KI) decomposition, whose sensitivity to approximation complicates converse arguments. It establishes exponential strong converses both without assistance and with unlimited source-independent entanglement assistance. Write $s_c$ for the KI block probabilities and $\bar\rho_c$ for the average states within nonredundant quantum blocks. The thresholds are $R_0=H(s)+\sum_c s_cS(\bar\rho_c)$ and $R_{\mathrm{EA}}=\tfrac12H(s)+\sum_c s_cS(\bar\rho_c)$. At every fixed communication rate below the relevant threshold, every protocol satisfies $F_n\leq2^{-\alpha n}$ for sufficiently large $n$, with $\alpha>0$. For an initial maximally entangled resource of ebit rate $E$, exponential decay holds whenever $R<R_{\mathrm{EA}}$ or $R+E<R_0$. The results also extend to mixed-state sources with inaccessible quantum references. The proof introduces a KI overlap measuring preservation of block purifications. A spectral-gap argument identifies the kernel of a first-order Holevo-information-loss operator with the span of KI projectors, connecting global fidelity to this overlap. Message-dimension bounds and concentration estimates then yield exponential decay; the assisted bound is independent of the shared resource’s dimension. The decay exponents are not optimized. Optimal exponents, finite-block-length communication bounds, and behavior when rates approach the region’s boundary remain open. The conclusions concern global fidelity, not per-copy distortion.
The author used OpenAI's GPT-6 Astra to explore proof ideas, check proofs, and polish the language.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 38 pages; comments welcome