Native Non-Clifford Gates in Quantum LDPC Codes: Conditions, Synthesis, and Scaling Limits

Mohammad Rowshan · 2026 · arXiv 2026

| 编号 QE155 | 主题 qLDPC 码 | 链接 arXiv:2601.22489 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

Native constant-depth non-Clifford gates on quantum low-density parity-check (qLDPC) codes can substantially reduce the space-time overhead of magic-state distillation. This paper investigates the underlying parity and structural conditions governing parallel non-Clifford gate implementations. By analyzing their invariance, algebraic forms, and circuit synthesis, we establish fundamental limits on code scaling: strict saturated implementations cannot achieve constant-depth realization as code distance grows due to tight distance-depth bounds. We evaluate alternative scaling routes, showing that scalable designs must either relax strict subspace requirements or manage gate congestion. Through

本站词条在引用该文献时，会以 wikilink（sources/QE155）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。