Metraipolis › archive › dc_60965cdf3b07

Synthesis of Compact and Expressive Quantum-Circuit Optimizations — arXiv:2609.01762

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.01762
License (as archived)
CC0-1.0
Archived
2026-10-17T05:57:45.558Z
SHA-256 of the archived text
fd1ac205d8e183e4098da631b86f90c4b07dcf31676f15b30bfbe927803b4748
Stable URL of this page
https://metraipolis.com/documento/dc_60965cdf3b07

How to cite

Synthesis of Compact and Expressive Quantum-Circuit Optimizations — arXiv:2609.01762 — arXiv (en), https://arxiv.org/abs/2609.01762 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_60965cdf3b07 (Metraipolis archive dc_60965cdf3b07, sha256 fd1ac205d8e183e4098da631b86f90c4b07dcf31676f15b30bfbe927803b4748)
BibTeX
@misc{dc60965cdf3b07,
  title = {Synthesis of Compact and Expressive Quantum-Circuit Optimizations — arXiv:2609.01762},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.01762},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_60965cdf3b07; sha256 fd1ac205d8e183e4098da631b86f90c4b07dcf31676f15b30bfbe927803b4748},
  year = {2026}
}

Archived text

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

Today's quantum devices are noisy, so reducing circuit size is critical for reliable execution. Existing rule-based optimizers often rely on large rule sets that are difficult to manage and still miss long-distance transformations. We present QSymb, a framework for synthesizing compact and expressive quantum-circuit rewrite rules with formal guarantees. We formalize symbolic rewrite rules in which a symbolic gate represents infinitely many subcircuits. We then define canonical symbolic rules of the form $L;S = S;R$ and prove that they constitute a compact generative core from which general symbolic rules can be derived. On top of this formal foundation, given a gate set, QSymb synthesizes (1) a small, non-derivable concrete rule set that is complete up to chosen size and qubit bounds, and (2) a small but expressive canonical symbolic rule set that captures transformations beyond finite or monomial-only patterns. We further present rule anchoring to derive optimization-effective rules from canonical symbolic rules. Together, these results provide both expressiveness and guarantees: soundness of synthesized rules via validation, non-derivability, and bounded completeness. On the IBM-Eagle gate set, QSymb strictly outperforms state-of-the-art rewrite-based optimizers (Qiskit, Guoq, Quartz, TKET, and Queso) in two-qubit-gate reduction on 90%, 67%, 82%, 85%, and 83% of standard quantum algorithm benchmarks, respectively; on Nam gate set, the corresponding rates are 88%, 74%, 81%, 86%, and 82.9%. It achieves final average two-qubit-gate reductions of 27.44% and 29.95%, respectively.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-03 in cs.PL).
Categorie arXiv: Programming Languages (cs.PL).
Pagina del lavoro: https://arxiv.org/abs/2609.01762 — 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-17T05:50:16.191Z dalla pagina https://arxiv.org/catchup/cs.PL/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).