Simplifying additivity problems using direct sum constructions

Details Simplifying additivity problems using direct sum constructions Simplifying additivity problems using direct sum constructions

2007-04-09

arxiv.org/abs/0704.1092v2

J. Math. Phys. 48, 072101 (2007)

Physics

Quantum Physics

5 pages

Scientific paper

10.1063/1.2746128

We study the additivity problems for the classical capacity of quantum channels, the minimal output entropy and its convex closure. We show for each of them that additivity for arbitrary pairs of channels holds iff it holds for arbitrary equal pairs, which in turn can be taken to be unital. In a similar sense, weak additivity is shown to imply strong additivity for any convex entanglement monotone. The implications are obtained by considering direct sums of channels (or states) for which we show how to obtain several information theoretic quantities from their values on the summands. This provides a simple and general tool for lifting additivity results.

Affiliated with

Also associated with

No associations

Rating

Simplifying additivity problems using direct sum constructions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simplifying additivity problems using direct sum constructions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simplifying additivity problems using direct sum constructions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-387534