Quantum Capacity

In the theory of quantum communication, the quantum capacity is the highest rate at which quantum information can be communicated over many independent uses of a noisy quantum channel from a sender to a receiver. It is also equal to the highest rate at which entanglement can be generated over the channel, and forward classical communication cannot improve it. The quantum capacity theorem is important for the theory of quantum error correction, and more broadly for the theory of quantum computation. The theorem giving a lower bound on the quantum capacity of any channel is colloquially known as the LSD theorem, after the authors Lloyd, Shor, and Devetak who proved it with increasing standards of rigor.

Hashing bound for Pauli channels

The LSD theorem states that the coherent information of a quantum channel is an achievable rate for reliable quantum communication. For a Pauli channel, the coherent information has a simple form and the proof that it is achievable is particularly simple as well. We prove the theorem for this special case by exploiting random stabilizer codes and correcting only the likely errors that the channel produces.

Theorem (hashing bound). There exists a stabilizer quantum error-correcting code that achieves the hashing limit $R=1-H\left(\mathbf\right)$ for a Pauli channel of the following form:$\rho \mapsto p_\rho+p_X\rho X+p_Y\rho Y+p_Z\rho Z,$where $\mathbf=\left(p_,p_,p_,p_\right)$ and $H\left(\mathbf\right)$ is the entropy of this probability vector.

Proof. Consider correcting only the typical errors. That is, consider defining the
typical set of errors as follows:$T_^\equiv\left\ ,$where $a^$ is some sequence consisting of the letters $\left\$ and $\Pr\left\$ is the probability that an IID Pauli channel issues some tensor-product error $E_\equiv E_\otimes\cdots\otimes E_$. This typical set consists of the likely errors in the sense that$\sum_\Pr\left\ \geq 1-\epsilon,$for all $\epsilon>0$ and sufficiently large $n$. The error-correcting
conditions. for a stabilizer code $\mathcal$ in this case are that $\$ is a correctable set of errors if

$E_^E_\notin N\left(\mathcal\right) \backslash \mathcal,$for all error pairs $E_$ and $E_$ such that $a^,b^\in T_^$ where $N(\mathcal)$ is the normalizer of $\mathcal$. Also, we consider the expectation of the error probability under a random choice of a stabilizer code.

Proceed as follows:$\begin \mathbb_\left\ &= \mathbb_ \left\ \\ &\leq \mathbb_ \left\ + \epsilon \\ &= \sum_ \Pr\left\ \mathbb_ \left\ + \epsilon \\ &= \sum_ \Pr\left\ \Pr_ \left\ + \epsilon. \end$The first equality follows by definition—$\mathcal$ is an indicator function equal to one if $E_$ is uncorrectable under $\mathcal$ and equal to zero otherwise. The first inequality follows, since we correct only the typical errors because the atypical error set has negligible probability mass. The second equality follows by exchanging the expectation and the sum. The third equality follows because the expectation of an indicator function is the probability that the event it selects occurs.

Continuing, we have:$=\sum_\Pr\left\ \Pr_\left\$
:$\leq\sum_\Pr\left\ \Pr_\left\$
:$=\sum_\Pr\left\ \Pr_\left\$
:$\leq\sum_ \Pr\left\ \Pr_\left\$
:$\leq\sum_ \Pr\left\ 2^$
:$\leq2^2^2^$
:$=2^.$
The first equality follows from the error-correcting conditions for a quantum stabilizer code, where $N\left( \mathcal\right)$ is the normalizer of
$\mathcal$. The first inequality follows by ignoring any potential degeneracy in the code—we consider an error uncorrectable if it lies in the normalizer $N\left( \mathcal\right)$ and the probability can only be larger because $N\left( \mathcal\right) \backslash\mathcal\in N\left( \mathcal\right)$. The second equality follows by realizing that the probabilities for the existence criterion and the union of events are equivalent. The second inequality follows by applying the union bound. The third inequality follows from the fact that the probability for a fixed operator $E_^E_$ not equal to the identity commuting with
the stabilizer operators of a random stabilizer can be upper bounded as follows:
$\Pr_\left\ =\frac\leq2^.$
The reasoning here is that the random choice of a stabilizer code is equivalent to
fixing operators $Z_$, ..., $Z_$ and performing a uniformly random
Clifford unitary. The probability that a fixed operator commutes with
$\overline_$, ..., $\overline_$ is then just the number of
non-identity operators in the normalizer ($2^-1$) divided by the total number of non-identity operators ($2^-1$). After applying the above bound, we then exploit the following typicality bounds:
$\forall a^ \in T_^:\Pr\left\ \leq2^,$$\left\vert T_^\right\vert \leq2^.$
We conclude that as long as the rate $k/n=1-H\left( \mathbf\right) -4\delta$, the expectation of the error probability becomes arbitrarily small, so that there exists at least one choice of a stabilizer code with the same bound on the error probability.

See also

* Quantum computing

References

{{quantum computing

Quantum information science
Quantum information theory
Models of computation
Quantum cryptography
Theoretical computer science
Classes of computers
Information theory
Computational complexity theory
Limits of computation