arXiv:2609.37240
Approximate majorization and high-order capacity of quantum depolarizing channels
Zhiwei Song, Xin Wang, Marco Tomamichel, Kun Fang
Abstract
A central challenge in quantum information theory is to determine whether entanglement provides an advantage for information processing when coherent operations across multiple channel uses are allowed. For depolarizing channels, King's proof of the additivity of the minimum output entropy rules out such an advantage for classical communication at leading asymptotic order, while leaving open the possibility of an advantage for higher orders. In this work, we conjecture a majorization relation for the outputs of depolarizing channels and prove an approximate version of this conjecture. Our proof combines an exact ordering of shifted log-determinants with an anti-concentration bound for the spectrum of the product-state output, refining King's analysis based on Schatten norms. As a direct application, we obtain a tight third-order expansion for the classical capacity of quantum depolarizing channels. Consequently, entangled codewords and collective decoding can improve the message size over the product-coding strategy by at most $O(\log \log n)$ bits, sharpening our understanding of the role of entanglement in the finite-blocklength regime.
AI Summary
The paper asks whether entangled codewords and collective decoding improve finite-blocklength classical communication over a $d$-dimensional depolarizing channel, beyond the known first-order optimality of orthogonal-basis product coding. It treats fixed $d\ge2$, noise $0<p\le d^2/(d^2-1)$ with $p\ne1$, and fixed average-error tolerance $\varepsilon\in(0,1)$. It proves that every $n$-use output is approximately majorized by the output from a pure product input. The defect, defined as the largest excess of a leading eigenvalue sum over the corresponding reference sum, is uniformly $O_{d,p}(\log\log n/\sqrt n)$ over all inputs. Consequently, the unrestricted optimal message size satisfies $\log M^*(n,\varepsilon)=nc_{d,p}+\sqrt{nv_{d,p}}\,\Phi^{-1}(\varepsilon)+\tfrac12\log n+O_{d,p,\varepsilon}(\log\log n)$. Here $c_{d,p}$ and $v_{d,p}$ are the capacity and dispersion of the classical $d$-ary symmetric channel induced by orthogonal-basis coding. That strategy achieves the displayed terms with an $O(1)$ remainder, limiting any unrestricted improvement to $O(\log\log n)$ bits. The proof establishes exact shifted log-determinant ordering using a block determinant inequality and King's phase-damping decomposition. A general spectral anti-concentration argument converts this ordering into approximate majorization; Berry–Esseen bounds control the product reference spectrum. A hypothesis-testing converse then yields the capacity expansion. Counterexamples show that Schatten-norm ordering alone cannot establish vanishing majorization defect. Exact output majorization remains conjectural. An $O(1)$ capacity remainder and extensions to other channels or relative majorization remain open; the asymptotic bounds are not claimed uniform near degenerate channel or error parameters.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 15 pages, no figure