Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes
Louis Golowich, Ting-Chun Lin

TL;DR
This paper introduces explicit quantum LDPC codes supporting transversal non-Clifford gates with high rate and distance, constructed via products of classical LDPC codes and spectral expanders, enabling efficient magic state distillation.
Contribution
It provides the first known quantum LDPC codes with low-weight stabilizers capable of magic state distillation at arbitrary yield parameters, surpassing previous color code limitations.
Findings
Supports transversal $C^{r-1}Z$ gates with high rate and distance
Constructs classical locally testable codes with multiplication property
Uses product of chain complexes from classical LDPC codes
Abstract
For every integer and every , we construct an explicit infinite family of quantum LDPC codes supporting a transversal gate with length , dimension , distance , and stabilizer weight . The previous state of the art construction (in most parameter regimes) was the -dimensional color code, which has only constant dimension , and otherwise has the same parameters up to polylogarithmic factors. Our construction provides the first known codes with low-weight stabilizers that are capable of magic state distillation with arbitrarily small yield parameter . A classical analogue of transversal gates is given by the multiplication property, which requires component-wise products of classical codewords to belong to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata
