Information Rates Achievable With Algebraic Codes on Quantum Discrete Memoryless Channels

DOI10.1109/TIT.2005.860824MaRDI QIDQ3546981zbMATH OpenFDO

Authors Mitsuro Hamada

Publication date 21 December 2008

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

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

zbMATH Keywords

completely positive (CP) linear mapsfidelitymethod of typesquantum capacityquantum error-correcting codessymplectic geometry

Mathematics Subject Classification ID

Applications of operator theory in the physical sciences (47N50) Quantum coding (general) (81P70) Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

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 stabilizer codes. On the depolarizing channel, this work's bound is actually the highest possible rate at which symplectic stabilizer codes work reliably.

Recommendations

• Lower bounds on the quantum capacity and highest error exponent of general memoryless channels
• Lower bound for the quantum capacity of a discrete memoryless quantum channel
• NOTES ON THE FIDELITY OF SYMPLECTIC QUANTUM ERROR-CORRECTING CODES
• A low-rate bound on the reliability of a quantum discrete memoryless channel
• Quantum error detection .II. Bounds

Cited in

(14)

• Superadditivity in capacity of quantum channel for q-ary linearly dependent real symmetric-state signals
• A Decoupling Approach to the Quantum Capacity
• Polar quantum channel coding with optical multi-qubit entangling gates for capacity-achieving channels
• scientific article; zbMATH DE number 5508888 (Why is no real title available?)
• Communicating Over Adversarial Quantum Channels Using Quantum List Codes
• Quantum error detection .II. Bounds
• Lower bounds on the quantum capacity and highest error exponent of general memoryless channels
• A low-rate bound on the reliability of a quantum discrete memoryless channel
• NOTES ON THE FIDELITY OF SYMPLECTIC QUANTUM ERROR-CORRECTING CODES
• Lower bound for the quantum capacity of a discrete memoryless quantum channel
• A family of degenerate codes for depolarizing channels
• Quantum error correction for diagonal channels
• Channel polarization of two-dimensional-input quantum symmetric channels
• Maximal noiseless code rates for collective rotation channels on qudits

This page was built for publication: Information Rates Achievable With Algebraic Codes on Quantum Discrete Memoryless Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546981)