arXiv:2609.38144
The exact strong converse exponent for private communication over quantum channels
Hao-Chung Cheng, Christoph Hirche, Marco Tomamichel
Abstract
We determine the exact strong converse exponent for secret-key transmission and generation over general finite-dimensional quantum wiretap channels, measuring reliability and secrecy jointly by squared fidelity to an ideal secret key. We introduce a novel Renyi private information whose regularization characterizes this exponent. An exact integral representation in terms of ordinary private information gives a uniform continuity bound, showing that the regularized quantity converges to private capacity as the Renyi order approaches one. This establishes for any wiretap channel an exponential fidelity decay at every rate above private capacity.
AI Summary
The paper asks how rapidly private communication fails above the private capacity of a finite-dimensional memoryless quantum wiretap channel $\mathcal W:A\to BE$. It studies unassisted secret-key transmission, measuring reliability and secrecy jointly by squared fidelity to a uniform shared key independent of Eve, optimized over Eve’s reference state. It establishes an exponential strong converse at private capacity and characterizes the exact fidelity-decay exponent. For the optimal fidelity $F^\star(n,R)$, the limit $E_{\mathrm{sc}}(\mathcal W,R)=\lim_{n\to\infty}-n^{-1}\log F^\star(n,R)$ exists and equals $\sup_{\alpha>1}\frac{\alpha-1}{\alpha}[R-P_\alpha(\mathcal W)]$, where $P_\alpha$ is a newly defined, regularized Rényi private information. In particular, the exponent is positive at every rate above private capacity. The same exponent applies to unassisted secret-key generation: generation codes can be converted to transmission codes with at most a factor-four fidelity loss. The converse combines a one-shot fidelity bound with an integral representation of Rényi private information along tilted states. Local restoration of these states to the channel image yields continuity at order one uniformly in blocklength. Matching achievability uses modified-channel private coding, relative-entropy fidelity bounds, universal reference states, local pinching, and blocking. The characterization remains regularized; identifying channel classes with additive Rényi private information is left open. The exponent depends on the specified joint channel and fidelity criterion. Examples distinguish it from exponents under trace-distance or separate reliability–secrecy criteria, whose exact characterization remains open.
The authors used OpenAI's ChatGPT and Codex to assist with proof exploration, language editing, organization, literature searches, and checks of mathematical derivations.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 37 pages