Emergent Mind

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

(2009.03921)
Published Sep 8, 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.

We're not able to analyze this paper right now due to high demand.

Please check back later (sorry!).

Generate a summary of this paper on our Pro plan:

We ran into a problem analyzing this paper.

Newsletter

Get summaries of trending comp sci papers delivered straight to your inbox:

Unsubscribe anytime.