Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

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

Published Nov 4, 2026• 0 citations
Publisher

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.

No sign of AI-generated textUnclear noveltyMissing comparison

Written by gpt-6.1-sol from the abstract only. Automated: it can be wrong.

DOI
10.1145/3845814.3850043

Related papers

Linear Complexity Fermionic Simulation on Quantum Devices with Hardware Connectivity Constraints

Xiangyu Gao, Winston Li, Jiakang Li +4 more

Simulating fermionic systems on quantum hardware requires compiling fermionic Hamiltonians into executable quantum circuits. Existing approaches treat each compilation stage independently, applying heuristics with localized objectives that produce circuits with superquartic gate count and depth scaling and compilation times reaching several hours for large instances. We present Accordion, an end-to-end framework that co-designs the fermion-to-qubit mapping with circuit synthesis and hardware routing. Accordion fixes the Jordan Wigner mapping, which despite its higher Pauli weight produces Pauli operators with structural regularity that enables provably efficient circuit generation. For full-rank all-to-all electronic structure Hamiltonians, we prove O(N^4) gate count and circuit depth, matching the information-theoretic lower bound imposed by the Theta(N^4) second excitation terms. On linear, IBM heavy-hex, and square-grid architectures, Accordion reduces gate count by up to 79% and circuit depth by up to 77% relative to the best baseline.

arXiv:2606.00982•May 31, 2026•2 citations

F2: Offline Reinforcement Learning for Hamiltonian Simulation via Free-Fermionic Subroutine Compilation

Ethan Decker, Christopher Watson, Junyu Zhou +5 more

Compiling shallow and accurate quantum circuits for Hamiltonian simulation remains challenging due to hardware constraints and the combinatorial complexity of minimizing gate count and circuit depth. Existing optimization method pipelines rely on hand-engineered classical heuristics, which cannot learn input-dependent structure and therefore miss substantial opportunities for circuit reduction. We introduce F2, an offline reinforcement learning framework that exploits free-fermionic structure to efficiently compile Trotter-based Hamiltonian simulation circuits. F2 provides (i) a reinforcement-learning environment over classically simulatable free-fermionic subroutines, (ii) architectural and objective-level inductive biases that stabilize long-horizon value learning, and (iii) a reversible synthetic-trajectory generation mechanism that consistently yields abundant, guaranteed-successful offline data. Across benchmarks spanning lattice models, protein fragments, and crystalline materials (12-222 qubits), F2 reduces gate count by 47% and depth by 38% on average relative to strong baselines (Qiskit, Cirq/OpenFermion) while maintaining average errors of 10^(-7). These results show that aligning deep reinforcement learning with the algebraic structure of quantum dynamics enables substantial improvements in circuit synthesis, suggesting a promising direction for scalable, learning-based quantum compilation

quant-pharXiv:2512.08023•Dec 10, 2025•2 citations

Improving fermionic variational quantum eigensolvers with Majorana swap networks

D. E. Fisher, Suren A. Fldzhyan, Dmitry V Minaev +2 more

Simulating computationally hard fermionic systems is a promising application of quantum computing. However, mapping nonlocal fermionic operators to qubits often produces deep circuits, rendering such simulations impractical on near-term hardware. We introduce two Majorana swap network compilation strategies for variational quantum eigensolvers that reduce circuit depth and two-qubit gate count. First, we develop a cyclic compilation algorithm that localizes all two-particle interaction terms in a general fermionic Hamiltonian containing up to $\mathcal{O}(M^4)$ such terms using only $\mathcal{O}(M^3)$ auxiliary Majorana-swap transpositions, where $M$ is the number of fermionic modes. Here, the cubic scaling refers to auxiliary routing; a complete UCCGSD ansatz still contains $\mathcal{O}(M^4)$ double-excitation rotations. Second, we design a Majorana swap network for the $k$-UpCCGSD variational ansatz, which is already more compact than UCCGSD. In this setting, our network yields constant-factor reductions of approximately $50$ % in circuit depth and $20$ % in two-qubit gate count under all-to-all connectivity. For the more restricted $2\times N$ connectivity, the reductions are larger --- about $55$ % in circuit depth an $40$ % in gate count. These structural improvements are accompanied by improved robustness in numerical noise simulations on the small molecular instances tested.

arXiv:2509.07855•Physical Review A•Aug 12, 2026•2 citations

Verifying Results of the IBM Qiskit Quantum Circuit Compilation Flow

Lukas Burgholzer, Rudy Raymond, Robert Wille

