arXiv:2610.02176
From Permutation Symmetry to Communication Bounds and Additivity
Zahra Baghali Khanian, Debbie Leung, Graeme Smith
Abstract
Correlations across channel uses can improve quantum communication rates, making optimization over arbitrarily large blocks a central difficulty in determining quantum capacity. We show how full permutation invariance limits this advantage for every finite-dimensional memoryless channel. The optimized coherent information per use converges to the single-use maximum and consequently attains its supremum at a finite block length. Thus finite-block superadditivity remains possible, while the asymptotic optimization reduces to a single channel use. We also establish a strong converse for pure-source entanglement generation with permutation-invariant inputs: at any fixed rate above the single-use coherent-information maximum, the fidelity tends to zero. Beyond these communication bounds, we identify a common structure underlying completely bounded norms and the sandwiched Rényi channel quantities governing discrimination against a replacer and entanglement-assisted communication. De Finetti reduction and permutation covariance yield systematic alternative proofs of their known multiplicativity and additivity results within a shared variational framework. We further show that, for permutation-invariant inputs, correlations cannot sustain an asymptotic reduction in output entropy per use below the single-use minimum. This entropy limit holds for Rényi orders greater than one and for the von Neumann entropy, extending the role of symmetry from communication bounds to the control of output entropy.
AI Summary
The paper asks whether correlations across uses of a finite-dimensional memoryless channel can sustain a coherent-information advantage when the entire input state is invariant under every permutation. Writing $q_n^{\mathrm{sym}}(\mathcal N)$ for the maximum coherent information per use over this class, it proves $Q^{(1)}(\mathcal N)\le q_n^{\mathrm{sym}}(\mathcal N)\le Q^{(1)}(\mathcal N)+O(\log n/\sqrt n)$. Thus the sequence converges to the single-use maximum, and its supremum is attained at a finite block length, although finite-block superadditivity remains possible. The same reduction yields a strong-converse upper threshold at $Q^{(1)}(\mathcal N)$ for pure-source entanglement-generation codes with permutation-invariant channel inputs: fidelity tends to zero at any fixed rate above this threshold. For minimum output entropy restricted to permutation-invariant inputs, it establishes $nh_\alpha-\frac{\alpha}{\alpha-1}\log g_{n,d}\le h_{\alpha,n}^{\mathrm{sym}}\le nh_\alpha$, where $g_{n,d}=\binom{n+d^2-1}{d^2-1}$ and $\alpha>1$. The entropy per use converges to the single-use minimum, also for von Neumann entropy. The proofs combine symmetric purification, polynomial de Finetti/postselection domination, flagged mixtures, and sandwiched Rényi estimates near order one. A shared weighted Schatten-norm formulation also gives alternative proofs of known completely bounded norm multiplicativity and Rényi channel additivity results, removing polynomial factors by amplification. Full input permutation invariance is essential; concatenating symmetric blocks need not preserve it. The coding converse does not cover arbitrary mixed encoders, and equality of the restricted capacity with $Q^{(1)}$ would require an achievability argument.
We have used AI to assist with the writing and preparation of the manuscript.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.