Exponential lower bound on the highest fidelity achievable by quantum error-correcting codes

Details Exponential lower bound on the highest fidelity achievable by quantum error-correcting codes Exponential lower bound on the highest fidelity achievable by quantum error-correcting codes

2001-09-21

arxiv.org/abs/quant-ph/0109114v5

Physical Review A, vol.65, 052305, May 2002

Physics

Quantum Physics

Ver.4. In vers.1--3, I claimed Theorem 1 for general quantum channels. Now I claim this only for a slight generalization of de

Scientific paper

10.1103/PhysRevA.65.052305

On a class of memoryless quantum channels which includes the depolarizing
channel, the highest fidelity of quantum error-correcting codes of length n and
rate R is proven to be lower bounded by 1-exp[-nE(R)+o(n)] for some function
E(R). The E(R) is positive below some threshold R', which implies R' is a lower
bound on the quantum capacity.

Affiliated with

Also associated with

No associations

Rating

Exponential lower bound on the highest fidelity achievable by quantum error-correcting codes 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 Exponential lower bound on the highest fidelity achievable by quantum error-correcting codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exponential lower bound on the highest fidelity achievable by quantum error-correcting codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-493695