A note on the minimum distance of quantum LDPC codes

DOI10.1007/978-3-662-44465-8_21MaRDI QIDQ2922612zbMATH OpenOpenAlexFDO

Authors Nicolas Delfosse, Zhentao Li, Stéphan Thomassé

Publication date 14 October 2014

Published in Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum coding (general) (81P70) Linear codes (general theory) (94B05)

Abstract: We provide a new lower bound on the minimum distance of a family of quantum LDPC codes based on Cayley graphs proposed by MacKay, Mitchison and Shokrollahi. Our bound is exponential, improving on the quadratic bound of Couvreur, Delfosse and Z'emor. This result is obtained by examining a family of subsets of the hypercube which locally satisfy some parity conditions.

Recommendations

• Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
• On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction
• Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
• Graphical quantum low-density parity-check codes
• Quantum codes of minimum distance two

Cited in

(7)

• On tensor products of CSS codes
• Sparse quantum codes from quantum circuits
• On the minimum distance of array codes as LDPC codes
• Quantum codes of minimum distance two
• Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
• Good approximate quantum LDPC codes from spacetime circuit Hamiltonians
• Distance Verification for Classical and Quantum LDPC Codes

This page was built for publication: A note on the minimum distance of quantum LDPC codes

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