Efficient Quantum Stabilizer Codes: LDPC and LDPC-Convolutional Constructions

DOI10.1109/TIT.2009.2034794MaRDI QIDQ4976065zbMATH OpenFDO

Authors Peiyu Tan, Jing Li Tiffany

Publication date 27 July 2017

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

Full work available at URL https://doi.org/10.1109/TIT.2009.2034794

Mathematics Subject Classification ID

Quantum coding (general) (81P70) Convolutional codes (94B10) Other types of codes (94B60)

Cited in

(14)

• On the construction of stabilizer codes with an arbitrary binary matrix
• [[:Publication:1955881|Efficient quantum circuit for encoding and decoding of the 8,3,5 stabilizer code]]
• Good rate QECCs from the quantum construction \(X\)
• New constructions of quantum stabilizer codes based on difference sets
• Nonbinary quantum convolutional codes derived from negacyclic codes
• A class of quantum low-density parity check codes by combining seed graphs
• Conversion of a general quantum stabilizer code to an entanglement distillation protocol
• Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
• Distance Verification for Classical and Quantum LDPC Codes
• Burst error-correcting quantum stabilizer codes designed from idempotents
• On the constructions of quantum MDS convolutional codes
• Classical convolutional GRS codes and applications to quantum convolutional codes
• Application of GRS codes to some optimal quantum convolutional codes
• A construction of MDS quantum convolutional codes

This page was built for publication: Efficient Quantum Stabilizer Codes: LDPC and LDPC-Convolutional Constructions

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