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.

Clifford gates with logical transversality for self-dual CSS codes

External link
Theerapat Tansuwannont, Yugo Takada, Keisuke Fujii (Mar 26 2025).
Abstract: Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers as they use physical qubits more efficiently than codes of the same distance that encode only a few logical qubits. Some logical gate of a high-rate code can be fault-tolerantly implemented using transversal physical gates, but its logical operation may depend on the choice of a symplectic basis that defines logical Pauli operators of the code. In this work, we focus on [ ⁣[n,k,d] ⁣][\![n,k,d]\!][[n,k,d]] self-dual Calderbank-Shor-Steane (CSS) codes with k≥1k \geq 1k≥1 and prove necessary and sufficient conditions for the code to have a symplectic basis such that (1) transversal logical Hadamard gates ⨂j=1kHˉj\bigotimes_{j=1}^{k} \bar{H}_j⨂j=1k​Hˉj​ can be implemented by transversal physical Hadamard gates ⨂i=1nHi\bigotimes_{i=1}^{n} H_i⨂i=1n​Hi​, and (2) for any (a1,…,ak)∈{−1,1}k(a_1,\dots,a_k)\in\{-1,1\}^k(a1​,…,ak​)∈{−1,1}k, transversal logical phase gates ⨂j=1kSˉjaj\bigotimes_{j=1}^{k} \bar{S}_j^{a_j}⨂j=1k​Sˉjaj​​ can be implemented by transversal physical phase gates ⨂i=1nSibi\bigotimes_{i=1}^{n} S_i^{b_i}⨂i=1n​Sibi​​ for some (b1,…,bn)∈{−1,1}n(b_1,\dots,b_n)\in\{-1,1\}^n(b1​,…,bn​)∈{−1,1}n. Self-dual CSS codes satisfying the conditions include any codes with odd nnn. We also generalize the idea to concatenated self-dual CSS codes and show that certain logical Clifford gates have multiple transversal implementations, each by logical gates at a different level of concatenation. Several applications of our results for fault-tolerant quantum computation with low overhead are also provided.
Arxiv: https://arxiv.org/abs/2503.19790

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