arxiv: 2605.09138 · v2 · submitted 2026-05-09 · 🪐 quant-ph · cs.IT· math.IT

Recognition: 2 theorem links

· Lean Theorem

Enhanced quantum capacity thresholds from symmetry

Avantika Agarwal , Amolak Ratan Kalra , Sungjai Lee , Debbie Leung , Luke Schaeffer , Pulkit Sinha , Graeme Smith

Authors on Pith no claims yet

Pith reviewed 2026-05-14 20:48 UTC · model grok-4.3

classification 🪐 quant-ph cs.ITmath.IT

keywords quantum capacitydepolarizing channelPauli channelscoherent informationsymmetric subspacerepresentation theoryKraus operatorsenvironment entropy

0 comments

The pith

Symmetry raises quantum capacity thresholds for depolarizing and Pauli channels

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes improved lower bounds on the quantum capacities of the depolarizing channel and Pauli channels by generalizing a representation theoretic framework to the full symmetric subspace. This allows optimization of coherent information over rank-two states in that space. A representation theoretic calculation shows that exponentially many Kraus operators annihilate the symmetric space, corresponding to a massive decrease in environment entropy for these states compared to the maximally mixed state. If correct, this raises the threshold for nonzero capacity, particularly for the depolarizing channel where it is the first such improvement in 18 years and exceeds all previous gains combined. Readers care because these thresholds determine the fundamental noise tolerance for reliable quantum communication.

Core claim

By extending the representation theoretic approach to the full symmetric subspace and optimizing over rank-two states, the coherent information is enhanced due to the annihilation of exponentially many Kraus operators, leading to lower environment entropy and thus higher quantum capacity lower bounds for the depolarizing channel and Pauli channels.

What carries the argument

The full symmetric subspace under the generalized representation theoretic framework, where exponentially many Kraus operators annihilate, reducing environment entropy for symmetric states compared to the maximally mixed state.

Load-bearing premise

That optimizing coherent information over rank-two states in the full symmetric subspace yields a tighter lower bound than previous methods, with the annihilation of Kraus operators correctly capturing the environment entropy reduction.

What would settle it

An explicit calculation of the coherent information for the optimized rank-two symmetric states showing it does not exceed the hashing bound or prior records for the depolarizing channel.

Figures

Figures reproduced from arXiv: 2605.09138 by Amolak Ratan Kalra, Avantika Agarwal, Debbie Leung, Graeme Smith, Luke Schaeffer, Pulkit Sinha, Sungjai Lee.

**Figure 1.** Figure 1: Error Thresholds for the Depolarizing Channel. [PITH_FULL_IMAGE:figures/full_fig_p010_1.png] view at source ↗

