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

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.

Quantum Physics (quant-ph); Information Theory (cs.IT)

arXiv:2601.22489 [quant-ph]

(or arXiv:2601.22489v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2601.22489 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.