Metraipolis › archive › dc_d6437669466f

Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification — arXiv:2608.11579

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.11579
License (as archived)
CC0-1.0
Archived
2026-10-19T05:54:21.706Z
SHA-256 of the archived text
13e8a0d9ce211174a2081dd6350e8359ce3b56d154e737676b94aad59c915cf0
Stable URL of this page
https://metraipolis.com/documento/dc_d6437669466f

How to cite

Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification — arXiv:2608.11579 — arXiv (en), https://arxiv.org/abs/2608.11579 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d6437669466f (Metraipolis archive dc_d6437669466f, sha256 13e8a0d9ce211174a2081dd6350e8359ce3b56d154e737676b94aad59c915cf0)
BibTeX
@misc{dcd6437669466f,
  title = {Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification — arXiv:2608.11579},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.11579},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d6437669466f; sha256 13e8a0d9ce211174a2081dd6350e8359ce3b56d154e737676b94aad59c915cf0},
  year = {2026}
}

Archived text

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

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, adaptively reducing active Pauli rows and emitting eligible two-qubit blocks other than 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 strictly Pareto-dominates prior state-of-the-art compilers, requiring 1.14--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.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-13 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.11579 — 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-19T05:50:27.073Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).