2000 character limit reached
Fiber Bundle Codes: Breaking the $N^{1/2} \operatorname{polylog}(N)$ Barrier for Quantum LDPC Codes (2009.03921v2)
Published 8 Sep 2020 in quant-ph, cs.IT, math.CO, and math.IT
Abstract: We present a quantum LDPC code family that has distance $\Omega(N{3/5}/\operatorname{polylog}(N))$ and $\tilde\Theta(N{3/5})$ logical qubits. This is the first quantum LDPC code construction which achieves distance greater than $N{1/2} \operatorname{polylog}(N)$. The construction is based on generalizing the homological product of codes to a fiber bundle.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.