Fiber Bundle Codes: Breaking the N^1/2 polylog(N) Barrier for Quantum LDPC Codes
- Matthew Hastings ,
- Jeongwan Haah ,
- Ryan O'Donnell
ArXiV preprint
We present a quantum LDPC code family that has distance \(\Omega(N^{3/5}/{polylog}(N))\) and \(\tilde\Theta(N^{3/5})\) logical qubits, where N is the code length. This is the first quantum LDPC code construction which achieves distance greater than \(N^{1/2} {polylog}(N)\). The construction is based on generalizing the homological product of codes to a fiber bundle.