Metraipolis › archive › dc_d237b0fe5377
SAQC: A SAT-Aware Compilation Framework for QAOA-Based Quantum Optimization — arXiv:2609.05737
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.05737
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T15:40:34.560Z
- SHA-256 of the archived text
2fd5624a73b09dfea8c92c297ee524d507724637503c9822634361e91d17df9d- Stable URL of this page
https://metraipolis.com/documento/dc_d237b0fe5377
How to cite
SAQC: A SAT-Aware Compilation Framework for QAOA-Based Quantum Optimization — arXiv:2609.05737 — arXiv (en), https://arxiv.org/abs/2609.05737 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d237b0fe5377 (Metraipolis archive dc_d237b0fe5377, sha256 2fd5624a73b09dfea8c92c297ee524d507724637503c9822634361e91d17df9d)
BibTeX
@misc{dcd237b0fe5377,
title = {SAQC: A SAT-Aware Compilation Framework for QAOA-Based Quantum Optimization — arXiv:2609.05737},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.05737},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d237b0fe5377; sha256 2fd5624a73b09dfea8c92c297ee524d507724637503c9822634361e91d17df9d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.05737. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Quantum Approximate Optimization Algorithm (QAOA) is a promising variational approach for solving Boolean satisfiability (SAT) problems. Existing SAT-to-QAOA workflows first translate Boolean formulas into penalty Hamiltonians before applying generic quantum compilation, thereby discarding SAT-specific information such as clause structure, logical operators, and variable dependencies. Consequently, subsequent compiler optimizations cannot exploit the underlying Boolean formulation. This paper presents SAQC, a SAT-aware compilation framework that introduces a SAT Intermediate Representation (SIR) to preserve Boolean structure during compilation. The proposed framework supports both CNF and XOR-extended CNF (eCNF) formulations and performs SAT-aware optimizations including clause rewriting, dependency analysis, and clause scheduling prior to quantum lowering. Building on the optimized SIR, SAQC provides a unified framework for both penalty Hamiltonian generation and direct clause-to-ansatz synthesis, together with ansatz optimizations based on relative-phase decomposition, ancilla-assisted synthesis, and dynamic uncomputation. Experimental results demonstrate significant reductions in circuit depth, two-qubit gate count, and compilation time compared with conventional Hamiltonian-based workflows while remaining compatible with existing quantum compilation frameworks. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-09 in cs.ET). Categorie arXiv: Quantum Physics (quant-ph) ; Emerging Technologies (cs.ET). Pagina del lavoro: https://arxiv.org/abs/2609.05737 — 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-16T15:31:57.845Z dalla pagina https://arxiv.org/catchup/cs.ET/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).