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 last yr.

Transversal Gates in Nonadditive Quantum Codes

External link
Chao Zhang, Zipeng Wu, Shilin Huang, Bei Zeng (Apr 30 2025).
Abstract: Transversal gates play a crucial role in suppressing error propagation in fault-tolerant quantum computation, yet they are intrinsically constrained: any nontrivial code encoding a single logical qubit admits only a finite subgroup of SU(2)\mathrm{SU}(2)SU(2) as its transversal operations. We introduce a systematic framework for searching codes with specified transversal groups by parametrizing their logical subspaces on the Stiefel manifold and minimizing a composite loss that enforces both the Knill-Laflamme conditions and a target transversal-group structure. Applying this method, we uncover a new ((6,2,3))((6,2,3))((6,2,3)) code admitting a transversal Z(2π5)Z\bigl(\tfrac{2\pi}{5}\bigr)Z(52π​) gate (transversal group C10\mathrm{C}_{10}C10​), the smallest known distance 333 code supporting non-Clifford transversal gates, as well as several new ((7,2,3))((7,2,3))((7,2,3)) codes realizing the binary icosahedral group 2I2I2I. We further propose the \emphSubset-Sum-Linear-Programming (SS-LP) construction for codes with transversal \emphdiagonal gates, which dramatically shrinks the search space by reducing to integer partitions subject to linear constraints. In a more constrained form, the method also applies directly to the binary-dihedral groups BD2m\mathrm{BD}_{2m}BD2m​. Specializing to n=7n=7n=7, the SS-LP method yields codes for all BD2m\mathrm{BD}_{2m}BD2m​ with 2m≤362m\le 362m≤36, including the first ((7,2,3))((7,2,3))((7,2,3)) examples supporting transversal TTT gate (BD16\mathrm{BD}_{16}BD16​) and T\sqrt{T}T​ gate (BD32\mathrm{BD}_{32}BD32​), improving on the previous smallest examples ((11,2,3))((11,2,3))((11,2,3)) and ((19,2,3))((19,2,3))((19,2,3)). Extending the SS-LP approach to ((8,2,3))((8,2,3))((8,2,3)), we construct new codes for 2m>362m>362m>36, including one supporting a transversal T1/4T^{1/4}T1/4 gate (BD64\mathrm{BD}_{64}BD64​). These results reveal a far richer landscape of nonadditive codes than previously recognized and underscore a deeper connection between quantum error correction and the algebraic constraints on transversal gate groups.
Arxiv: https://arxiv.org/abs/2504.20847

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