Construction of quantum codes and asymmetric quantum codes from graphs

DOI10.3969/J.ISSN.1003-5060.2013.11.025MaRDI QIDQ4980912zbMATH OpenFDO

Authors Yourui Huang, Feng Xu, Jianqiu Zhang, Jianfa Qian

Publication date 30 June 2014

zbMATH Keywords

adjacency matrixquantum error-correcting codeasymmetric quantum error-correcting code

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum coding (general) (81P70) Synchronization error-correcting codes (94B50)

Recommendations

• Asymmetric quantum codes: new codes from old
• Some new constructions of optimal asymmetric quantum codes
• On the construction of asymmetric quantum codes
• On two problems of asymmetric quantum codes
• Asymmetric quantum codes: constructions, bounds and performance

Cited in

(8)

• Nested quantum error correction codes via subgraphs
• Graphical quantum error-correcting codes based on entanglement of subgraphs
• Construction of nonbinary quantum cyclic codes by using graph method
• New quantum codes from metacirculant graphs via self-dual additive \(\mathbb{F}_4\)-codes
• Asymmetric quantum Griesmer codes detecting a single bit-flip error
• A class of quantum low-density parity check codes by combining seed graphs
• Graph concatenation for quantum codes
• Construction of single quantum deletion codes via combinatorial conditions and adjacency matrices

This page was built for publication: Construction of quantum codes and asymmetric quantum codes from graphs

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