🤖 AI Summary
This work addresses a central challenge in quantum error correction: implementing fault-tolerant non-Clifford logical gates on quantum low-density parity-check (LDPC) codes with near-optimal parameters. Leveraging tools from algebraic topology, the authors construct for the first time a family of homologically invariant transversal multi-controlled-Z gates—dubbed “cupcap gates”—whose existence arises from fundamental topological phenomena related to covering spaces and cup products. This construction uniquely combines quantum codes achieving near-optimal scaling (blocklength $N$, distance $\Theta(N)$, and dual distance $\tilde{\Theta}(N)$) with nontrivial fault-tolerant logical operations, thereby preserving excellent coding performance while enabling universal quantum computation.
📝 Abstract
We exhibit nontrivial transversal logical multi-controlled-$Z$ gates on $[\![N,Θ(N),\tildeΘ(N)]\!]$ quantum low-density parity-check codes and $[\![N,Θ(N),\tildeΘ(N)]\!]$ quantum locally testable codes with soundness $\tildeΘ(1)$, combining nearly optimal code parameters with fault-tolerant non-Clifford gates for the first time. Remarkably, our proofs are almost entirely algebraic-topological, showing that such presumably intricate logical gates naturally arise as a fundamental topological phenomenon. We develop a general framework for constructing a rich new family of homological invariant forms which we call ''cupcap gates'' that induce transversal logical multi-controlled-$Z$ and, building on insights from [Li et al., arXiv:2603.25831], covering space methods to certify their nontriviality. The claimed almost-good code results follow immediately as examples.