Metraipolis › archive › dc_680cf3bcbab0

Local Automorphism-Aware Syndrome Compilation for General Quantum LDPC Codes — arXiv:2609.40319

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.40319
License (as archived)
CC0-1.0
Archived
2026-10-07T14:40:53.336Z
SHA-256 of the archived text
ad1e4eba823f6c61baee7a6a0b0a487b681fc3d9c7e626c2e3ab6b4304226d34
Stable URL of this page
https://metraipolis.com/documento/dc_680cf3bcbab0

How to cite

Local Automorphism-Aware Syndrome Compilation for General Quantum LDPC Codes — arXiv:2609.40319 — arXiv (en), https://arxiv.org/abs/2609.40319 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_680cf3bcbab0 (Metraipolis archive dc_680cf3bcbab0, sha256 ad1e4eba823f6c61baee7a6a0b0a487b681fc3d9c7e626c2e3ab6b4304226d34)
BibTeX
@misc{dc680cf3bcbab0,
  title = {Local Automorphism-Aware Syndrome Compilation for General Quantum LDPC Codes — arXiv:2609.40319},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.40319},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_680cf3bcbab0; sha256 ad1e4eba823f6c61baee7a6a0b0a487b681fc3d9c7e626c2e3ab6b4304226d34},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.40319. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Low-depth syndrome extraction for Calderbank-Shor-Steane (CSS) quantum low-density parity-check codes can be formulated as a proper ordered edge-coloring problem subject to quantum parity constraints. A proper edge-coloring of the CSS Tanner graph ensures that each data or ancilla qubit participates in at most one two-qubit gate per layer, but does not guarantee a valid interleaving of the X- and Z-check measurements as for every overlapping X/Z check pair, the number of shared data qubits on which the X interaction precedes the Z interaction must be even. The minimum number of colors in a proper ordered edge-coloring satisfying the quantum parity constraints equals the minimum two-qubit depth when each stabilizer check is measured with a single ancilla. We introduce local automorphism-aware syndrome compilation (LocalASC), which reduces the constraint system to edge-orbit variables under a subgroup of the Tanner graph automorphisms and lifts each feasible orbit assignment to the full graph. Although the $6$-layer degree lower bound is unattainable for the published weight-$6$ IBM bivariate bicycle codes, we show that this is not universal among two-block CSS codes. Among code instances for which the maximum check weight equals the maximum Tanner graph degree, LocalASC finds depth-optimal syndrome-extraction schedules for several two-block CSS codes with odd component weights, including instances with unequal odd weights. We also obtain lower-bound-saturating syndrome-extraction schedules for several quantum Tanner codes satisfying the same degree condition. To obtain the subgroups used by LocalASC without computing the full automorphism group of the Tanner graph, we construct translation subgroups for two-block group-algebra CSS codes over abelian groups. For quantum Tanner codes, we give conditions under which square-complex symmetries extend to Tanner graph automorphisms.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.IT).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.40319 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:14:20.812Z dalla pagina https://arxiv.org/catchup/math.IT/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).