Metraipolis › archive › dc_a7a034f1e7ac
A Dynamic Intermediate Representation for Hybrid Quantum-Classical Programs — arXiv:2609.01037
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.01037
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T07:20:11.029Z
- SHA-256 of the archived text
add7ee25d652275ea71dde39527c88cb4d818ef93fc30b233b2e2ab52e8c217a- Stable URL of this page
https://metraipolis.com/documento/dc_a7a034f1e7ac
How to cite
A Dynamic Intermediate Representation for Hybrid Quantum-Classical Programs — arXiv:2609.01037 — arXiv (en), https://arxiv.org/abs/2609.01037 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a7a034f1e7ac (Metraipolis archive dc_a7a034f1e7ac, sha256 add7ee25d652275ea71dde39527c88cb4d818ef93fc30b233b2e2ab52e8c217a)
BibTeX
@misc{dca7a034f1e7ac,
title = {A Dynamic Intermediate Representation for Hybrid Quantum-Classical Programs — arXiv:2609.01037},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.01037},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a7a034f1e7ac; sha256 add7ee25d652275ea71dde39527c88cb4d818ef93fc30b233b2e2ab52e8c217a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.01037. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Quantum compilers typically follow the circuit model, representing programs as fixed sequences of gates. This static view breaks down in hybrid quantum-classical applications, where gate choices depend on runtime data or measurement results. We introduce a new Intermediate Representation (IR) that elevates gates to first-class values, enabling their dynamic creation, composition, and control. This unified representation allows classical computation to steer quantum behaviour, capturing phenomena including stochastic gate selection, adaptive error correction, and measurement-driven computation within a single framework. Case studies in noise modelling, randomised compilation, error correction, and measurement-based quantum computing show that our IR expresses these programs compactly and supports optimisations that were not possible in the circuit model. Evaluation on a benchmark suite of hybrid quantum-classical programs indicates that our IR represents programs compactly and facilitates compiler analysis and transformation. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-02 in cs.PL). Categorie arXiv: Programming Languages (cs.PL) ; Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2609.01037 — 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-17T07:10:28.027Z dalla pagina https://arxiv.org/catchup/cs.PL/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).