Two Infinite Families of Nonadditive Quantum Error-Correcting Codes

DOI10.1109/TIT.2015.2489645MaRDI QIDQ2977201zbMATH OpenOpenAlexDBLPWikidataFDO

Authors

Publication date 28 April 2017

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

Full work available at URL https://arxiv.org/abs/0901.1935

Mathematics Subject Classification ID

Quantum coding (general) (81P70) Burst-correcting codes (94B20) Synchronization error-correcting codes (94B50)

Abstract: We construct explicitly two infinite families of genuine nonadditive 1-error correcting quantum codes and prove that their coding subspaces are 50% larger than those of the optimal stabilizer codes of the same parameters via the linear programming bound. All these nonadditive codes can be characterized by a stabilizer-like structure and thus their encoding circuits can be designed in a straightforward manner.

Recommendations

• Infinite Families of Quantum-Classical Hybrid Codes
• Nonadditive quantum error-correcting code
• Inhomogeneous quantum codes. II: Non-additive case
• Simple Family of Nonadditive Quantum Codes
• scientific article; zbMATH DE number 1406138
• A new construction of quantum error-correcting codes
• Two families of BCH codes and new quantum codes
• Two families of BCH codes and new quantum codes
• QUANTUM ERROR-CORRECTING CODES FROM QUASI-CYCLIC CODES
• A combinatorial approach to quantum error correcting codes

Cited in

(3)

• Non-Pauli observables for CWS codes
• Simple Family of Nonadditive Quantum Codes
• Infinite Families of Quantum-Classical Hybrid Codes

This page was built for publication: Two Infinite Families of Nonadditive Quantum Error-Correcting Codes

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