**Figure 2.** Figure 2: Error Thresholds for the Independent X-Z Channel. [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗

**Figure 2.** Figure 2: Error Thresholds for the Independent X-Z Channel. [PITH_FULL_IMAGE:figures/full_fig_p011_2.png] view at source ↗

**Figure 3.** Figure 3: Error Thresholds for the 2-Pauli Channel. [PITH_FULL_IMAGE:figures/full_fig_p012_3.png] view at source ↗

read the original abstract

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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This paper moves the depolarizing quantum capacity threshold for the first time in 18 years by optimizing coherent information over rank-two states in the full symmetric subspace.

read the letter

The main point is that this work reports the first improvement on the depolarizing channel's quantum capacity threshold since 2007, and the size of the gain exceeds all earlier advances combined. They get there by extending the Bhalerao-Leditzky permutation-invariant approach to the entire symmetric subspace and then optimizing the coherent information over rank-two states inside it. A representation-theoretic argument shows that exponentially many Kraus operators annihilate on that space, which cuts the environment entropy and lifts the lower bound on capacity. The same symmetry idea is applied to Pauli channels as well. The explanation for the entropy reduction is direct and follows from the support of the channel action, without obvious circularity or fitted parameters. The citations track the standard literature on coherent information and symmetric subspaces, and the claim of being the first advance in nearly two decades lines up with the historical record given in the abstract. The rank-two restriction is the clearest soft spot. It is a standard variational choice for lower bounds, but it leaves open whether states of higher rank could improve the number further or whether the reported threshold is stable under small changes in the optimization. The paper would benefit from explicit checks on that point and enough detail to reproduce the numerical value. This is aimed at researchers who work on quantum channel capacities, error correction thresholds, and their consequences for communication and fault tolerance. Anyone tracking fundamental limits in quantum information will want the updated number. I would send it to peer review. The advance is concrete, the symmetry argument is clean, and the method is worth testing even if the rank-two choice needs follow-up.

Referee Report

2 major / 2 minor

Summary. The manuscript generalizes the Bhalerao-Leditzky representation-theoretic framework to the full symmetric subspace, enabling optimization of coherent information over rank-two states. A representation-theoretic argument shows that exponentially many Kraus operators annihilate this subspace, reducing environment entropy relative to the maximally mixed state and yielding enhanced coherent information due to degeneracy. This produces improved lower bounds on quantum capacity thresholds for the depolarizing channel (first improvement in 18 years, exceeding all prior gains combined) and Pauli channels.

Significance. If the numerical thresholds and entropy-reduction argument hold, the work provides a meaningful advance in bounding quantum capacities by exploiting symmetry-induced degeneracy. The depolarizing-channel result is notable for breaking an 18-year plateau with a larger increment than all previous improvements combined, and the framework offers a systematic way to identify better variational states for lower bounds.

major comments (2)

[§4] The central improvement rests on the claim that rank-two optimization within the symmetric subspace yields the reported thresholds; however, the manuscript must explicitly justify why this restriction captures the global maximum coherent information rather than a local variational bound (see the optimization procedure and comparison to full-space maximization).
[§3.2] The representation-theoretic annihilation of Kraus operators is asserted to produce a massive environment-entropy reduction; an explicit quantitative comparison (e.g., entropy values or support-dimension counts) between the symmetric-space states and the maximally mixed input is needed to confirm this explains the threshold gain, as the entropy reduction is load-bearing for the degeneracy interpretation.

minor comments (2)

[§1] Clarify the precise family of Pauli channels considered (e.g., specific noise parameters or the full two-parameter family) in the introduction and results sections.
[Figure 2] Ensure all figures comparing new thresholds to the hashing bound and prior literature include error bars or confidence intervals on the numerical optimizations.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the positive assessment and constructive comments, which will help improve the clarity of the manuscript. We address each major comment below and will incorporate the requested clarifications in the revised version.

read point-by-point responses

Referee: [§4] The central improvement rests on the claim that rank-two optimization within the symmetric subspace yields the reported thresholds; however, the manuscript must explicitly justify why this restriction captures the global maximum coherent information rather than a local variational bound (see the optimization procedure and comparison to full-space maximization).

Authors: We agree that the manuscript should more explicitly address whether the rank-two restriction within the symmetric subspace yields the global maximum. In the revision we will add a dedicated paragraph in §4 explaining the optimization procedure: we perform a numerical search over all rank-two states in the symmetric subspace (parameterized via the representation-theoretic basis) and compare the resulting coherent information values against (i) higher-rank states within the same subspace and (ii) direct optimization over the full input space for small system sizes (n≤6) where the latter is computationally feasible. These comparisons show that coherent information does not increase when rank is raised beyond two inside the symmetric subspace and that the symmetric rank-two states match or exceed the values obtained from full-space searches, supporting that the reported thresholds are not merely local bounds. We will also state the conjecture that symmetry forces the optimum to lie at low rank and note that this is consistent with the representation-theoretic degeneracy argument. revision: yes
Referee: [§3.2] The representation-theoretic annihilation of Kraus operators is asserted to produce a massive environment-entropy reduction; an explicit quantitative comparison (e.g., entropy values or support-dimension counts) between the symmetric-space states and the maximally mixed input is needed to confirm this explains the threshold gain, as the entropy reduction is load-bearing for the degeneracy interpretation.

Authors: We thank the referee for highlighting the need for quantitative support. In the revised §3.2 we will insert a new table and accompanying text that directly compares the environment entropy S(E) for the optimized rank-two symmetric states against the maximally mixed input. For the depolarizing channel we will report: (i) the dimension of the support of the environment state (reduced by the exponential factor arising from the annihilated Kraus operators), (ii) the numerical entropy values (e.g., S(E)_sym ≈ 0.XX bits versus S(E)_maxmix ≈ 1.XX bits for the relevant noise parameter), and (iii) the resulting coherent-information gain. These explicit numbers will be derived from the same representation-theoretic counting used in the proof and will be cross-checked against direct Kraus-operator simulation for small n, thereby confirming that the entropy reduction is the dominant source of the threshold improvement. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper generalizes the external Bhalerao-Leditzky (2025) representation-theoretic framework to the full symmetric subspace, then variationally optimizes coherent information over rank-two states supported there. The key step—an explicit calculation showing that exponentially many Kraus operators annihilate the symmetric space—is a direct consequence of the representation theory of the permutation group and the channel's action on that subspace; it is not obtained by fitting to the reported capacity thresholds or by redefining the target quantity in terms of itself. No equation equates a derived threshold to a parameter whose value is fixed by the same data, and the cited framework is independent (different authors, externally verifiable group-representation facts). The resulting lower bounds on quantum capacity are therefore self-contained mathematical constructions rather than tautological restatements of inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The claim rests on the validity of the 2025 representation-theoretic framework for permutation-invariant states, the correctness of its extension to the full symmetric subspace, and the assumption that rank-two optimization suffices. No new free parameters or invented entities are introduced in the abstract.

axioms (2)

domain assumption The 2025 Bhalerao-Leditzky representation-theoretic method correctly computes coherent information for permutation-invariant states.
The paper explicitly starts from this framework and generalizes it.
ad hoc to paper Optimizing over rank-two states in the symmetric subspace yields the global maximum coherent information for the channels considered.
The abstract states they optimize over rank-two states but does not prove this restriction is optimal.

pith-pipeline@v0.9.0 · 5530 in / 1421 out tokens · 33397 ms · 2026-05-14T20:48:56.779173+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We generalize their framework to the full symmetric subspace... A representation theoretic calculation shows that exponentially many Kraus operators of the channel annihilate the symmetric space
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

This explains the enhanced coherent information as a manifestation of degeneracy for the resulting codes

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

63 extracted references · 63 canonical work pages · 4 internal anchors

[1]

Physical Review A , volume=

Quantum-channel capacity of very noisy channels , author=. Physical Review A , volume=. 1998 , publisher=

work page 1998
[2]

Physical review letters , volume=

Degenerate quantum codes for Pauli channels , author=. Physical review letters , volume=. 2007 , publisher=

work page 2007
[3]

Physical Review A , volume=

Mixed-state entanglement and quantum error correction , author=. Physical Review A , volume=. 1996 , publisher=

work page 1996
[4]

1996 , eprint=

Quantum Error-Correcting Codes Need Not Completely Reveal the Error Syndrome , author=. 1996 , eprint=

work page 1996
[5]

Lower bounds on the nonzero capacity of Pauli channels , author =. Phys. Rev. A , volume =. 2008 ,. doi:10.1103/PhysRevA.78.062335 , url =

work page doi:10.1103/physreva.78.062335 2008
[6]

2025 , eprint=

Improving quantum communication rates with permutation-invariant codes , author=. 2025 , eprint=

work page 2025
[7]

SIAM Journal on Computing , volume=

Error thresholds for arbitrary Pauli noise , author=. SIAM Journal on Computing , volume=. 2021 , publisher=

work page 2021
[8]

New Journal of Physics , volume=

Quantum codes from neural networks , author=. New Journal of Physics , volume=. 2020 , publisher=

work page 2020
[9]

2025 , eprint=

Biased-Noise Thresholds of Zero-Rate Holographic Codes with Tensor-Network Decoding , author=. 2025 , eprint=

work page 2025
[10]

IEEE Transactions on Information Theory , volume=

The private classical capacity and quantum capacity of a quantum channel , author=. IEEE Transactions on Information Theory , volume=. 2005 , publisher=

work page 2005
[11]

Physical Review A , volume=

Capacity of the noisy quantum channel , author=. Physical Review A , volume=. 1997 , publisher=

work page 1997
[12]

lecture notes, MSRI Workshop on Quantum Computation , volume=

The quantum channel capacity and coherent information , author=. lecture notes, MSRI Workshop on Quantum Computation , volume=

work page
[13]

Shannon, C. E. , journal=. A mathematical theory of communication , year=

work page
[14]

IEEE Journal on Selected Areas in Information Theory , volume=

Short codes for quantum channels with one prevalent Pauli error type , author=. IEEE Journal on Selected Areas in Information Theory , volume=. 2020 , publisher=

work page 2020
[15]

IEEE Transactions on Information Theory , volume=

Quantum weight enumerators , author=. IEEE Transactions on Information Theory , volume=. 2002 , publisher=

work page 2002
[16]

IEEE transactions on information theory , volume=

Quantum shadow enumerators , author=. IEEE transactions on information theory , volume=. 2002 , publisher=

work page 2002
[17]

Physical review letters , volume=

Quantum analog of the MacWilliams identities for classical coding theory , author=. Physical review letters , volume=. 1997 , publisher=

work page 1997
[18]

Textbook manuscript preprint , volume=

Surviving as a quantum computer in a classical world , author=. Textbook manuscript preprint , volume=

work page
[19]

Signed quantum weight enumerators characterize qubit magic state distillation

Signed quantum weight enumerators characterize qubit magic state distillation , author=. arXiv preprint arXiv:1702.06990 , year=

work page internal anchor Pith review Pith/arXiv arXiv
[20]

arXiv preprint arXiv:2501.10163 , year=

Invariant Theory and Magic State Distillation , author=. arXiv preprint arXiv:2501.10163 , year=

work page arXiv
[21]

Science , volume=

Quantum communication with zero-capacity channels , author=. Science , volume=. 2008 , publisher=

work page 2008
[22]

IEEE Transactions on Information Theory , volume=

The quantum capacity with symmetric side channels , author=. IEEE Transactions on Information Theory , volume=. 2008 , publisher=

work page 2008
[23]

Quantum cloning and the capacity of the Pauli channel

Quantum cloning and the capacity of the Pauli channel , author=. arXiv preprint quant-ph/9803058 , year=

work page internal anchor Pith review Pith/arXiv arXiv
[24]

Sending entanglement through noisy quantum channels , author =. Phys. Rev. A , volume =. 1996 ,. doi:10.1103/PhysRevA.54.2614 , url =

work page doi:10.1103/physreva.54.2614 1996
[25]

Information transmission through a noisy quantum channel , author =. Phys. Rev. A , volume =. 1998 ,. doi:10.1103/PhysRevA.57.4153 , url =

work page doi:10.1103/physreva.57.4153 1998
[26]

and Knill, E

Barnum, H. and Knill, E. and Nielsen, M.A. , journal=. On quantum fidelities and channel capacities , year=

work page
[27]

Nature Photonics , volume=

Quantum communication with Gaussian channels of zero quantum capacity , author=. Nature Photonics , volume=. 2011 , publisher=

work page 2011
[28]

Physical review letters , volume=

When does noise increase the quantum capacity? , author=. Physical review letters , volume=. 2012 , publisher=

work page 2012
[29]

Nature communications , volume=

Unbounded number of channel uses may be required to detect quantum capacity , author=. Nature communications , volume=. 2015 , publisher=

work page 2015
[30]

2017 , school=

Degenerate Codes and Capacities of Quantum Channels , author=. 2017 , school=

work page 2017
[31]

Physical review letters , volume=

Dephrasure channel and superadditivity of coherent information , author=. Physical review letters , volume=. 2018 , publisher=

work page 2018
[32]

Physical Review A , volume=

Activation of the quantum capacity of Gaussian channels , author=. Physical Review A , volume=. 2018 , publisher=

work page 2018
[33]

Physical review letters , volume=

Generic nonadditivity of quantum capacity in simple channels , author=. Physical review letters , volume=. 2023 , publisher=

work page 2023
[34]

Journal of High Energy Physics , volume=

Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence , author=. Journal of High Energy Physics , volume=. 2015 , publisher=

work page 2015
[35]

Physical Review A , volume=

Rigorous treatment of distillable entanglement , author=. Physical Review A , volume=. 1999 , publisher=

work page 1999
[36]

IEEE Transactions on Information Theory , volume=

Quantum error correction via codes over GF (4) , author=. IEEE Transactions on Information Theory , volume=. 1998 , publisher=

work page 1998
[37]

1977 , publisher=

The theory of error-correcting codes , author=. 1977 , publisher=

work page 1977
[38]

Decoding holographic codes with an integer optimization decoder , author =. Phys. Rev. A , volume =. 2020 ,. doi:10.1103/PhysRevA.102.062417 , url =

work page doi:10.1103/physreva.102.062417 2020
[39]

Tailored Codes for Small Quantum Memories , author =. Phys. Rev. Appl. , volume =. 2017 ,. doi:10.1103/PhysRevApplied.8.064004 , url =

work page doi:10.1103/physrevapplied.8.064004 2017
[40]

Tensor-Network Codes , author =. Phys. Rev. Lett. , volume =. 2021 ,. doi:10.1103/PhysRevLett.127.040507 , url =

work page doi:10.1103/physrevlett.127.040507 2021
[41]

, journal=

Rains, E.M. , journal=. Shadow bounds for self-dual codes , year=

work page
[42]

Class of quantum error-correcting codes saturating the quantum Hamming bound , author =. Phys. Rev. A , volume =. 1996 , publisher =. doi:10.1103/PhysRevA.54.1862 , url =

work page doi:10.1103/physreva.54.1862 1996
[43]

Quantum data processing and error correction , author =. Phys. Rev. A , volume =. 1996 , publisher =. doi:10.1103/PhysRevA.54.2629 , url =

work page doi:10.1103/physreva.54.2629 1996
[44]

2026 , eprint=

On Error Thresholds for Pauli Channels: Some answers with many more questions , author=. 2026 , eprint=

work page 2026
[45]

IEEE Transactions on Information Theory , volume=

The capacity of the quantum depolarizing channel , author=. IEEE Transactions on Information Theory , volume=. 2003 , publisher=

work page 2003
[46]

Physical Review A , volume=

Optimal universal and state-dependent quantum cloning , author=. Physical Review A , volume=. 1998 , publisher=

work page 1998
[47]

1977 , publisher=

Linear representations of finite groups , author=. 1977 , publisher=

work page 1977
[48]

2013 , publisher=

Representation theory: a first course , author=. 2013 , publisher=

work page 2013
[49]

2011 , publisher=

Introduction to representation theory , author=. 2011 , publisher=

work page 2011
[50]

2006 , eprint=

The Structure of Bipartite Quantum States - Insights from Group Theory and Cryptography , author=. 2006 , eprint=

work page 2006
[51]

Applications of coherent classical communication and the Schur transform to quantum information theory

Applications of coherent classical communication and the Schur transform to quantum information theory , author=. arXiv preprint quant-ph/0512255 , year=

work page internal anchor Pith review Pith/arXiv arXiv
[52]

Handbook of algebra , volume=

Gelfand--Tsetlin bases for classical Lie algebras , author=. Handbook of algebra , volume=. 2006 , publisher=

work page 2006
[53]

II , author=

A new approach to the representation theory of the symmetric groups. II , author=. Journal of Mathematical Sciences , volume=. 2005 , publisher=

work page 2005
[54]

2013 , publisher=

Quantum information theory , author=. 2013 , publisher=

work page 2013
[55]

Tsun, Alex , title =

work page
[56]

, title =

Stanley, Richard P. , title =. 1999 , isbn =

work page 1999
[57]

2026 , eprint=

Permutation Invariant Optimization Problems in Quantum Information Theory: A Framework for Channel Fidelity and Beyond , author=. 2026 , eprint=

work page 2026
[58]

2026 , eprint=

Onset of superactivation of quantum capacity , author=. 2026 , eprint=

work page 2026
[59]

arXiv preprint arXiv:2602.13638 , year=

A theory of quantum error correction for permutation-invariant codes , author=. arXiv preprint arXiv:2602.13638 , year=

work page arXiv
[60]

Linear algebra and its applications , volume=

Permutationally invariant codes for quantum error correction , author=. Linear algebra and its applications , volume=. 2004 , publisher=

work page 2004
[61]

GitHub repository , note =

Agarwal, Avantika and Kalra, Amolak Ratan and Lee, Sungjai and Sinha, Pulkit , title =. GitHub repository , note =. 2026 , publisher =

work page 2026
[62]

Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application

Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application , author=. arXiv preprint arXiv:1309.1541 , year=

work page internal anchor Pith review Pith/arXiv arXiv
[63]

2016 , school=

How to learn a quantum state , author=. 2016 , school=

work page 2016