A polynomial-time construction of self-orthogonal codes and applications to quantum error correction
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Quantum quasi-cyclic low-density parity-check codes
ICIC'09 Proceedings of the 5th international conference on Emerging intelligent computing technology and applications
| Hi-index | 754.84 |
The highest information rate at which quantum error-correction schemes work reliably on a channel is called the quantum capacity. Here this is proven to be lower-bounded by the limit of coherent information maximized over the set of input density operators which are proportional to the projections onto the code spaces of symplectic stabilizer codes. The quantum channels to be considered are those subject to independent errors and modeled as tensor products of copies of a completely positive linear map on a Hilbert space of finite dimension. The codes that are proven to have the desired performance are symplectic stabilizer codes. On the depolarizing channel, the bound proven here is actually the highest possible rate at which symplectic stabilizer codes work reliably