{
  "abstract": "Hamiltonian simulation is a core quantum workload, underpinning variational quantum algorithms and Trotterized time evolution. Such programs are expressed as Pauli exponential sequences, exhibiting structural patterns that are highly amenable to high-level synthesis and optimization. Existing compilers, however, fail to fully unlock the optimization potential of their global algebraic structure, even when employing advanced graph- or tableau-based methods. We present Symphony, a holistic compilation approach built on the binary symplectic form (BSF) representation of Pauli strings. Unlike prior group-wise BSF simplification and path-based Pauli network synthesis, Symphony applies generalized controlled-Pauli Clifford transformations directly to a global BSF tableau, progressively reducing active Pauli rows while adaptively emitting eligible two-qubit blocks in addition to single-qubit rotations in a forward Clifford frame. Following algebraic simplification, Symphony performs a causality-preserving block rescheduling heuristic that respects frame-induced dependencies while exposing extensive two-qubit block parallelism opportunities. This streamlined compilation style comprehensively exploits simultaneous simplification and commutativity opportunities, achieving efficient global optimization without relying on computationally expensive heuristics or long-horizon searches. Across the generic Hamiltonian simulation benchmarks in HamLib, Symphony achieves average reductions of 59% in two-qubit gate count and 91% in circuit depth. It Pareto-dominates prior state-of-the-art compilers, requiring 1.17--1.58$\\times$ fewer two-qubit gates and especially shrinking two-qubit circuit depth by a substantial factor of 1.87--5.67$\\times$ on average.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2608.11579",
  "author_total": 7,
  "authors": [
    {
      "name": "Zhaohui Yang"
    },
    {
      "name": "Yuwei Han"
    },
    {
      "name": "Ruiyun Zhang"
    },
    {
      "name": "Dawei Ding"
    },
    {
      "name": "Jianxin Chen"
    },
    {
      "name": "Yuan Feng"
    },
    {
      "name": "Yuan Xie"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/c5eknd3j8vehn.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2608.11579",
  "fulltext_url": null,
  "id": "c5eknd3j8vehn",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2608.11579",
  "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",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7202347509",
  "pdf_url": "https://arxiv.org/pdf/2608.11579",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-29",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/c5eknd3j8vehn.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:36:22Z",
      "native_id": "2608.11579",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2608.11579"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification",
  "title_text": "Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification",
  "type": "preprint",
  "updated_at": "2026-11-01T12:20:44Z",
  "url": "https://research.draconitic.com/paper/c5eknd3j8vehn",
  "venue": "arXiv",
  "versions": []
}