Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.37240

Approximate majorization and high-order capacity of quantum depolarizing channels

Zhiwei Song, Xin Wang, Marco Tomamichel, Kun Fang

quant-phSubmitted Sep 29, 2026• Announced Sep 30, 2026• 1 citation
arXivHTMLPDF

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.

Little sign of AI-generated text

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
15 pages, no figure

Related papers

Additivity/Multiplicativity Communication Channels

Grigori Gennadievich Amosov, Alexander Semenovich Holevo, Reinhard F. Werner

A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the “classical capacity”, and the “maximal output purity”. All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Kluwer Academic Publishers eBooks•Feb 24, 2006•0 citations

The capacity of the quantum depolarizing channel

Christopher King

The information-carrying capacity of the d-dimensional depolarizing channel is computed. It is shown that this capacity can be achieved by encoding messages as products of pure states belonging to an orthonormal basis of the state space, and using measurements which are products of projections onto this same orthonormal basis. In other words, neither entangled signal states nor entangled measurements give any advantage for information capacity. The result follows from an additivity theorem for the product channel /spl Delta//spl ominus//spl Psi/, where /spl Delta/ is the depolarizing channel and /spl Psi/ is a completely arbitrary channel. We establish the Amosov-Holevo-Werner(see Probl. Inform. Transm., vol.36, p.305-313, 2000) p-norm conjecture for this product channel for all p/spl ges/1, and deduce from this the additivity of the minimal entropy and of the Holevo quantity /spl chi//sup */.

arXiv:quant-ph/0204172•IEEE Transactions on Information Theory•Jan 1, 2003•295 citations

On some additivity problems in quantum information theory

Grigori Gennadievich Amosov, Alexander Semenovich Holevo, Reinhard F. Werner

A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the "classical capacity", and the "maximal output purity". All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture.

arXiv:math-ph/0003002•Mar 4, 2000•125 citations

Enhanced quantum capacity thresholds from symmetry

Avantika Agarwal, Amolak Ratan Kalra, Sungjai Lee +4 more

The quantum capacity captures the value of a quantum channel for transmitting quantum information, establishing the fundamental limits on quantum communication. In spite of its central role in quantum information theory, the quantum capacity of most channels is unknown, with wide gaps between the best upper and lower bounds. Even deciding whether a channel has nonzero capacity -- finding its capacity threshold -- is difficult. In this paper we report significant increases in the capacity thresholds of two prototypical noise models: the depolarizing channel and Pauli channels. In the case of the depolarizing channel, this is the first improvement in 18 years, giving a bigger increase beyond the hashing bound than all previous improvements combined. Our starting point is the representation theoretic framework recently proposed by Bhalerao and Leditzky (2025) to compute coherent information for special permutation invariant states. We generalize their framework to the full symmetric subspace, which allow us to optimize coherent information over rank two states in that space. A representation theoretic calculation shows that exponentially many Kraus operators of the channel annihilate the symmetric space, corresponding to a massive decrease in environment entropy for states on the symmetric space compared to the maximally mixed state. This explains the enhanced coherent information as a manifestation of degeneracy for the resulting codes.

quant-pharXiv:2605.09138•May 12, 2026•5 citations

Semidefinite optimization for quantum information

Xin Wang