Realizing a conceptual quantum algorithm on an actual physical device necessitates the algorithm's quantum circuit description to undergo certain transformations in order to adhere to all constraints imposed by the hardware. In this regard, the individual high-level circuit components are first synthesized to the supported low-level gate-set of the quantum computer, before being mapped to the target's architecture-utilizing several optimizations in order to improve the compilation result. Specialized tools for this complex task exist, e.g., IBM's Qiskit, Google's Cirq, Microsoft's QDK, or Rigetti's Forest. However, to date, the circuits resulting from these tools are hardly verified, which is mainly due to the immense complexity of checking if two quantum circuits indeed realize the same functionality. In this paper, we propose an efficient scheme for quantum circuit equivalence checking-specialized for verifying results of the IBM Qiskit quantum circuit compilation flow. To this end, we combine characteristics unique to quantum computing, e.g., its inherent reversibility, and certain knowledge about the compilation flow into a dedicated equivalence checking strategy. Experimental evaluations confirm that the proposed scheme allows to verify even large circuit instances with tens of thousands of operations within seconds or even less, whereas state-of-the-art techniques frequently time-out or require substantially more runtime. A corresponding open source implementation of the proposed method is publicly available at https://github.com/iic-jku/qcec.

arXiv:2009.02376•IEEE International Conference on Quantum Computing and Engineering (QCE)•Oct 1, 2020•64 citations

Fermihedral: On the Optimal Compilation for Fermion-to-Qubit Encoding

Yuhao Liu, Shize Che, Junyu Zhou +2 more

This paper introduces Fermihedral, a compiler framework focusing on discovering the optimal Fermion-to-qubit encoding for targeted Fermionic Hamiltonians. Fermion-to-qubit encoding is a crucial step in harnessing quantum computing for efficient simulation of Fermionic quantum systems. Utilizing Pauli algebra, Fermihedral redefines complex constraints and objectives of Fermion-to-qubit encoding into a Boolean Satisfiability problem which can then be solved with high-performance solvers. To accommodate larger-scale scenarios, this paper proposed two new strategies that yield approximate optimal solutions mitigating the overhead from the exponentially large number of clauses. Evaluation across diverse Fermionic systems highlights the superiority of Fermihedral, showcasing substantial reductions in implementation costs, gate counts, and circuit depth in the compiled circuits. Real-system experiments on IonQ's device affirm its effectiveness, notably enhancing simulation accuracy.

arXiv:2403.17794•International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)•Apr 24, 2024•12 citations

Low-depth simulations of fermionic systems on square-grid quantum hardware

Manuel G. Algaba, P. V. Sriluckshmy, Martin Leib +1 more

We present a general strategy for mapping fermionic systems to quantum hardware with square qubit connectivity which yields low-depth quantum circuits, counted in the number of native two-qubit fSIM gates. We achieve this by leveraging novel operator decomposition and circuit compression techniques paired with specifically chosen low-depth fermion-to-qubit mappings and allow for a high degree of gate cancellations and parallelism. Our mappings retain the flexibility to simultaneously optimize for qubit counts or qubit operator weights and can be used to investigate arbitrary fermionic lattice geometries. We showcase our approach by investigating the tight-binding model, the Fermi-Hubbard model as well as the multi-orbital Hubbard-Kanamori model. We report unprecedentedly low circuit depths per single Trotter layer with up to a 70% improvement upon previous state-of-the-art. Our compression technique also results in significant reduction of two-qubit gates. We find the lowest gate-counts when applying the XYZ-formalism to the DK mapping. Additionally, we show that our decomposition and compression formalism produces favourable circuits even when no native parameterized two-qubit gates are available.

