arXiv:2609.32515
An exponential strong converse for private communication over degradable quantum channels
Mark M. Wilde
Abstract
We prove an exponential strong converse for the unassisted private capacity of every finite-dimensional degradable quantum channel. We use a single error criterion: the infidelity between the actual message-estimate-environment state and an ideal state consisting of uniformly distributed, perfectly correlated messages that are independent of the environment. At every rate strictly above the channel's maximum coherent information, the optimized fidelity to this ideal state decays exponentially in the number of channel uses. The same bound holds when the ideal environment state is fixed to the actual environment marginal. The proof applies to arbitrary mixed-state encoders and arbitrary collective decoders. Its main operator ingredient is an overlap bound for privacy tests: two receiver placements with a common subsystem of dimension $d_C$ have overlap at most $d_C/M$, where $M$ is the key size, independently of both shield dimensions. We combine this bound with the signed averaging construction presented in arXiv:2608.01308 and a single-filter reduction to symmetric states. A Gaussian filter replaces the common receiver subsystem by a system of controlled dimension from which the original correlations can be approximately recovered using quantum side information. The filter preserves exact exchange symmetry, and a uniform smooth-entropy estimate bounds its output dimension for arbitrary correlated channel inputs. We also obtain an exponential strong converse at zero for antidegradable channels under the same joint criterion and, consequently, for the private capacity of the quantum erasure channel throughout its parameter range.
AI Summary
The paper asks whether private communication above capacity over a finite-dimensional degradable quantum channel necessarily fails, and whether failure is exponential. It uses a joint fidelity criterion comparing the message–estimate–environment state with uniformly distributed, perfectly correlated messages independent of the environment, optimizing over the ideal environment state. For every rate gap $\Delta>0$, it proves that all unassisted $(n,M)$ codes with $\log M\ge n(q_{\mathcal N}+\Delta)$ satisfy $f\le 2^{-\gamma n}$ for sufficiently large $n$, where $q_{\mathcal N}=\max_\rho[H(\mathcal N(\rho))-H(\mathcal N^c(\rho))]$ and $\gamma>0$ depends only on the channel and gap. The bound allows arbitrary mixed-state encoders and collective decoders. It also covers maximal joint infidelity and targets using the actual environment marginal. An exponential converse at zero is established for antidegradable channels, covering private communication over erasure channels throughout their parameter range. The proof coherently lifts codes to privacy tests and bounds two decoded tests’ overlap by $\min\{1,d_C/M\}$, independently of shield dimensions. A Gaussian filter preserves exact output-exchange symmetry while replacing a common receiver subsystem by a recoverable system of controlled dimension. Uniform smooth-entropy estimates handle correlated inputs and exponentially small recovery errors. These ingredients combine with a previously introduced signed Boolean averaging construction. The exponent is not claimed optimal. The filter is an existence construction, not deterministic compression, and its implementation probability is not bounded. The results do not establish bosonic-channel converses by truncation or converses for arbitrary feedback-assisted communication.
ChatGPT (OpenAI) Pro 6 (Astra) was used extensively in developing this paper, including for mathematical exploration, formulation and checking of proof arguments, drafting and revision, bibliographic verification, and preparation of LaTeX, TikZ, and numerical-checking code.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 49 pages, 8 figures