A Construction of Quantum LDPC Codes from Cayley Graphs

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 $\mathcal{O}(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^{\frac{n+1}{2}},2^{\frac{n-1}{2}}]]$.

The material in this paper was presented in part at ISIT 2011. This article is published in IEEE Transactions on Information Theory. We point out that the second step of the proof of Proposition VI.2 in the published version (Proposition 25 in the present version and Proposition 18 in the ISIT extended abstract) is not strictly correct. This issue is addressed in the present version

References in corpus (6)

• Fault-tolerant quantum computation with high threshold in two dimensions
• Topological Quantum Distillation
• Topological fault-tolerance in cluster state quantum computation
• A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
• Asymmetric Quantum LDPC Codes
• A Class of Quantum LDPC Codes Constructed From Finite Geometries

Cited by in corpus (2)

• Topological graph states and quantum error correction codes
• Distance verification for classical and quantum LDPC codes