Fiber bundle codes: breaking the n 1/2 polylog( n ) barrier for Quantum LDPC codes

DOI10.1145/3406325.3451005arXiv2009.03921OpenAlexW3089458228MaRDI QIDQ6065251

Matthew B. Hastings, Ryan O'Donnell, Jeongwan Haah

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.03921

zbMATH Keywords

fiber bundleexpandersquantum LDPC codeshomological product

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

A construction of combinatorial NLTS ⋮ A linear-algebraic and lattice-theoretical look at the Cleaning Lemma of quantum coding theory ⋮ Single-shot decoding of good quantum LDPC codes ⋮ Homological quantum rotor codes: logical qubits from torsion

This page was built for publication: Fiber bundle codes: breaking the n ^1/2 polylog( n ) barrier for Quantum LDPC codes