Pith. sign in

REVIEW 6 minor 14 references

Sufficient conditions for additivity of the zero-error classical capacity of quantum channels

T0 review · 0 major / 6 minor · reviewed 2026-08-03 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The paper proves that any quantum channel whose noncommutative graph lives on a qubit — except the noiseless one — has additive one-shot and asymptotic zero-error classical capacity with every other quantum channel.

desk verdict A correct, modest addition to the zero-error additivity literature: the qubit result is clean, the block-graph conditions are plausible, and the proof gaps are presentational rather than load-bearing. read the letter →

arxiv 2601.18538 v2 pith:2RHFZNTU submitted 2026-01-26 quant-ph

Jeonghoon Park , Jeong San Kim This is my paper
classification quant-ph MSC 81P4781P4594A40 PACS 03.67.-a
keywords zero-errorcapacityquantumchannelnoncommutativegraphindependencenumberadditivitymultiplicativityblockqubit
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper seeks sufficient conditions for the zero-error classical capacity of quantum channels to be additive. It works through noncommutative graphs, where the one-shot capacity is the logarithm of the graph's independence number, so additivity is exactly multiplicativity of that number. The main result shows that any noncommutative graph on a qubit, other than the trivial noiseless one, multiplies with every other noncommutative graph, making both one-shot and asymptotic zero-error capacities additive. It also provides analogous conditions for block noncommutative graphs, which are direct sums of factor graphs with an off-diagonal coupling. If these claims hold, the zero-error capacity of a wide class of channels can be computed simply as the sum of individual capacities, and superactivation is ruled out for those pairs.

What carries the argument

The central object is the independence number α(S) of a noncommutative graph S — a self-adjoint operator subspace containing the identity — defined as the maximum number of states with pairwise orthogonal supports relative to S. Multiplicativity α(S⊗T)=α(S)α(T) is exactly additivity of the one-shot zero-error capacity. The proof machinery is a classification of noncommutative graphs in L(C^2) into four unitary equivalence classes (CI_2, span{I,Z}, span{I,Z,X}, and L(C^2)), together with a block-graph decomposition that splits A and B components. A key step is Theorem 3, which reduces the independence number of a block graph to independent sets in A and B with cross-orthogonality to the off-d

What would settle it

A concrete computational test: enumerate the four noncommutative-graph classes in L(C^2) and search over all noncommutative graphs T in L(C^3) to find a pair with α(S⊗T) ≠ α(S)α(T). If such a pair exists, Theorem 2 collapses. For the block claim, search for a block graph Σ satisfying α(Σ)=α(S_AA)+α(T_BB) but α(Σ⊗Ω)>α(Σ)α(Ω) for some Ω, or exhibit a specific independent set of Σ whose maximum size is attained only by a state with both A and B components nonzero, contradicting the replacement step of Theorem 3.

Watch

Extended reading notes

Core claim

The paper's central claim is a set of sufficient conditions for the multiplicativity of the independence number of noncommutative graphs. Theorem 2 states that if S ⊆ L(C^2) is any noncommutative graph other than CI_2, then for every noncommutative graph T, α(S⊗T)=α(S)α(T); equivalently, the one-shot zero-error classical capacity is additive, and by iteration the asymptotic capacity is also additive. Theorem 4 extends additivity to block noncommutative graphs Σ = S_AA + T_BB + U_BA + U†_AB, provided either α(Σ)=α(S_AA)+α(T_BB), or U_BA is the full operator space L(B,A) and the partner graph Ω has α(Ω)=1. The paper also supplies explicit channels satisfying these conditions, including a mixtu

Load-bearing premise

Theorem 3's proof assumes that every state in an independent set of a block graph that has both an A-component and a B-component can be replaced by a state lying entirely in A or entirely in B without shrinking the set or violating the cross-orthogonality conditions; this replacement step is asserted without a full argument, and Theorem 4's compactness argument inherits it.

Editorial extensions

