International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)
Accordion: An End-to-end Approach for Fermionic Simulation in Quantum Devices
Xiangyu Gao, Winston Li, Jiakang Li, Zirui Li, Yipeng Huang, Costin Iancu, Eddy Z. Zhang
Abstract
Simulating fermionic systems on quantum hardware requires compiling fermionic Hamiltonians into executable quantum circuits through three stages: fermion-to-qubit mapping, circuit synthesis, and hardware routing. Existing approaches largely optimize these stages independently, relying on stage-specific heuristics that can lead to >> O(n 4 ) scaling in gate count and circuit depth, as well as compilation times of several hours for large instances. We present SimP, an end-to-end compilation framework that vertically integrates fermion-to-qubit mapping, circuit synthesis, and hardware routing. SimP exploits the regular structure of two-body fermionic operators across these compilation stages to substantially reduce the complexity of the resulting circuits. For full-rank all-to-all two-body Hamiltonians, SimP achieves O(n 4 ) gate count and circuit depth, with gate count matching the information-theoretic lower bound imposed by the ?(n 4 ) terms in a two-body fermionic Hamiltonian. Across linear, IBM heavy-hex, and square-grid architectures, SimP reduces gate count by up to 80% and circuit depth by up to 77% relative to the state of the art, while reducing compilation time by up to 99% on large instances. The source code of SimP is publicly available at https://github.com/ruadapt/Accordion-Fermionic-Simulation.
AI Summary
Compiling fermionic Hamiltonians for quantum hardware involves fermion-to-qubit mapping, circuit synthesis, and routing onto a device’s connectivity graph. This paper asks whether optimizing these stages jointly can reduce circuit size, depth, and compilation time compared with optimizing them separately. The proposed framework, SimP, exploits the regular structure of two-body fermionic operators across all three compilation stages. For full-rank Hamiltonians with all-to-all two-body interactions on $n$ fermionic modes, it reports $O(n^4)$ gate count and circuit depth. The gate-count scaling is presented as matching a lower bound associated with the $\Theta(n^4)$ terms in such Hamiltonians; no corresponding depth-optimality claim is given in the abstract. Evaluations cover linear connectivity, IBM heavy-hex connectivity, and square grids. Relative to the stated state-of-the-art baselines, the reported reductions reach 80% in gate count and 77% in circuit depth, with compilation-time reductions of up to 99% on large instances. Source code is publicly available. Only the abstract is available, so the construction, scaling arguments, benchmark sizes, baseline configurations, and conditions producing the largest improvements cannot be assessed here. The asymptotic guarantees are specifically stated for full-rank, all-to-all two-body Hamiltonians. The abstract does not state additional limitations, specify simulation-accuracy assumptions, or report execution results on quantum hardware.
Written by gpt-6.1-sol from the abstract only. Automated: it can be wrong.