Abstract: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 analytical bounds and code searches, we demonstrate that reconciling parallel non-Clifford operations with linear distance requires navigating these fundamental structural trade-offs.
From: Mohammad Rowshan [view email]
[v1]
Fri, 30 Jan 2026 02:59:06 UTC (27 KB)
[v2]
Mon, 3 Aug 2026 13:05:46 UTC (30 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。