Metraipolis › archive › dc_15d551d3c433

An Exactness Barrier for ZX-Calculus Optimization of Synthesized Clifford+T Circuits — arXiv:2608.22801

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.22801
License (as archived)
CC0-1.0
Archived
2026-10-18T09:35:24.522Z
SHA-256 of the archived text
dd8902210d1bc244041f58dd1102e566c5b39c4bc5dd1876ed6c9e2173293002
Stable URL of this page
https://metraipolis.com/documento/dc_15d551d3c433

How to cite

An Exactness Barrier for ZX-Calculus Optimization of Synthesized Clifford+T Circuits — arXiv:2608.22801 — arXiv (en), https://arxiv.org/abs/2608.22801 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_15d551d3c433 (Metraipolis archive dc_15d551d3c433, sha256 dd8902210d1bc244041f58dd1102e566c5b39c4bc5dd1876ed6c9e2173293002)
BibTeX
@misc{dc15d551d3c433,
  title = {An Exactness Barrier for ZX-Calculus Optimization of Synthesized Clifford+T Circuits — arXiv:2608.22801},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.22801},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_15d551d3c433; sha256 dd8902210d1bc244041f58dd1102e566c5b39c4bc5dd1876ed6c9e2173293002},
  year = {2026}
}

Archived text

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

Gate synthesis and circuit optimization are usually studied separately, and evidence on their interaction is contradictory: ZX-calculus rewriting removes a stable fraction of Solovay-Kitaev circuits, yet almost nothing from number-theoretically synthesized circuits. We show both behaviours follow from a single bound. For any optimizer that preserves the implemented element exactly--including all sound ZX rewriting with extraction--the achievable T-count is bounded below by the denominator exponent of the synthesized ring element. This exactness barrier is computable per instance and separates exact post-processing from approximation-aware resynthesis by a certified factor reaching 101x at recursion depth five. The two behaviours are then the barrier operating at different distances from the floor. For Solovay-Kitaev circuits we prove that the local ZX simplification layer (spider fusion and identity removal) computes exactly the free-product normal form of Z_2 * Z_8, giving exact per-instance compression and, under a calibrated ergodicity hypothesis, a depth-independent limit law confirmed on two independently constructed nets. For number-theoretically synthesized circuits the floor is already saturated: on single-qubit words automated ZX simplification attains it exactly, via a closed-form formula for minimal T-count in terms of phase linkage through the Z-axis normalizer. At two qubits and beyond the same valuation yields unconditional rigidity certificates, which on the quantum-Shannon-decomposition plus gridsynth pipeline certify 99.4-99.9% of the synthesized T-count as incompressible, with rigidity strengthening as accuracy tightens. This explains, and predicts the size of, the near-null optimization recently reported for that pipeline.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-25 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.22801 — 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-18T09:27:54.399Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).