Structural Conditions for Native CCZ Magic-State Fountains in qLDPC Codes

Abstract: Quantum low-density parity-check (qLDPC) codes promise constant-rate, linear-distance families with bounded-weight checks, and recent work has realized transversal or constant-depth non-Clifford gates on various (often non-LDPC) codes. However, no explicit \emph{qubit} qLDPC family is known that simultaneously has constant rate, linear distance, bounded stabilizer weight, and a native \emph{magic-state fountain} that prepares many non-Clifford resource states in constant depth. We take a structural approach and identify coding-theoretic conditions under which a CSS qLDPC family necessarily supports a constant-depth $\CCZ$ magic-state fountain. The key ingredients are: (i) an algebraic notion of \emph{magic-friendly triples} of $X$-type logical operators, defined by pairwise orthogonality and a triple-overlap form controlling diagonal $\CCZ$ phases, and (ii) a 3-uniform hypergraph model of physical $\CCZ$ circuits combined with a packing lemma that turns large collections of such triples with bounded overlaps into bounded-degree hypergraphs. Our main theorem shows that if a CSS code family on $n$ qubits admits $Ω(n^{1+γ})$ magic-friendly triples whose supports have bounded per-qubit participation, then there exists a constant-depth circuit of physical $\CCZ$ gates implementing $Ω(n^γ)$ logical $\CCZ$ gates in parallel while preserving distance up to a constant factor. For asymptotically good qLDPC families such as quantum Tanner codes, this reduces the existence of a native $\CCZ$ magic-state fountain to a concrete combinatorial problem about counting and distributing magic-friendly triples in the logical $X$ space.

• The paper presents a reduction that characterizes when a CSS qLDPC code family supports constant-depth native CCZ magic-state fountains via magic-friendly triples.
• The paper employs a hypergraph model and a combinatorial packing lemma to demonstrate that O(n^γ) logical CCZ gates can be applied in parallel while preserving code distance.
• The paper implies that achieving these structural conditions could lead to scalable quantum architectures with constant rate, linear distance, and native non-Clifford gate implementations.

Structural Conditions for Native CCZ Magic-State Fountains in qLDPC Codes

Motivation and Context

The capability to implement non-Clifford gates, such as the $CCZ$, in a constant-depth, native manner within quantum LDPC (qLDPC) code families is central to reducing the overhead of universal fault-tolerant quantum computation. Surface and color codes, while foundational, are limited by high-cost magic-state distillation protocols required for non-Clifford operations. Asymptotically good qLDPC codes—characterized by constant rate, linear distance, and bounded-weight stabilizers—offer a scalable alternative, but demonstrations of native, parallelizable non-Clifford resources have largely been limited to non-LDPC or hybrid constructions, or to codes where at least one of the performance metrics is relaxed.

The work "Structural Conditions for Native CCZ Magic-State Fountains in qLDPC Codes" (2601.22489) addresses this bottleneck through a structural and combinatorial reduction: it specifies when a CSS qLDPC code family supports a native, constant-depth $CCZ$ magic-state fountain, circumventing the need for explicit code constructions. The framework generalizes earlier approaches based on triorthogonality and divisibility by focusing directly on the distribution of logical $X$-type operators.

Definitions and Algebraic Conditions

The central object is the magic-friendly triple $(x,y,z)$: three linearly independent logical $X$ operators that are pairwise orthogonal and have an odd triple overlap, i.e.

• $x, y, z \in C_Z^\perp$ represent independent coset representatives in the $X$-logical space $\mathcal{L}_X$,
• Pairwise inner products vanish modulo 2: $x \cdot y = x \cdot z = y \cdot z = 0$,
• The triple-overlap form $\tau(x,y,z) = \sum_{i=1}^n x_i y_i z_i$ is odd.

These algebraic constraints ensure that acting with a transversal $CCZ$ gate across corresponding physical qubit triples imparts a logical $CCZ$ up to Clifford frame corrections. This characterization both distills the action of physical diagonal gates to a clean algebraic origin and links the existence of parallelizable non-Clifford gates to the richness of magic-friendly packings in logical space.

Hypergraph Model and Packing Lemma

