All-size onset theorem for constant-rate qLDPC families
Establish an all-size onset theorem for a constant-rate quantum low-density-parity-check code family that characterizes the entropic rigidity depth r in terms of Tanner-graph expansion, bipartite qubit–check incidence-graph expansion, the stabilizer quotient, Pauli-composition spectra, and the growth of low-excess centralizer representatives, thereby determining when configurational entropy first changes the logical decoding decision.
References
For general constant-rate qLDPC families , we conjecture that $r$ is governed jointly by expansion of the Tanner graph, the bipartite qubit--check incidence graph, the stabilizer quotient, Pauli-composition spectra, and the growth of low-excess centralizer representatives, namely Pauli operators that commute with every stabilizer, considered modulo stabilizers. Expansion and systolic gaps may suppress such factorizations, whereas locally clustered low-weight centralizer classes may proliferate them. An all-size onset theorem for a constant-rate family remains open; balanced factorization provides a concrete, non-sampling diagnostic for testing this design principle.