Disassembling qLDPC codes for depth-optimal parity-check circuits
The work introduces a method to design low-depth parity-check circuits for CSS quantum LDPC codes by exploiting hidden symmetries in their construction. By quotienting these symmetries, the complex scheduling problem is reduced to a simpler graph. This strategy yields analytically optimal circuit depths for Lifted-Product codes and numerically optimal results for Quantum Tanner codes.