Local Automorphism-Aware Syndrome Compilation for General Quantum LDPC Codes
This work addresses finding low-depth syndrome extraction schedules for quantum LDPC codes by formulating it as a constrained edge-coloring problem. The authors introduce Local Automorphism-Aware Syndrome Compilation (LocalASC), a method that simplifies complex constraints using graph automorphisms. This approach successfully finds depth-optimal schedules for several code types, proving that the theoretical minimum depth is achievable in specific cases.