aiqbench analysis
This research extends the mathematical framework for constructing logical gates in quantum error-correcting codes by incorporating twists, automorphisms, and higher cohomology operations. The work enables the implementation of addressable diagonal gates, such as specific single-qubit rotations and $T$ gates, within both topological and qLDPC code architectures. By leveraging new operadic structures from homotopy theory, the study provides a pathway to realizing fault-tolerant quantum logic with greater flexibility than previous methods.
Cups and Gates II: Operads, twists, and addressable intra-code gates
arXiv:2610.05214v1 Announce Type: new Abstract: In Part I, we introduced a general framework for constructing logical gates in quantum CSS codes from cohomology invariants, focusing on cup products and their generalizations from topological to qLDPC codes. In particular, we produced a family of $C^{k-1}Z$ logical gates that we called copy-cup on $k$ copies of the same quantum code implemented by finite-depth circuits. Here, we vastly extend this framework by introducing twists incorporating code automorphisms, higher twisted cohomology operations, and folding operations in relative cohomology. The framework includes operations lifting coefficients from $\mathbb{Z}/2$ to $\mathbb{Z}/2^k$, enabling all diagonal logical gates such as single-qubit rotations $\operatorname{R}(2\pi/2^k)$. Composing these operations with maps that select cohomology classes yields addressable logical gates. Examples include addressable $T$ gates on three- and four-tori and gates in qLDPC codes beyond topological ones. We introduce cohomology operations, such as the higher twisted Pontryagin powers, that to our knowledge have not previously appeared in the mathematics literature. These operations arise from $E_\infty$-structures on cochains, with explicit constructions using cyclic resolutions and the surjection operad. We expect these results to be of independent interest in homotopy theory. Our formalism applies much more broadly to chain complexes carrying suitable operadic structures, and we expect this operadic perspective to uncover further connections between homotopy theory and fault-tolerant quantum gates.
Abstract:In Part I, we introduced a general framework for constructing logical gates in quantum CSS codes from cohomology invariants, focusing on cup products and their generalizations from topological to qLDPC codes. In particular, we produced a family of $C^{k-1}Z$ logical gates that we called copy-cup on $k$ copies of the same quantum code implemented by finite-depth circuits. Here, we vastly extend this framework by introducing twists incorporating code automorphisms, higher twisted cohomology operations, and folding operations in relative cohomology. The framework includes operations lifting coefficients from $\mathbb{Z}/2$ to $\mathbb{Z}/2^k$, enabling all diagonal logical gates such as single-qubit rotations $\operatorname{R}(2\pi/2^k)$. Composing these operations with maps that select cohomology classes yields addressable logical gates. Examples include addressable $T$ gates on three- and four-tori and gates in qLDPC codes beyond topological ones. We introduce cohomology operations, such as the higher twisted Pontryagin powers, that to our knowledge have not previously appeared in the mathematics literature. These operations arise from $E_\infty$-structures on cochains, with explicit constructions using cyclic resolutions and the surjection operad. We expect these results to be of independent interest in homotopy theory. Our formalism applies much more broadly to chain complexes carrying suitable operadic structures, and we expect this operadic perspective to uncover further connections between homotopy theory and fault-tolerant quantum gates.
Quantum Physics (quant-ph); Strongly Correlated Electrons (cond-mat.str-el); Mathematical Physics (math-ph); Algebraic Topology (math.AT)
arXiv:2610.05214 [quant-ph]
(or arXiv:2610.05214v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.05214 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 315 words
Related coverage
Computing with qLDPC Codes by Climbing the Chain Map Hierarchy
arXiv · Sep 4, 2026

Closing the GPU Cluster Validation Gap: A Kubernetes-Native Approach with CVF
AMD · Jul 29, 2026
Improved Transversal Non-Clifford Gates from Cup Products
arXiv · Sep 24, 2026

Researchers Achieve Fast Quantum Error Correction with New Logical Gates
Quantum Zeitgeist · Jun 16, 2026