{
  "abstract": "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.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.05737",
  "author_total": 4,
  "authors": [
    {
      "name": "Till Schnittka"
    },
    {
      "name": "Julie Maria Raju"
    },
    {
      "name": "Abhoy Kole"
    },
    {
      "name": "Rolf Drechsler"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/ef73ks3t89z5m.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.05737",
  "fulltext_url": null,
  "id": "ef73ks3t89z5m",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.05737",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.ET"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7211994199",
  "pdf_url": "https://arxiv.org/pdf/2609.05737",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-09",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/ef73ks3t89z5m.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:20:12Z",
      "native_id": "2609.05737",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.05737"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "SAQC: A SAT-Aware Compilation Framework for QAOA-Based Quantum Optimization",
  "title_text": "SAQC: A SAT-Aware Compilation Framework for QAOA-Based Quantum Optimization",
  "type": "preprint",
  "updated_at": "2026-10-30T12:20:12Z",
  "url": "https://research.draconitic.com/paper/ef73ks3t89z5m",
  "venue": "arXiv",
  "versions": []
}