This thesis aims to improve our understanding of the structure of quantum entanglement and the limits of information processing with quantum systems. It presents new results relevant to three threads of quantum information: the theory of quantum entanglement, the communication capabilities of quantum channels, and the quantum zero-error information theory. \nIn the first part, we investigate the fundamental features of quantum entanglement and develop quantitative approaches to better exploit the power of entanglement. First, we introduce a computable and additive entanglement measure to quantify the amount of entanglement, which also plays an important role as the improved semidefinite programming (SDP) upper bound of distillable entanglement. Second, we show that the Rains bound is neither additive nor equal to the asymptotic relative entropy of entanglement. Third, we establish SDP lower bounds for the entanglement cost and demonstrate the irreversibility of asymptotic entanglement manipulation under positive-partial-transpose-preserving quantum operations, resolving a major open problem in quantum information theory. \nIn the second part, we develop a framework of semidefinite programs to evaluate the classical and quantum communication capabilities of quantum channels in both the non-asymptotic and asymptotic regimes. In particular, we establish the first general SDP strong converse bound on the classical capacity of an arbitrary quantum channel and give in particular the best known upper bound on the classical capacity of the amplitude damping channel. We further establish a finite resource analysis of classical communication over quantum erasure channels, including the first second-order expansion of classical capacity beyond entanglement-breaking channels. For quantum communication, we establish the best SDP-computable strong converse bound and refine it as the so-called max-Rains information. \nIn the third part, we investigate the quantum zero-error information theory. In contrast to the conventional Shannon theory, there is a very different-looking information theory when errors are required to be precisely zero, where the communication problem reduces to the analysis of the so-called confusability graph (noncommutative graph) of a classical channel (quantum channel). We develop an activated communication model and explore its novel properties. Notably, we separate the quantum Lovász number and the entanglement-assisted zero-error capacity, resolving an intriguing open problem in the area of zero-error information.

•Jan 1, 2018•7 citations

Majorization Theory Approach to the Gaussian Channel Minimum Entropy Conjecture

Raúl García−Patrón, Carlos Navarrete–Benlloch, Seth Lloyd +2 more

A long-standing open problem in quantum information theory is to find the classical capacity of an optical communication link, modeled as a Gaussian bosonic channel. It has been conjectured that this capacity is achieved by a random coding of coherent states using an isotropic Gaussian distribution in phase space. We show that proving a Gaussian minimum entropy conjecture for a quantum-limited amplifier is actually sufficient to confirm this capacity conjecture, and we provide a strong argument towards this proof by exploiting a connection between quantum entanglement and majorization theory.