If this is right

  • For any quantum channel whose noncommutative graph sits in L(C^2), combining it with any other channel never produces a zero-error rate beyond the sum of the individual rates; superactivation is impossible for such a pair.
  • The asymptotic zero-error capacity inherits additivity, so for tensor products of such channels the capacity can be computed directly from the component capacities.
  • For block noncommutative graphs, additivity follows either from a simple sum rule for the independence number of the block or from a full off-diagonal block paired with a partner graph of zero capacity.
  • The explicit examples (dephasing/bit-flip mixture, depolarizing channel, direct-sum constructions) give concrete instances where the proven conditions hold.
  • The paper's Corollary 1 extends additivity to arbitrary collections of channels whose graphs all lie in L(C^2), so every such collection has a stable, additive zero-error capacity.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The classification of L(C^2) graphs hints at a broader principle: non-multiplicativity of the independence number may require both factor graphs to be built on dimensions larger than a qubit and to have α ≥ 2; this could be tested by systematic brute-force searches over small noncommutative graphs.
  • The single-sentence 'replace case 3' step in Theorem 3 is the most delicate point of the block-graph argument; a concrete check would be to enumerate small A, B, and U_BA and see whether the reduction ever discards an independent set that requires a mixed A⊕B state.
  • Corollary 3's dimension condition dim(U_BA) < dim(A)+dim(B)−1 offers a simple certificate for additivity; one could probe whether this bound is tight by perturbing U_BA near the threshold and checking whether multiplicativity fails just beyond it.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 6 minor

Summary. The paper studies additivity of the zero-error classical capacity of quantum channels through noncommutative graphs. The one-shot zero-error capacity is log of the independence number of the channel's noncommutative graph, so additivity is equivalent to multiplicativity of the independence number. The paper proves sufficient conditions for this multiplicativity. Theorem 1 shows that if one graph is the diagonal classical graph span{|t><t|}, the independence number is multiplicative with any other graph; this also gives asymptotic additivity. Theorem 2 classifies qubit noncommutative graphs and shows that any noisy qubit graph (i.e., any graph other than CI_2) is multiplicative with every other graph; Corollary 1 extends this to tensor products of qubit channels. The paper then introduces block noncommutative graphs, characterizes their independence number (Theorem 3), and gives two sufficient conditions for multiplicativity of a block graph with an arbitrary graph (Theorem 4). Several explicit channel examples illustrate the conditions.

Significance. The main result, Theorem 2, is a clean and potentially useful statement: every non-identity qubit noncommutative graph is additive with every other noncommutative graph, both for the one-shot and the asymptotic zero-error classical capacity. This is a genuine sufficient condition and is proved by elementary classification and orthogonality arguments. Theorem 1 and the block-graph criteria are also new and are supported by explicit examples. The paper contains no fitted parameters and the claims are falsifiable through the stated examples. The proofs are mostly self-contained, relying only on the published qubit classification and standard facts about noncommutative graphs. The contribution is incremental rather than breakthrough, but it is a solid addition to the literature on zero-error capacities.

