Source-linked AI summary

Non-Multiplicativity of the Holevo Barycenter of Quantum Channels

Sayantan Chakraborty, Stefano Mancini, Leonardo Rossetti, Andreas Winter

arXiv:2609.09373v1quant-phcs.ITmath.IT

TL;DR

The paper asks whether Holevo barycenters always tensorize, a question related to—but not equivalent to—additivity of Holevo capacity. It constructs a channel whose barycenter fails to tensorize with itself and shows that no universal entropic ordering holds for the tensor square.

  • Problem

    Whether Holevo barycenters tensorize under parallel composition remains open even though capacity additivity implies tensorization and prior non-additive-capacity examples still had tensorizing barycenters.

    Source: §I · p. 1
  • Method

    The construction uses direct sums of channels, combining a strictly superadditive-capacity pair with an entanglement-breaking channel to create incompatible block weights.

    Source: §I · p. 1
  • Results

    The tensor-square Holevo barycenter can differ from the tensor product of individual barycenters, and its entropy can be either smaller or larger than twice the individual barycenter entropy.

    Source: §IV · p. 3, §V · pp. 3–4
  • Takeaways & Limitations

    There is no simple universal relation between the tensor product of two Holevo barycenters and the barycenter of the product channel.

    Source: §VI · p. 4

Abstract

from arXiv · show

The Holevo barycenter of a quantum channel is the unique output state obtained as the average output of any ensemble achieving the Holevo capacity. Given two quantum channels, the multiplicativity problem asks whether this barycenter tensorizes under parallel composition, namely whether the barycenter of the product channel coincides with the tensor product of the individual barycenters. This question is closely related to the additivity problem for the Holevo capacity: additivity implies tensorization of the Holevo barycenter, while tensorization alone is not sufficient for additivity. Although a construction is known that demonstrates the existence of channels with non-additive Holevo capacity, their corresponding Holevo barycenters still tensorize, leaving open whether multiplicativity might ultimately hold universally. Here, we answer this question in the negative by exhibiting channels for which the Holevo barycenter is not multiplicative under the tensor product of the channel with itself. Moreover, we show that the entropy of the Holevo barycenter is neither universally subadditive nor universally superadditive under tensor product.

I. INTRODUCTION

The Holevo barycenter’s multiplicativity is linked asymmetrically to Holevo-capacity additivity: additivity forces tensorization, but tensorization alone does not imply additivity. Earlier non-additive-capacity examples still had tensorizing barycenters, while this work constructs a counterexample and rules out a universal entropy ordering.

I. INTRODUCTION

  • The Holevo capacity is the single-letter rate for product-state encodings, and its additivity would make regularization unnecessary for classical communication capacity.The additivity question was settled negatively following Hastings’ counterexample and Shor’s equivalence between the relevant additivity conjectures.Source: §I · p. 1
  • Holevo-capacity additivity forces barycenter tensorization, but tensorization alone is not sufficient for capacity additivity.Thus, capacity non-additivity is necessary but may not be sufficient for barycenter non-multiplicativity.Source: §I · p. 1
  • The Shor–Hastings construction yields non-additive Holevo capacity while its individual and product-channel barycenters still tensorize.Twirling gives capacity-achieving ensembles with maximally mixed average outputs for both the enlarged channels and their product.Source: §I · p. 1
  • The paper constructs channels whose Holevo barycenter fails to tensorize with itself, using direct sums to produce incompatible block weights.It also shows that the tensor-square barycenter entropy can be either smaller or larger than twice the individual barycenter entropy.Source: §I · p. 1

II. THE HOLEVO BARYCENTER AND THE MULTIPLICATIVITY PROBLEM

The Holevo barycenter is the unique average output state shared by all capacity-achieving ensembles. Additivity of Holevo capacity guarantees that barycenters tensorize, but the converse fails; the Shor–Hastings construction illustrates this gap, and the paper’s construction establishes non-multiplicativity.

II. THE HOLEVO BARYCENTER AND THE MULTIPLICATIVITY PROBLEM

  • All capacity-achieving ensembles have the same average output state, called the Holevo barycenter.Uniqueness follows by mixing optimal ensembles and applying Donald’s identity to the mixture’s components.Source: §II · p. 2
  • Holevo-capacity additivity makes the tensor product of optimal ensembles optimal, so uniqueness gives tensorization of the barycenter.The converse fails: multiplicativity must be supplemented by a geometric condition on the product channel’s optimal set to characterize additivity.Source: §II · p. 2
  • Shor’s reduction converts minimum-output-entropy non-additivity into Holevo-capacity non-additivity, yet the resulting barycenters still tensorize.The optimal ensembles have maximally mixed average outputs, and uniqueness fixes the individual and product-channel barycenters accordingly.Source: §II · p. 2
  • The paper’s main result establishes that some channel’s barycenter is not multiplicative under tensoring the channel with itself.This distinguishes the paper’s construction from the Shor–Hastings example, where capacity non-additivity coexists with barycenter tensorization.Source: §II · p. 2

