arXiv:2611.23762v1 Announce Type: cross Abstract: Assuming uniform subfield product expansion, we construct quantum low-density parity-check (qLDPC) codes with distances $\Omega_\epsilon(N/\log^2N)$ and at least $N^{1-\epsilon}$ individually addressable logical CCZ gates on pairwise disjoint triples of logical qubits, for every fixed $0<\epsilon<1$. With all logical qubits outside these triples initialized to $|0\rangle$, any subset of the corresponding logical CCZ gates can be implemented with a transversal physical CCZ circuit. As applications, we obtain two nearly optimal magic state protocols: CCZ distillation with arbitrarily small overhead exponent $\gamma \rightarrow 0$ and error suppression of nearly linear order, and a magic state fountain that directly prepares $N^{1-\epsilon}$ encoded CCZ magic states with nearly linear distance $\Omega_\epsilon(N/\log^2N)$. The construction uses balanced products of expanding graph covers. The assumption concerns Reed--Solomon codes on three subfields of characteristic two and pairwise coprime extension degrees, a local hypothesis studied in a companion manuscript. We design the expanding graph covers to admit many common classical codewords, which yield logical operators whose pairings select the logical CCZ gates independently. Without the product expansion assumption, the graph covers also yield classical LDPC codes over a fixed field with almost linear dimension and linear distance that satisfy a multiplication property: the coordinatewise product of any three codewords lies in a second LDPC code of linear distance.