Sipser-Spielman meets Dijkgraaf-Witten: non-Abelian qLDPC codes via twisted sheaf gauge theory and almost-constant-overhead magic state fountain
Abstract
Sipser-Spielman codes and Dijkgraaf-Witten twisted gauge theories are among the most profound ideas in the last few decades in the areas of computer science and mathematical physics respectively. This work unifies them in the same framework using the language of sheaf cohomology, and produces a new framework of twisted sheaf guage theories describing a class of quantum low-density parity-check (qLDPC) codes with non-Abelian $D_4$ topological order. The corresponding twisted qLDPC code can be obt...
Description / Details
Sipser-Spielman codes and Dijkgraaf-Witten twisted gauge theories are among the most profound ideas in the last few decades in the areas of computer science and mathematical physics respectively. This work unifies them in the same framework using the language of sheaf cohomology, and produces a new framework of twisted sheaf guage theories describing a class of quantum low-density parity-check (qLDPC) codes with non-Abelian topological order. The corresponding twisted qLDPC code can be obtained from gauging a new type of 0-form sub-complex symmetry from a qLDPC code defined on a sheaf complex, and can be interpreted as a topological defect network of non-Abelain patches glued together with proper gapped interfaces. As an application, one can use this to realize a \textit{magic state fountain} via the gauging measurement of the addressable logical CZ gates as 0-form subcomplex symmetries in a 2D hypergraph-product on a sheaf complex. This includes a scheme of subdividing an arbitrary constant-rate 2D hypergraph-product code with parameter into a quantum sheaf code which allows preparation of in parallel, equivalent to the recent geometric construction using the code-to-manifold mapping in (arXiv:2601.06736). Moreover, using the recent sheaf complex and algebraic code constructions by Golowich-Tamo-Zhu (arXiv:2609.27801) with parameter for arbitrary small , one can prepare CZ magic states in parallel and hence achieve an almost-constant magic rate.
Source: arXiv:2609.31541v1 - http://arxiv.org/abs/2609.31541v1 PDF: https://arxiv.org/pdf/2609.31541v1 Original Link: http://arxiv.org/abs/2609.31541v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Sep 28, 2026
Quantum Computing
Quantum Physics
0