arXiv:2302.01862•Quantum•Apr 30, 2024•25 citations
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.
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 nnn fermionic modes, it reports O(n4)O(n^4)O(n4) gate count and circuit depth. The gate-count scaling is presented as matching a lower bound associated with the Θ(n4)\Theta(n^4)Θ(n4) 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.
Simulating fermionic systems on quantum hardware requires compiling fermionic Hamiltonians into executable quantum circuits. Existing approaches treat each compilation stage independently, applying heuristics with localized objectives that produce circuits with superquartic gate count and depth scaling and compilation times reaching several hours for large instances. We present Accordion, an end-to-end framework that co-designs the fermion-to-qubit mapping with circuit synthesis and hardware routing. Accordion fixes the Jordan Wigner mapping, which despite its higher Pauli weight produces Pauli operators with structural regularity that enables provably efficient circuit generation. For full-rank all-to-all electronic structure Hamiltonians, we prove O(N^4) gate count and circuit depth, matching the information-theoretic lower bound imposed by the Theta(N^4) second excitation terms. On linear, IBM heavy-hex, and square-grid architectures, Accordion reduces gate count by up to 79% and circuit depth by up to 77% relative to the best baseline.
Compiling shallow and accurate quantum circuits for Hamiltonian simulation remains challenging due to hardware constraints and the combinatorial complexity of minimizing gate count and circuit depth. Existing optimization method pipelines rely on hand-engineered classical heuristics, which cannot learn input-dependent structure and therefore miss substantial opportunities for circuit reduction. We introduce F2, an offline reinforcement learning framework that exploits free-fermionic structure to efficiently compile Trotter-based Hamiltonian simulation circuits. F2 provides (i) a reinforcement-learning environment over classically simulatable free-fermionic subroutines, (ii) architectural and objective-level inductive biases that stabilize long-horizon value learning, and (iii) a reversible synthetic-trajectory generation mechanism that consistently yields abundant, guaranteed-successful offline data. Across benchmarks spanning lattice models, protein fragments, and crystalline materials (12-222 qubits), F2 reduces gate count by 47% and depth by 38% on average relative to strong baselines (Qiskit, Cirq/OpenFermion) while maintaining average errors of 10^(-7). These results show that aligning deep reinforcement learning with the algebraic structure of quantum dynamics enables substantial improvements in circuit synthesis, suggesting a promising direction for scalable, learning-based quantum compilation
Simulating computationally hard fermionic systems is a promising application of quantum computing. However, mapping nonlocal fermionic operators to qubits often produces deep circuits, rendering such simulations impractical on near-term hardware. We introduce two Majorana swap network compilation strategies for variational quantum eigensolvers that reduce circuit depth and two-qubit gate count. First, we develop a cyclic compilation algorithm that localizes all two-particle interaction terms in a general fermionic Hamiltonian containing up to O(M4)\mathcal{O}(M^4)O(M4) such terms using only O(M3)\mathcal{O}(M^3)O(M3) auxiliary Majorana-swap transpositions, where MMM is the number of fermionic modes. Here, the cubic scaling refers to auxiliary routing; a complete UCCGSD ansatz still contains O(M4)\mathcal{O}(M^4)O(M4) double-excitation rotations. Second, we design a Majorana swap network for the kkk-UpCCGSD variational ansatz, which is already more compact than UCCGSD. In this setting, our network yields constant-factor reductions of approximately 505050 % in circuit depth and 202020 % in two-qubit gate count under all-to-all connectivity. For the more restricted 2×N2\times N2×N connectivity, the reductions are larger --- about 555555 % in circuit depth an 404040 % in gate count. These structural improvements are accompanied by improved robustness in numerical noise simulations on the small molecular instances tested.
Realizing a conceptual quantum algorithm on an actual physical device necessitates the algorithm's quantum circuit description to undergo certain transformations in order to adhere to all constraints imposed by the hardware. In this regard, the individual high-level circuit components are first synthesized to the supported low-level gate-set of the quantum computer, before being mapped to the target's architecture-utilizing several optimizations in order to improve the compilation result. Specialized tools for this complex task exist, e.g., IBM's Qiskit, Google's Cirq, Microsoft's QDK, or Rigetti's Forest. However, to date, the circuits resulting from these tools are hardly verified, which is mainly due to the immense complexity of checking if two quantum circuits indeed realize the same functionality. In this paper, we propose an efficient scheme for quantum circuit equivalence checking-specialized for verifying results of the IBM Qiskit quantum circuit compilation flow. To this end, we combine characteristics unique to quantum computing, e.g., its inherent reversibility, and certain knowledge about the compilation flow into a dedicated equivalence checking strategy. Experimental evaluations confirm that the proposed scheme allows to verify even large circuit instances with tens of thousands of operations within seconds or even less, whereas state-of-the-art techniques frequently time-out or require substantially more runtime. A corresponding open source implementation of the proposed method is publicly available at https://github.com/iic-jku/qcec.
This paper introduces Fermihedral, a compiler framework focusing on discovering the optimal Fermion-to-qubit encoding for targeted Fermionic Hamiltonians. Fermion-to-qubit encoding is a crucial step in harnessing quantum computing for efficient simulation of Fermionic quantum systems. Utilizing Pauli algebra, Fermihedral redefines complex constraints and objectives of Fermion-to-qubit encoding into a Boolean Satisfiability problem which can then be solved with high-performance solvers. To accommodate larger-scale scenarios, this paper proposed two new strategies that yield approximate optimal solutions mitigating the overhead from the exponentially large number of clauses. Evaluation across diverse Fermionic systems highlights the superiority of Fermihedral, showcasing substantial reductions in implementation costs, gate counts, and circuit depth in the compiled circuits. Real-system experiments on IonQ's device affirm its effectiveness, notably enhancing simulation accuracy.
We present a general strategy for mapping fermionic systems to quantum hardware with square qubit connectivity which yields low-depth quantum circuits, counted in the number of native two-qubit fSIM gates. We achieve this by leveraging novel operator decomposition and circuit compression techniques paired with specifically chosen low-depth fermion-to-qubit mappings and allow for a high degree of gate cancellations and parallelism. Our mappings retain the flexibility to simultaneously optimize for qubit counts or qubit operator weights and can be used to investigate arbitrary fermionic lattice geometries. We showcase our approach by investigating the tight-binding model, the Fermi-Hubbard model as well as the multi-orbital Hubbard-Kanamori model. We report unprecedentedly low circuit depths per single Trotter layer with up to a 70% improvement upon previous state-of-the-art. Our compression technique also results in significant reduction of two-qubit gates. We find the lowest gate-counts when applying the XYZ-formalism to the DK mapping. Additionally, we show that our decomposition and compression formalism produces favourable circuits even when no native parameterized two-qubit gates are available.