Pair-Partition Constructions for CPM-Based Quantum LDPC Codes

Abstract:We introduce the pair-partition (PP) construction of binary Calderbank--Shor--Steane quantum low-density parity-check codes from circulant permutation matrices. A square array of pair partitions imposes linear paired-difference equations on the CPM exponents and thereby guarantees CSS orthogonality. Pairing graphs derived from this array allow the combinatorial design to be screened before exponent search. We further give and prove a complete algorithm for verifying lower bounds on the quantum minimum distance of a fixed CSS lift. The algorithm searches for zero-syndrome vectors outside the opposing stabilizer row space, uses only rigorously valid pruning rules, and finds no vector through a prescribed weight if and only if the corresponding distance exceeds that weight. For fixed column weight, row weight, and search limit, cyclic symmetry makes the combinatorial support-enumeration bound independent of the lift size, although matrix preprocessing and row-space tests can still depend on the lift size. Thus the construction stage and the distance-verification stage are both specified by directly checkable finite procedures.

arXiv:2607.14091 [quant-ph]

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

https://doi.org/10.48550/arXiv.2607.14091 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.