5
$\begingroup$

I have been reading the proofs that are usually presented in order to proof the additivity of degradable and conjugate degradable channels, and they usually present that the coherent information is additive for two channel uses, i.e. $Q^{(1)}(\mathcal{N}\otimes\mathcal{N})=Q^{(1)}(\mathcal{N})+Q^{(1)}(\mathcal{N})$, and then immediately state that such thing implies that the quantum channel capacity is single-letter characterized.

My question is then, does proving that the channel coherent information to be additive for the two-channel use case imply that it is additive for larger $n$?


Cross-posted on physics.SE

$\endgroup$

1 Answer 1

1
$\begingroup$

I found out the paper Quantum Channel Capacities (by Graeme Smith) were the author states: "Some entropic function f(N ) is shown to be an achievable rate, and its regularization equal to the capacity, so if we can show f is additive we get a tractable capacity formula. Note that this concerns the additivity of f on two copies of the same channel." Here f might be the coherent information.

So it seems that the answer to the question is yes, but he does not further discuss such statement. It would be nice to see the reason for this.

EDIT

After discussing this topic with several colleagues, the answer to this questions is that proving the two-shot additivity does not imply additivity for arbitrary $n$ channel uses. In fact, it has been studied that an unbounded number of channel uses may be required to be able to detect non-additive effects of the coherent information (Unbounded number of channel uses may be required to detect quantum capacity). It seems that the paper I was citing in the last update of the answer ("Quantum channel capacities") is referring to what it is called "strong additivity", which in fact means that a channel N is additive respect to an entropic function for any oteher channel M. Strong additivity is not being proved in the question posted, so one thing does not imply the other.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.