Skip to content
DraconiticResearch
Search Sources API
201,683 studies31 sourcesUpdated 43 min ago
PreprintarXiv licencearXiv

Cups and Gates II: Operads, twists, and addressable intra-code 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 Ck−1Z 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 ℤ/2 to ℤ/2k, enabling all diagonal logical gates such as single-qubit rotations R(2π/2k). 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∞-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.

Related

  1. Parallelizable and addressable transversal non-Clifford gates on good quantum LDPC codes
    Yiming Li, Zimu Li, Zhengyi Han +1
    arXivPreprintarXiv licenceFull textMathematical physicsQuantum physics & quantum informationarXiv
  2. Substantially Improved Rate and Distance for Addressable Transversal Phase Gates
    Bujiao Wu, Tongyin Lin, Bin Cheng
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryQuantum physics & quantum informationarXiv
  3. Tropical Circuits with Scalar Multiplication Gates
    Christoph Hertrich, Moritz Stargalla
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. Asymptotically good binary triorthogonal codes and higher-level transversal gates
    Rodrigo San-José
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
  5. Time Optimal Synthesis of Gates for Markovian Open Qudits
    Killian Lutz, Yannick Privat
    HALPreprintCC BY-ND 4.0Full textOptimisation & controlHAL
BibTeX
@misc{breuckmann2026cups,
  title = {{Cups and Gates II: Operads, twists, and addressable intra-code gates}},
  author = {Nikolas P. Breuckmann and Margarita Davydova and Jens Niklas Eberhardt and Lucas Ferdinand Hallwirth and Nathanan Tantivasadakarn},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.05214},
  eprint = {2610.05214},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.05214},
}
RIS
TY  - UNPB
TI  - Cups and Gates II: Operads, twists, and addressable intra-code gates
AU  - Nikolas P. Breuckmann
AU  - Margarita Davydova
AU  - Jens Niklas Eberhardt
AU  - Lucas Ferdinand Hallwirth
AU  - Nathanan Tantivasadakarn
PY  - 2026
DA  - 2026/10/04
PB  - arXiv
DO  - 10.48550/arxiv.2610.05214
UR  - https://arxiv.org/abs/2610.05214
AB  - 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−1Z 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 ℤ/2 to ℤ/2^k, enabling all diagonal logical gates such as single-qubit rotations R(2π/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_∞-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.
ER  -