arXiv:1111.1986•Physical Review Letters•Mar 16, 2012•70 citations
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)O(\log \log n)O(loglogn) bits, sharpening our understanding of the role of entanglement in the finite-blocklength regime.
The paper asks whether entangled codewords and collective decoding improve finite-blocklength classical communication over a ddd-dimensional depolarizing channel, beyond the known first-order optimality of orthogonal-basis product coding. It treats fixed d≥2d\ge2d≥2, noise 0<p≤d2/(d2−1)0<p\le d^2/(d^2-1)0<p≤d2/(d2−1) with p≠1p\ne1p=1, and fixed average-error tolerance ε∈(0,1)\varepsilon\in(0,1)ε∈(0,1).
It proves that every nnn-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 Od,p(log⁡log⁡n/n)O_{d,p}(\log\log n/\sqrt n)Od,p​(loglogn/n​) over all inputs. Consequently, the unrestricted optimal message size satisfies log⁡M∗(n,ε)=ncd,p+nvd,p Φ−1(ε)+12log⁡n+Od,p,ε(log⁡log⁡n)\log M^*(n,\varepsilon)=nc_{d,p}+\sqrt{nv_{d,p}}\,\Phi^{-1}(\varepsilon)+\tfrac12\log n+O_{d,p,\varepsilon}(\log\log n)logM∗(n,ε)=ncd,p​+nvd,p​​Φ−1(ε)+21​logn+Od,p,ε​(loglogn). Here cd,pc_{d,p}cd,p​ and vd,pv_{d,p}vd,p​ are the capacity and dispersion of the classical ddd-ary symmetric channel induced by orthogonal-basis coding. That strategy achieves the displayed terms with an O(1)O(1)O(1) remainder, limiting any unrestricted improvement to O(log⁡log⁡n)O(\log\log n)O(loglogn) 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)O(1)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.
A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the “classical capacity”, and the “maximal output purity”. All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
The information-carrying capacity of the d-dimensional depolarizing channel is computed. It is shown that this capacity can be achieved by encoding messages as products of pure states belonging to an orthonormal basis of the state space, and using measurements which are products of projections onto this same orthonormal basis. In other words, neither entangled signal states nor entangled measurements give any advantage for information capacity. The result follows from an additivity theorem for the product channel /spl Delta//spl ominus//spl Psi/, where /spl Delta/ is the depolarizing channel and /spl Psi/ is a completely arbitrary channel. We establish the Amosov-Holevo-Werner(see Probl. Inform. Transm., vol.36, p.305-313, 2000) p-norm conjecture for this product channel for all p/spl ges/1, and deduce from this the additivity of the minimal entropy and of the Holevo quantity /spl chi//sup */.
A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the "classical capacity", and the "maximal output purity". All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture.
The quantum capacity captures the value of a quantum channel for transmitting quantum information, establishing the fundamental limits on quantum communication. In spite of its central role in quantum information theory, the quantum capacity of most channels is unknown, with wide gaps between the best upper and lower bounds. Even deciding whether a channel has nonzero capacity -- finding its capacity threshold -- is difficult. In this paper we report significant increases in the capacity thresholds of two prototypical noise models: the depolarizing channel and Pauli channels. In the case of the depolarizing channel, this is the first improvement in 18 years, giving a bigger increase beyond the hashing bound than all previous improvements combined. Our starting point is the representation theoretic framework recently proposed by Bhalerao and Leditzky (2025) to compute coherent information for special permutation invariant states. We generalize their framework to the full symmetric subspace, which allow us to optimize coherent information over rank two states in that space. A representation theoretic calculation shows that exponentially many Kraus operators of the channel annihilate the symmetric space, corresponding to a massive decrease in environment entropy for states on the symmetric space compared to the maximally mixed state. This explains the enhanced coherent information as a manifestation of degeneracy for the resulting codes.
This thesis aims to improve our understanding of the structure of quantum entanglement and the limits of information processing with quantum systems. It presents new results relevant to three threads of quantum information: the theory of quantum entanglement, the communication capabilities of quantum channels, and the quantum zero-error information theory. \nIn the first part, we investigate the fundamental features of quantum entanglement and develop quantitative approaches to better exploit the power of entanglement. First, we introduce a computable and additive entanglement measure to quantify the amount of entanglement, which also plays an important role as the improved semidefinite programming (SDP) upper bound of distillable entanglement. Second, we show that the Rains bound is neither additive nor equal to the asymptotic relative entropy of entanglement. Third, we establish SDP lower bounds for the entanglement cost and demonstrate the irreversibility of asymptotic entanglement manipulation under positive-partial-transpose-preserving quantum operations, resolving a major open problem in quantum information theory. \nIn the second part, we develop a framework of semidefinite programs to evaluate the classical and quantum communication capabilities of quantum channels in both the non-asymptotic and asymptotic regimes. In particular, we establish the first general SDP strong converse bound on the classical capacity of an arbitrary quantum channel and give in particular the best known upper bound on the classical capacity of the amplitude damping channel. We further establish a finite resource analysis of classical communication over quantum erasure channels, including the first second-order expansion of classical capacity beyond entanglement-breaking channels. For quantum communication, we establish the best SDP-computable strong converse bound and refine it as the so-called max-Rains information. \nIn the third part, we investigate the quantum zero-error information theory. In contrast to the conventional Shannon theory, there is a very different-looking information theory when errors are required to be precisely zero, where the communication problem reduces to the analysis of the so-called confusability graph (noncommutative graph) of a classical channel (quantum channel). We develop an activated communication model and explore its novel properties. Notably, we separate the quantum Lovász number and the entanglement-assisted zero-error capacity, resolving an intriguing open problem in the area of zero-error information.
A long-standing open problem in quantum information theory is to find the classical capacity of an optical communication link, modeled as a Gaussian bosonic channel. It has been conjectured that this capacity is achieved by a random coding of coherent states using an isotropic Gaussian distribution in phase space. We show that proving a Gaussian minimum entropy conjecture for a quantum-limited amplifier is actually sufficient to confirm this capacity conjecture, and we provide a strong argument towards this proof by exploiting a connection between quantum entanglement and majorization theory.