A Construction of Quantum LDPC Codes From Cayley Graphs

DOI10.1109/TIT.2013.2261116MaRDI QIDQ5346348zbMATH OpenOpenAlexFDO

Authors Alain Couvreur, Nicolas Delfosse, Gilles Zémor

Publication date 8 June 2017

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

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

Mathematics Subject Classification ID

Quantum coding (general) (81P70) Linear codes (general theory) (94B05) Other types of codes (94B60)

Abstract: We study a construction of Quantum LDPC codes proposed by MacKay, Mitchison and Shokrollahi. It is based on the Cayley graph of Fn together with a set of generators regarded as the columns of the parity-check matrix of a classical code. We give a general lower bound on the minimum distance of the Quantum code in $mathcalO(d{n}^2)$ where d is the minimum distance of the classical code. When the classical code is the $[n,1,n]$ repetition code, we are able to compute the exact parameters of the associated Quantum code which are $[[2^n,2^{fracn+12},2^{fracn-12}]]$.

Cited in

(8)

• Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
• On quantum SPC product codes
• Hypermap-homology quantum codes
• A construction of quantum turbo product codes based on CSS-type quantum convolutional codes
• On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction
• A class of quantum low-density parity check codes by combining seed graphs
• Quantum locally testable codes
• On tensor products of CSS codes

This page was built for publication: A Construction of Quantum LDPC Codes From Cayley Graphs

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