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,[1] Shor,[2] and Devetak[3] who proved it with increasing standards of rigor.[4]
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[citation needed] and the proof that it is achievable is particularly simple as well. We[who?] 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 for a Pauli channel of the following form:
Proof. Consider correcting only the typical errors. That is, consider defining the typical set of errors as follows:
Proceed as follows:
Continuing, we have:
The first equality follows from the error-correcting conditions for a quantum stabilizer code, where is the normalizer of . The first inequality follows by ignoring any potential degeneracy in the code—we consider an error uncorrectable if it lies in the normalizer and the probability can only be larger because . 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 not equal to the identity commuting with the stabilizer operators of a random stabilizer can be upper bounded as follows: The reasoning here is that the random choice of a stabilizer code is equivalent to fixing operators , ..., and performing a uniformly random Clifford unitary. The probability that a fixed operator commutes with , ..., is then just the number of non-identity operators in the normalizer ( ) divided by the total number of non-identity operators ( ). After applying the above bound, we then exploit the following typicality bounds:
{{cite book}}
: CS1 maint: location missing publisher (link)