Exponential lower bound on the highest fidelity achievable by quantum error-correcting codes
arXiv:quant-ph/0109114 · doi:10.1103/PhysRevA.65.052305
Abstract
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.
Ver.4. In vers.1--3, I claimed Theorem 1 for general quantum channels. Now I claim this only for a slight generalization of depolarizing channel in this paper because Lemma 2 in vers.1--3 was wrong; the original general statement is proved in quant-ph/0112103. Ver.5. Text sectionalized. Appeared in PRA. The PRA article is typographically slightly crude: The LaTeX symbol star, used as superscripts, was capriciously replaced by the asterisk in several places after my proof reading
Cited by in corpus (7)
- Tema Con Variazioni: Quantum Channel Capacity
- A Lower Bound on the Quantum Capacity of Channels with Correlated Errors
- Lower Bounds on the Quantum Capacity and Highest Error Exponent of General Memoryless Channels
- Noise Tolerance of the BB84 Protocol with Random Privacy Amplification
- Asymptotic survival of genuine multipartite entanglement in noisy quantum networks depends on the topology
- Teleportation and entanglement distillation in the presence of correlation among bipartite mixed states
- How to correct small quantum errors