Lower bounds on the quantum capacity and highest error exponent of general memoryless channels

DOI10.1109/TIT.2002.801470zbMath1062.94066arXivquant-ph/0112103OpenAlexW2163386460MaRDI QIDQ4677574

Mitsuru Hamada

Publication date: 11 May 2005

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0112103

Mathematics Subject Classification ID

Quantum computation (81P68) Other types of codes (94B60) Coding theorems (Shannon theory) (94A24)

Related Items (3)

Asymmetric quantum convolutional codes ⋮ NOTES ON THE FIDELITY OF SYMPLECTIC QUANTUM ERROR-CORRECTING CODES ⋮ Asymmetric quantum Reed-Solomon and generalized Reed-Solomon codes

This page was built for publication: Lower bounds on the quantum capacity and highest error exponent of general memoryless channels