minor comments (6)
  1. [IV.A, Proof of Theorem 3] The displayed 'if and only if' condition for a single pair (i,j) omits the second off-diagonal condition. For fixed i≠j one needs both ⟨v_i|U_BA|w_j⟩=0 and ⟨w_i|U†_AB|v_j⟩=0; the latter is equivalent to condition (9) with the pair (j,i). Please correct the sentence to refer to the set of conditions (7)-(9) for all ordered pairs.
  2. [IV.A, Proof of Theorem 3] The replacement step for case-3 states is asserted in one sentence. The claim is true, but the argument should be supplied: for |ψ_i⟩=|v_i⟩+|w_i⟩ with both components nonzero, one may keep |v_i⟩ (or |w_i⟩). The conditions (7)-(9) are inherited from the original orthogonality with Σ, and no collision of vectors can occur because two distinct original states cannot share the same nonzero A-component or the same nonzero B-component (otherwise the identity in S_AA or T_BB would be violated).
  3. [IV.B, Theorem 4(ii)] The statement 'It is not hard to show that (L(B,A)⊗Ω)^⊥ has no rank-one operator' is load-bearing but unproved. It should be proved explicitly, e.g., by a Schmidt decomposition of a putative rank-one operator |φ⟩⟨χ| with respect to A and B; the resulting operators are rank-one and must lie in Ω^⊥, contradicting α(Ω)=1 through Proposition 1(i). The claim is correct, so the theorem stands, but the proof needs to be written out.
  4. [III, Proof of Theorem 2] In the final case S=L(C^2), the text says 'C0^(1) and C0 are additive by Theorem 2.' This should refer to Proposition 2, which was proved in Ref. [13] and stated earlier.
  5. [Example 4] The notation 'F_s ∈ L(C2,C8)' is inconsistent with the definitions F_0=(I2⊗|0⟩), F_1=(Z⊗|0⟩), F_2=(I2⊗|1⟩), F_3=(X⊗|1⟩), which are operators in L(C2,C4). The full Kraus operator is |0⟩⊗F_s ∈ L(C2,C8). Please clarify the dimensions.
  6. [Corollary 3, proof] The conclusion α(Σ)=2 when U⊥_BA contains a rank-one operator is terse. Please spell out that a single A-vector and a single B-vector can be chosen to satisfy (7)-(9), and that α(S_AA)=α(T_BB)=1 prevents more than one vector from each block.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; the derivation chain is self-contained or rests on independent prior published results.

full rationale

The paper's central theorems are obtained by direct mathematical construction rather than by fitting a parameter and renaming it a prediction. Theorem 1 is proved from the definition of α(S), and Theorem 2's proof combines that with the standard classification of qubit noncommutative graphs from the independent reference [8]. The only self-citation is Proposition 2, attributed to [13] (Park & Heo, where one author is J. Park); it is a parameter-free published theorem whose assumptions do not include the target additivity claims, and the case in which it is used (S = L(C^2)) is also an elementary direct argument. The replacement step in Theorem 3 is under-explained but is not circular: it preserves the orthogonality conditions (7)-(9) componentwise, so it does not reduce the conclusion to an input. Theorem 4's sufficient conditions are explicit assumptions on S_AA, T_BB, and Ω, and the proof combines them with Theorem 3; no quantity is defined in terms of the quantity it is used to derive. Overall, no step in the claimed derivation is equivalent by construction to its own input.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

No free parameters or invented physical entities. The paper leans on four published structural results (qubit graph classification [8], additivity with full matrix graph [13], rank-one criterion [4], dimension bound [14]); these are external assumptions, not fitted to the present results.

assumptions (5)
  • domain assumption Every noncommutative graph S ⊆ L(C^2) is unitarily equivalent to CI_2, span{I_2,Z}, span{I_2,Z,X}, or L(C^2).
    Used to reduce Theorem 2 to four cases; cited to Ref [8] but not proved in the paper.
  • domain assumption Proposition 2: C0^{(1)}(S⊗L(C^n)) = C0^{(1)}(S) + C0^{(1)}(L(C^n)) and the same for asymptotic capacity.
    Used in Theorem 2 for the L(C^2) case and in Corollary 1; cited to Ref [13].
  • domain assumption α(S)=1 iff S⊥ has no rank-one operator (Prop 1(i)).
    Central for using Corollary 2 and Theorem 4(ii); proved in Ref [4].
  • domain assumption A subspace X of L(A,B) with no rank-one operator has dimension at most (dim A − 1)(dim B − 1).
    Used in Corollary 3 to infer existence of rank-one operators in U⊥; cited to Ref [14].
  • domain assumption Every noncommutative graph arises as S(N) of some quantum channel and S(N) uniquely determines α(N).
    Bridges channel capacity additivity to graph multiplicativity (Remark 1, Ref [4]).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Sufficient conditions for additivity of the zero-error classical capacity of quantum channels." pith.science (2026). https://pith.science/paper/2RHFZNTU

