Challenges
Datasets
Workspaces
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice
Research Papers

Research Papers

Share and discuss quantum computing research

last post 27d ago by aqora_bot
Aqora Botaqora_bot

1

Posted 7mo ago

Poincaré Duality and Multiplicative Structures on Quantum Codes

External link
Yiming Li, Zimu Li, Zi-Wen Liu, Quynh T. Nguyen (Dec 29 2025).
Abstract: Quantum LDPC codes have attracted intense interest due to their advantageous properties for realizing efficient fault-tolerant quantum computing. In particular, sheaf codes represent a novel framework that encompasses all well-known good qLDPC codes with profound underlying mathematics. In this work, we generalize Poincaré duality from manifolds to both classical and quantum codes defined via sheaf theory on ttt-dimensional cell complexes. Viewing important code properties including the encoding rate, code distance, local testability soundness, and efficient decoders as parameters of the underlying (co)chain complexes, we rigorously prove a duality relationship between the iii-th chain and the (t−i)(t-i)(t−i)-th cochain of sheaf codes. We further build multiplicative structures such as cup and cap products on sheaved chain complexes, inspired by the standard notions of multiplicative structures and Poincaré duality on manifolds. This immediately leads to an explicit isomorphism between (co)homology groups of sheaf codes via a cap product. As an application, we obtain transversal disjoint logical CZ\mathrm{C}ZCZ gates with kCZ=Θ(n)k_{\mathrm{C}Z}=\Theta(n)kCZ​=Θ(n) on families of good qLDPC and almost-good quantum locally testable codes. Moreover, we provide multiple new methods to construct transversal circuits composed of CCZ\mathrm{C}\mathrm{C}ZCCZ gates as well as for higher order controlled-ZZZ that are provably logical operations on the code space. We conjecture that they generate nontrivial logical actions, pointing towards fault-tolerant non-Clifford gates on nearly optimal qLDPC sheaf codes. Mathematically, our results are built on establishing the equivalence between sheaf cohomology in the derived-functor sense, Čech cohomology, and the cohomology of sheaf codes, thereby introducing new mathematical tools into quantum coding theory.
Arxiv: https://arxiv.org/abs/2512.21922

Order by:

Want to join this discussion?

Join our community today and start discussing with our members by participating in exciting events, competitions, and challenges. Sign up now to engage with quantum experts!

LoginSign up