Quantum LDPC codes with transversal non-Clifford gates: optimal parameters and existence

Determine the optimal parameters of quantum LDPC codes that support a transversally implementable non-Clifford gate, and ascertain whether asymptotically good quantum LDPC codes exist that support a transversally implementable non-Clifford gate.

Background

Quantum LDPC codes with asymptotically good parameters were only recently constructed, and the interaction between LDPC structure and transversal non-Clifford gates is largely unexplored.

Establishing optimal trade-offs and proving existence (or non-existence) of asymptotically good LDPC codes with transversal non-Clifford gates would significantly impact fault-tolerant quantum computing architectures.

References

Open Question 2: What are the optimal parameters of a quantum LDPC code supporting a transversally implementable non-Clifford gate? Does an asymptotically good quantum LDPC code supporting a transversally implementable non-Clifford gate exist?

— Constant-Overhead Magic State Distillation  (2408.07764 - Wills et al., 2024) in Section 1, Discussion and Future Directions

More immediate mathematical questions include whether full-code-space long-range magic can be achieved with strictly linear distance and whether quantitative robustness guarantees can be established under approximate preparation and noise.

— Non-Abelian sheaf quantum LDPC codes: good and magical  (2609.30159 - Li et al., 24 Sep 2026) in Section 5, Discussion

Indeed, constructing LDPC auxiliary codes that transversally realize the logical transversal $$ is an open problem.

— Realizing Logical Diagonal Gates via Transversal Physical $Z$-Rotations in CSS Codes  (2608.19094 - Reddy et al., 19 Aug 2026) in Final paragraph of Section “CSS families realizing any addressable logical [Z-rotation] gate”

The main open intersection is an asymptotically good Pauli-LDPC family with fully addressable transversal non-Clifford one-qubit gates. Even constant rate with sublinear growing distance remains unachieved here for the fully addressable $T$ interface and ordinary Pauli checks.

— Constant Rate Codes with Fully Addressable Transversal T: Good Codes, Sparse Checks  (2609.38996 - Meiburg, 30 Sep 2026) in Section 6, Future Work

Can a Pauli-LDPC family carry all logical $T$ phases in one common bounded-participation set of physical $T$, controlled-$S$, and CCZ terms? Expressing their phases through parity ancillas using eq:controlled suggests a route to transversal $T$ powers; the challenge is to keep one common sparse presentation for all logical targets.

— Constant Rate Codes with Fully Addressable Transversal T: Good Codes, Sparse Checks  (2609.38996 - Meiburg, 30 Sep 2026) in Section 6, Future Work