English

Fiber Bundle Codes: Breaking the $N^{1/2} \operatorname{polylog}(N)$ Barrier for Quantum LDPC Codes

Quantum Physics 2024-07-08 v2 Information Theory Combinatorics math.IT

Abstract

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

Cite

@article{arxiv.2009.03921,
  title  = {Fiber Bundle Codes: Breaking the $N^{1/2} \operatorname{polylog}(N)$ Barrier for Quantum LDPC Codes},
  author = {Matthew B. Hastings and Jeongwan Haah and Ryan O'Donnell},
  journal= {arXiv preprint arXiv:2009.03921},
  year   = {2024}
}

Comments

39 pages, 2 figures; v2 gives self-contained presentation of weight reduction using weight reduction for classical base code. Also contains explanation of relation between codes in terms of homotopy equivalence of chain complexes

R2 v1 2026-06-23T18:23:58.390Z