Show Paper arXiv Publisher

Quick Navigation

Overview Topics Abstract Paper Tools References Reactions Discussion Publication Related

Topics

Quantum Error Correction Fault Tolerance

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

arXiv
Authors: Matthew B. Hastings, Jeongwan Haah, Ryan O'Donnell

Year

2020

Paper ID

20859

Status

Preprint

Abstract Read

~2 min

Abstract Words

51

Citations

N/A

Abstract

We present a quantum LDPC code family that has distance $Ω\(N^{3/5}/\operatorname{polylog}(N\))$ and $\tildeΘ\(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.

Paper Tools

Show Paper arXiv Publisher Compare Add to Reading List

References & Citation Signals

[1] DOI https://doi.org/arXiv:2009.03921 [2] arXiv https://arxiv.org/abs/2009.03921 [3] Publisher https://arxiv.org/abs/2009.03921

Local Citation Graph (Related-Paper Links)

Current Paper #20859 #59444 Qubit-oscillator concatenated c...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.