III. DIRECT SUMS OF QUANTUM CHANNELS

For a direct-sum channel, optimal ensembles can be assembled from optimal ensembles of its component channels. The component weights depend on their capacities, while the product channel’s weights depend on capacities of pairwise product channels.

III. DIRECT SUMS OF QUANTUM CHANNELS

  • An optimal ensemble for a direct-sum channel is a block-diagonal convex combination of optimal ensembles for its component channels.The weight assigned to each block is determined by the capacities of the component channels.Source: §III · p. 3
  • The tensor square of a direct-sum channel is itself a direct-sum channel indexed by pairwise products of component channels.Applying the direct-sum formula to the product and expanding the tensor product of individual barycenters provides the comparison used in the construction.Source: §III · p. 3
  • The direct-sum formulas are used with suitable component channels to establish the paper’s main results.The section introduces the channel spaces and projections onto the component input blocks.Source: §III · pp. 2–3

IV. NON-MULTIPLICATIVITY OF THE HOLEVO BARYCENTER

The section constructs a quantum channel whose Holevo barycenter does not tensorize with itself. The proof uses a direct-sum construction and shows that the two states have different block weights.

  • The construction starts from channels N1 and N2 with strictly superadditive Holevo capacity and uses an arbitrary entanglement-breaking channel in a direct sum.Source: §IV · p. 3
  • The proof compares ratios of block weights, whose normalization factors cancel, and uses their inequality to show the two weight families cannot coincide.Source: §IV · p. 3
  • The constructed channel satisfies Ω(N ⊗ N) ≠ Ω(N) ⊗ Ω(N), so its Holevo barycenter is not multiplicative under self-tensoring.Source: §IV · p. 3

V. NO UNIVERSAL ENTROPIC ORDERING

The construction yields both possible strict entropy orderings between a product-channel barycenter and the tensor product of individual barycenters. It also shows that neither majorization direction between these states holds universally.

V. NO UNIVERSAL ENTROPIC ORDERING

  • The construction uses a Shor-reduced channel N1 with a strict product-capacity excess and a depolarizing channel N0, combined as N=N0⊕N1.The strict excess δ is available from the Shor–Hastings construction; the depolarizing channel’s capacity can be varied to obtain either entropy ordering.Source: §V · pp. 3–4
  • Each of the four block states is maximally mixed on a d²-dimensional output space, so comparing the barycenter entropies reduces to comparing the Shannon entropies H(λ) and H(µ).The block weights depend on the component capacities for N and the pairwise product-channel capacities for N⊗N.Source: §V · p. 4
  • Choosing χ(N0)=χ(N1) gives H(Ω(N− ⊗N−)) < H(Ω(N−)⊗Ω(N−)), while choosing χ(N0)=χ(N1)+δ gives the reverse ordering.The first choice makes λ uniform and µ nonuniform; the second yields λ ≻ µ strictly.Source: §V · p. 4
  • Neither majorization direction holds universally between Ω(M ⊗ N) and Ω(M) ⊗Ω(N), since either strict ordering of the block-weight distributions can be enforced.Because the block states are maximally mixed on equal-dimensional spaces, the distributions’ majorization relations lift to the quantum states.Source: §V · p. 4

VI. DISCUSSION

The discussion concludes that the Holevo barycenter is not generally tensor-multiplicative, extending the known non-additivity phenomenon. It points to possible geometric and resource-theoretic questions arising from tensor products.

VI. DISCUSSION

  • The construction uses a direct sum of additive and non-additive channels and shows that no simple relation need connect the product of barycenters with the barycenter of the product channel.The paper presents this non-multiplicativity as a strengthening of the non-additivity of Holevo capacity.Source: §VI · p. 4
  • The discussion proposes that tensor products may generate extremal output-ensemble points absent from either channel individually, and raises barycentric activation as a question for further study.It suggests that comparisons of barycenter-based quantities can depend on the tensor environment.Source: §VI · p. 4
  • The authors suggest that the geometric mechanisms may offer avenues toward a manageable counterexample to Holevo-capacity additivity and that the relation may extend beyond finite dimensions.Continuous-variable channels are identified as a setting for further exploration.Source: §VI · p. 4
Loading 2609.09373v1…