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

Simple item page
dc.creatorMatsumoto, Ryutaroh
dc.creatorUyematsu, Tomohiko
dc.date2001-05-31
dc.date2002-07-25
dc.date.accessioned2026-07-07T08:02:45Z
dc.date.available2026-07-07T08:02:45Z
dc.descriptionWe 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.
dc.description16 pages, REVTeX4. To appear in J. Math. Phys. A critical error in fidelity calculation was corrected by using Hamada's result (quant-ph/0112103). In the third version, we simplified formula and derivation of the lower bound by proving p(Gamma)+q(Gamma)=1. In the second version, we added an analogue of the quantum Gilbert-Varshamov bound for linear stabilizer codes
dc.identifierhttps://arxiv.org/abs/quant-ph/0105151
dc.identifierhttp://arxiv.org/abs/quant-ph/0105151
dc.identifierJ. Math. Phys., vol. 43, no. 9, pp. 4391-4403, Sept. 2002
dc.identifierdoi:10.1063/1.1497999
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/129324
dc.subjectQuantum Physics
dc.titleLower bound for the quantum capacity of a discrete memoryless quantum channel
dc.typetext

Files

Collections

arXiv