“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,^[1] Shor,^[2] and Devetak^[3] 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{{Citation needed|date=April 2015}} and the proof that it is achievable is particularly simple as well. We{{Who|date=October 2017}} 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

that an IID Pauli channel issues some tensor-product error

. This typical set consists of the likely errors in the sense that

conditions^[4] for a stabilizer code

in this case are that

is a correctable set of errors if

for all error pairs

and

such that

where

is the normalizer of

. Also, we consider the expectation of the error probability under a random choice of a stabilizer code.

The first equality follows by definition—

is an indicator function equal to one if

is uncorrectable under

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

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

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:

We conclude that as long as the rate

, 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

References

1. ^{{cite journal | journal = Physical Review A | volume = 55 | issue = 3 | pages = 1613–1622 | year = 1997 | author = Seth Lloyd |title = Capacity of the noisy quantum channel | doi = 10.1103/PhysRevA.55.1613 | arxiv = quant-ph/9604015|bibcode = 1997PhRvA..55.1613L }}
2. ^{{cite journal | journal = Lecture Notes, MSRI Workshop on Quantum Computation | year = 2002 | author = Peter Shor | title = The quantum channel capacity and coherent information | url = http://www.msri.org/publications/ln/msri/2002/quantumcrypto/shor/1/meta/aux/shor.pdf | format = pdf}}
3. ^{{cite journal | journal = IEEE Transactions on Information Theory | volume = 51 | pages = 44–55 | year = 2005 | author = Igor Devetak | title = The private classical capacity and quantum capacity of a quantum channel | doi = 10.1109/TIT.2004.839515 | arxiv = quant-ph/0304127}}
4. ^{{citation | last1 = Nielsen | first1 = Michael A. | author1-link = Michael Nielsen | last2 = Chuang | first2 = Isaac L. | author2-link = Isaac Chuang | title = Quantum Computation and Quantum Information | publisher = Cambridge University Press | date = 2000 | isbn = 9780521635035}}.

Hashing bound for Pauli channels

See also

References

Further reading