View source for Textual variants in the Gospel of Matthew

A '''quantum depolarizing channel''' is a model for noise in quantum systems. The d-dimensional depolarizing channel can be viewed as a [[Quantum channel|completely positive trace-preserving map]] <math>\Delta_\lambda</math>, depending on one parameter <math>\lambda</math>, which maps a state <math>\rho</math> onto a linear combination of itself and the [[maximally mixed state]]:
:<math>\Delta_\lambda(\rho)=\lambda\rho+\frac{1-\lambda}{d}I</math>
The condition of complete positivity requires <math>\lambda</math> to satisfy the bounds:
:<math>-\frac{1}{d^2-1}\le\lambda\le 1</math>

== Classical capacity ==

The [[HSW theorem]] states that the classical capacity of a quantum channel <math>\Psi</math> can be characterized as its regularized [[Holevo information]]:
:<math>\lim_{n\to\infty}\frac{1}{n}\chi\left(\Psi^{\otimes n}\right)</math>

This quantity is difficult to compute and this reflects our ignorance on quantum channels. However, if the Holevo information is additive for a channel <math>\Psi</math>, i.e.,
:<math>\chi\left(\Psi\otimes\Psi\right)=\chi\left(\Psi\right)+\chi\left(\Psi\right)</math>
Then we can get its classical capacity by computing the Holevo information of the channel.

The additivity of Holevo information for all channels was a famous open conjecture in quantum information theory, but it is now known that this conjecture doesn't hold in general. This was proved by showing that the additivity of [[minimum output entropy]] for all channels doesn't hold,{{sfn|Hastings|2009}} which is an equivalent conjecture.

Nonetheless, the additivity of the Holevo information is shown to hold for the quantum depolarizing channel,{{sfn|King|2003}} and an outline of the proof is given below. As a consequence, entanglement across multiple uses of the channel cannot increase the classical capacity. In this sense, the channel behaves like a classical channel. To achieve the optimal rate of communication, it suffices to choose an orthonormal basis to encode the message, and perform measurements that project onto to the same basis at the receiving end.

=== Outline of the proof of the additivity of Holevo information ===

The additivity of Holevo information for the depolarizing channel was proved by Christopher King.{{sfn|King|2003}} He showed that the [[maximum output p-norm]] of the depolarizing channel is multiplicative, which implied the additivity of the minimum output entropy, which is equivalent to the additivity of the Holevo information.

A stronger version of the additivity of the Holevo information is shown for the depolarizing channel <math>\Delta_\lambda</math>. For any channel <math>\Psi</math>:
:<math>\chi\left(\Delta_\lambda\otimes\Psi\right)=\chi\left(\Delta_\lambda\right)+\chi\left(\Psi\right)</math>
This is implied by the following multiplicativity of maximum output p-norm (denoted as <math>v_p</math>):
:<math>v_p\left(\Delta_\lambda\otimes\Psi\right)=v_p\left(\Delta_\lambda\right)v_p\left(\Psi\right)</math>

The greater than or equal to direction of the above is trivial, it suffices to take the tensor product the states that achieve the maximum p-norm for <math>\Delta_\lambda</math> and <math>\Psi</math> respectively, and input the product state into the product channel to get the output p-norm <math>v_p(\Delta_\lambda)v_p(\Psi)</math>. The proof for the other direction is more involved

The main idea of the proof is to rewrite the depolarizing channel as a [[convex combination]] of simpler channels, and use properties of those simpler channels to get the multiplicativity of the maximum output p-norm for the depolarizing channel.

It turns out that we can write the depolarizing channel as follows:
:<math>\Delta_\lambda(\rho)=\sum_{n=1}^{2d^2(d+1)}c_nU_n^*\Phi_\lambda^{(n)}(\rho)Un</math>
where <math>c_n</math>'s are positive numbers, <math>U_n</math>'s are unitary matrices, <math>\Phi^{(n)}_\lambda</math>'s are some [[dephasing channels]] and <math>\rho</math> is an arbitrary input state.

Therefore, the product channel can be written as:
:<math>\left(\Delta_\lambda\otimes\Psi\right)(\rho)=\sum_{n=1}^{2d^2(d+1)}c_n\left(U_n^*\otimes I\right)\left(\Phi_\lambda^{(n)}\otimes\Psi\right)(\rho)\left(U_n\otimes I\right)</math>

By the convexity and the unitary invariance of the p-norm, it suffices to show the simpler bound:
:<math>\|\left(\Phi^{(n)}_\lambda\otimes\Psi\right)(\rho)\|_p\le v_p(\Delta_\lambda)v_p(\Psi)</math>

One important mathematical tool used in the proof of this bound is the [[Trace Inequalities|Lieb-Thirring inequality]], which provides a bound for p-norm of a product of positive matrices. The details and the calculations of the proof are skipped, interested readers are referred to the paper of C. King mentioned above.

=== Discussion ===

The main technique used in this proof, namely rewriting the channel of interest as a convex combination of other simpler channels, is a generalization of the method used earlier to prove similar results for [[unital qubit channels]].<ref>C. King, ''Additivity for unital qubit channels''</ref>

The fact that the classical capacity of the depolarizing channel is equal to the Holevo information of the channel means that we can't really uses quantum effects such as entanglement to improve the transmission rate of classical information. In this sense, the depolarizing channel can be treated as a classical channel.

However the fact that the additivity of Holevo information doesn't hold in general proposes some areas of future work, namely finding channels that violates the additivity, in other words, channels that can exploit quantum effects to improve the classical capacity beyond its Holevo information.

== Notes ==
{{reflist}}

== References ==
*{{Citation |last=King |first=C. |date=14 January 2003 |title=The capacity of the quantum depolarizing channel |journal=[[IEEE Transactions on Information Theory]] |volume=49 |issue=1 |pages=221–229 |doi=10.1109/TIT.2002.806153 |id= |arxiv=quant-ph/0204172v2}}
*{{Citation |last=Hastings |first=M. B. |date=15 March 2009 |title=Superadditivity of communication capacity using entangled inputs |journal=[[Nature Physics]] |volume=5 |pages=255–257 |doi=10.1038/nphys1224 |id= |arxiv=0809.3972v4 |issue=4}}

{{DEFAULTSORT:Quantum Depolarizing Channel}}
[[Category:Quantum information theory]]