Constructions and performance of classes of quantum LDPC codes

Abstract

Two methods for constructing quantum LDPC codes are presented. We explain how to overcome the difficulty of finding a set of low weight generators for the stabilizer group of the code. Both approaches are based on some graph representation of the generators of the stabilizer group and on simple local rules that ensure commutativity. A message passing algorithm for generic quantum LDPC codes is also introduced. Finally, we provide two specific examples of quantum LDPC codes of rate 1/2 obtained by our methods, together with a numerical simulation of their performance over the depolarizing channel.

13 pages, 4 figures. Minor corrections added. Results unchanged

References in corpus (1)

• A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space

Cited by in corpus (9)

• Optimal and Efficient Decoding of Concatenated Quantum Block Codes
• The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure
• Entanglement-assisted Coding Theory
• New constructions of CSS codes obtained by moving to higher alphabets
• Quantum stabilizer codes and beyond
• On Quantum and Classical Error Control Codes: Constructions and Applications
• Error Correction for Reliable Quantum Computing
• An Adaptive Entanglement Distillation Scheme Using Quantum Low Density Parity Check Codes
• Experimental study and pratical realization of a reconciliation method for quantum key distribution system