Lower bound for the quantum capacity of a discrete memoryless quantum channel

Details Lower bound for the quantum capacity of a discrete memoryless quantum channel Lower bound for the quantum capacity of a discrete memoryless quantum channel

2001-05-31

arxiv.org/abs/quant-ph/0105151v4

J. Math. Phys., vol. 43, no. 9, pp. 4391-4403, Sept. 2002

Physics

Quantum Physics

16 pages, REVTeX4. To appear in J. Math. Phys. A critical error in fidelity calculation was corrected by using Hamada's result

Scientific paper

10.1063/1.1497999

We generalize the random coding argument of stabilizer codes and derive a lower bound on the quantum capacity of an arbitrary discrete memoryless quantum channel. For the depolarizing channel, our lower bound coincides with that obtained by Bennett et al. We also slightly improve the quantum Gilbert-Varshamov bound for general stabilizer codes, and establish an analogue of the quantum Gilbert-Varshamov bound for linear stabilizer codes. Our proof is restricted to the binary quantum channels, but its extension of to l-adic channels is straightforward.

Affiliated with

Also associated with

No associations

Rating

Lower bound for the quantum capacity of a discrete memoryless quantum channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lower bound for the quantum capacity of a discrete memoryless quantum channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower bound for the quantum capacity of a discrete memoryless quantum channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-250412