Fiber Bundle Codes: Breaking the N^1/2polylog(N) Barrier for Quantum LDPC Codes

09/08/2020

∙

by   Matthew B. Hastings, et al.

∙

0

∙

share

We present a quantum LDPC code family that has distance Ω(N^3/5/polylog(N)) and Θ̃(N^3/5) logical qubits. This is the first quantum LDPC code construction which achieves distance greater than N^1/2polylog(N). The construction is based on generalizing the homological product of codes to a fiber bundle.