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 9mo ago

Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic

External link
Ryohei Kobayashi, Guanyu Zhu, Po-Shen Hsin (Nov 06 2025).
Abstract: A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-König bound for nnn-dimensional topological stabilizer codes. In this work, we extend topological Pauli stabilizer codes to a broad class of nnn-dimensional Clifford hierarchy stabilizer codes. These codes correspond to the (n+1)(n+1)(n+1)D Dijkgraaf-Witten gauge theories with non-Abelian topological order. We construct transversal non-Clifford gates through automorphism symmetries represented by cup products. In 2D, we obtain the first transversal non-Clifford logical gates including T and CS for Clifford stabilizer codes, using the automorphism of the twisted Z23\mathbb{Z}_2^3Z23​ gauge theory (equivalent to D4\mathbb{D}_4D4​ topological order). We also combine it with the just-in-time decoder to fault-tolerantly prepare the logical T magic state in O(d)O(d)O(d) rounds via code switching. In 3D, we construct a transversal logical T\sqrt{\text{T}}T​ gate in a non-Clifford stabilizer code at the third level of the Clifford hierarchy, located on a tetrahedron corresponding to a twisted Z24\mathbb{Z}_2^4Z24​ gauge theory. Due to the potential single-shot code-switching properties of these codes, one could achieve the 4th level of Clifford hierarchy with an O(d3)O(d^3)O(d3) space-time overhead, avoiding the tradeoff observed in 2D. We propose a conjecture extending the Bravyi-König bound to Clifford hierarchy stabilizer codes, with our explicit constructions providing an upper bound of spatial dimension (N−1)(N-1)(N−1) for achieving the logical gates in the NthN^\text{th}Nth-level of Clifford hierarchy.
Arxiv: https://arxiv.org/abs/2511.02900

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