Implementation of many $CCZ$ gates in parallel is mapped to the problem of coloring a 3-uniform hypergraph with bounded degree: each magic-friendly triple corresponds to a set of physical qubit triples over which a $CCZ$ is applied, and bounded per-qubit participation limits the degree.

A combinatorial packing lemma establishes that, given $\Omega(n^{1+\gamma})$ magic-friendly triples with each physical qubit contained in at most $M = O(1)$ triples, one can select a subset of $\Omega(n^\gamma)$ disjoint triples. Edge coloring of the corresponding hypergraph ensures that all associated physical $CCZ$ gates can be scheduled in constant depth, each layer acting on disjoint sets of qubits.

Main Structural Theorem

The principal result provides a reduction from code construction to a concrete combinatorial problem:

If a CSS code family on $n$ qubits admits $\Omega(n^{1+\gamma})$ magic-friendly triples whose supports have bounded per-qubit participation, then one can implement $\Omega(n^\gamma)$ logical $CCZ$ gates in parallel via a constant-depth circuit of physical $CCZ$ gates, with code distance preserved up to a constant factor.

For instance, if a qLDPC family realizes $\Omega(n^2)$ such triples, native implementation of $\Omega(n)$ logical $CCZ$ magic states per round is achievable—precisely the "magic-state fountain" regime required for scaling.

This result reduces the question of whether an explicit, good qLDPC family supports a constant-rate, constant-depth $CCZ$ fountain to a question about the combinatorics of its logical operator space. Notably, no existing explicit family is shown to realize both linear distance and the necessary abundance/packing of magic-friendly triples, making this an open problem now precise in its quantifiable form.

Practical and Theoretical Implications

• Generality: The combinatorial criterion is agnostic to the details of the qLDPC construction, isolating an operator-theoretic property that unifies triorthogonal, divisible, and product-code approaches.
• Distance Preservation: By carefully bounding propagation via constant-depth local circuits, the work guarantees that the effective code distance degrades by at most a constant, maintaining fault-tolerance.
• Reduction to Expansion: The problem can be reframed for families such as quantum Tanner codes in terms of high-dimensional expander combinatorics of logical operators; expansion should intuitively yield well-distributed supports, but translating this intuition to actual counts and packings of magic-friendly triples remains nontrivial.

Numerical Regime and Contrasts with Prior Work

Most prior explicit non-Clifford gate constructions in quantum codes fall short of this structural optimum:

• Constructions with transversal $CCZ$ gates often relax the LDPC constraint or only achieve sublinear distance [golowich2024asymptotically, he2025asymptotically].
• qLDPC codes with product or sheaf-theoretical architectures realize constant-rate and small overhead but only sublinear-size magic-state fountains or relax distance scaling [golowich2024quantum, lin2024transversal].
• Homological product codes achieve $\Theta(\sqrt{N})$-sized $CCZ$ fountains, not linear throughput [zhu2025topological].

Thus, the result provides the first framework by which any asymptotically good qLDPC code family may be shown to support a magic-state fountain, contingent only on a concrete combinatorial property.

Outlook and Open Problems

The primary technical challenge is the explicit construction or certification of qLDPC code families, such as quantum Tanner codes, with a provably large set of magic-friendly logical $X$ triples admitted by the bounds above. The realization of such codes would yield quantum memory architectures with constant overhead, constant rate, linear distance, and native, high-throughput, parallelizable non-Clifford resources—all with bounded-weight stabilizer checks.

This work also points toward extensions in higher-controlled diagonal circuits and related resource state factories, and suggests that further algebraic and combinatorial tools (from high-dimensional expanders, matroid theory, or topological invariants) may be necessary to bridge the gap between potential and construction.

Conclusion

The structural reduction in this work isolates the magic-state fountain problem for qLDPC codes to a precise combinatorial property of logical operator space. It characterizes which families support native, scalable, parallelizable $CCZ$ resource state generation in constant depth, reframing the challenge as an open combinatorial and algebraic question. The resulting theory supplies both a guide and constraint for the design of future quantum codes and architectures aimed at scalable, universal, fault-tolerant quantum computation (2601.22489).