Skip to main content
Conference ProceedingsOPEN ACCESS

Fiber bundle codes: Breaking the n1/2polylog(n) barrier for Quantum LDPC codes

Proceedings of the Annual ACM Symposium on Theory of Computing (2021) 1276-1288
DOI: 10.1145/3406325.3451005
53Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a quantum LDPC code family that has distance ?(N3/5/polylog(N)) and (N3/5) logical qubits, where N is the code length. This is the first quantum LDPC code construction that achieves distance greater than N1/2 polylog(N). The construction is based on generalizing the homological product of codes to a fiber bundle.

Author supplied keywords

Cite

CITATION STYLE

APA

Hastings, M. B., Haah, J., & O’Donnell, R. (2021). Fiber bundle codes: Breaking the n1/2polylog(n) barrier for Quantum LDPC codes. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 1276–1288). Association for Computing Machinery. https://doi.org/10.1145/3406325.3451005

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free