@misc{pith2026260118538,
  author       = {Pith},
  title        = {Pith review of: Sufficient conditions for additivity of the zero-error classical capacity of quantum channels},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2RHFZNTU}},
  note         = {Machine review of arXiv:2601.18538}
}
read the original abstract

The one-shot zero-error classical capacity of a quantum channel is the maximum amount of classical information that can be transmitted with zero probability of error via a single channel use. This capacity is fundamentally characterized by the logarithm of the independence number of the noncommutative graph induced by the quantum channel. Consequently, the additivity of the one-shot zero-error classical capacity is equivalent to the multiplicativity of the independence number of the associated noncommutative graphs. As the independence number is not multiplicative in general, the specific conditions under which multiplicativity is preserved remain an open question in quantum information theory. Here, we establish some sufficient conditions for the multiplicativity of the independence number and provide explicit examples of quantum channels that satisfy these criteria. Furthermore, we investigate the block form of noncommutative graphs and derive the conditions under which the independence number remains multiplicative within this framework. These results offer new insights into the structural properties of noncommutative graphs and the fundamental limits of zero-error quantum communication.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

14 extracted references · 3 linked inside Pith

  1. [1]

    C. E. Shannon, The zero error capacity of a noisy channel,IRE Trans. Inf. Theory, 2, 8–19, 1956

    1956

  2. [2]

    K¨ orner and A

    J. K¨ orner and A. Orlitsky. Zero-error information theory.IEEE Trans. Inf. Theory, 44, 2207, 1998

    1998

  3. [3]

    Rex A. C. Medeiros and Francisco M. De Assis, Quantum Zero-error Capacity,International Journal of Quantum Information, 3, 135–139, 2005

    2005

  4. [4]

    Duan, Super-Activation of Zero-Error Capacity of Noisy Quantum Channels, arXiv:0906.2527

    R. Duan, Super-Activation of Zero-Error Capacity of Noisy Quantum Channels, arXiv:0906.2527

    arXiv

  5. [5]

    M. E. Shirokov, On channels with positive quantum zero-error capacity having vanishing n-shot capacity,Quantum Inf Process, 14, 3057–3074, 2015

    2015

  6. [6]

    Leung and N

    D. Leung and N. Yu, Maximum privacy without coherence, zero-error,J. Math. Phys., 57, 092202, 2016

    2016

  7. [7]

    T. S. Cubitt and D. Leung and W. Matthews and A. Winter, Zero-Error Channel Capacity and Simulation Assisted by Non-Local Correlations,IEEE Trans. Inf. Theory, 57, 5509, 2011

    2011

  8. [8]

    R. Duan, S. Severini, and A. Winter. Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lov´ asz Number.IEEE Trans. Inf. Theory, 59, 1164, 2013

    2013

Show all 14 references
  1. [9]

    Duan and A

    R. Duan and A. Winter, No-Signalling-Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lov´ asz Number,IEEE Trans. Inf. Theory, 62, 891–914, 2016

    2016

  2. [10]

    Beigi and P

    S. Beigi and P. W. Shor, On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels, arXiv:0709.2090. 9

    arXiv

  3. [11]

    T. S. Cubitt and J. Chen and A. W. Harrow, Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel,IEEE Trans. Inf. Theory, 57, 8114, 2011

    2011

  4. [12]

    R. Duan, S. Severini, and A. Winter. Zero-error communication via quantum channels, non-commutative graphs and a quantum Lov´ asz theta function. arXiv:1002.2514, 2010

    2010 arXiv

  5. [13]

    Park and J

    J. Park and J. Heo, Activation of zero-error classical capacity in low-dimensional quantum systems,Phys. Rev. A, 97, 062314, 2018

    2018

  6. [14]

    T. S. Cubitt and A. Montanaro and A. Winter, On the dimension of subspaces with bounded Schmidt rank,J. Math. Phys., 49, 022107, 2008

    2008

Pith tools

Reviewed August 3, 2026 · model on record in the stance chip above.