Title :
Information rates achievable with algebraic codes on discrete memoryless quantum channels
Author_Institution :
Quantum Comput. & Inf. Project, Japan Sci. & Technol. Corp., Tokyo, Japan
fDate :
29 June-4 July 2003
Abstract :
The highest information rate at which quantum error-correction schemes work reliably on a channel, which is called the quantum capacity, is proven to be lower bounded by the limit of the quantity termed coherent information maximized over the set of input density operators which are proportional to the projections onto the code spaces of symplectic (stabilizer) codes. 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, and the codes that are proven to have the desired performance are symplectic codes. On the depolarizing channel, this work´s bound is actually the highest possible rate at which symplectic codes work reliably. The details of this work can be found in (M. Hamada, 2002).
Keywords :
Hilbert spaces; algebraic codes; error correction codes; quantum communication; Hilbert space; algebraic codes; depolarizing channel; discrete memoryless quantum channels; information rates; quantum capacity; quantum error-correction schemes; symplectic codes; Code standards; Computer errors; Electronic mail; Error correction codes; Hilbert space; Information rates; Memoryless systems; Polarization; Quantum computing; Tensile stress;
Conference_Titel :
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN :
0-7803-7728-1
DOI :
10.1109/ISIT.2003.1228497