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

arXiv:2609.33997

QBX: A Compiler for 2-local Qubit Hamiltonian Simulation on Quantum Chiplets

Zikun Li, Zhuoming Chen, Zhihao Jia

quant-phcs.ARSubmitted Sep 27, 2026• Announced Sep 29, 2026• 0 citations
arXivHTMLPDF

Abstract

2-local qubit Hamiltonian simulation, a fundamental task in quantum computing, is widely applied in various applications. This paper presents QBX, the first quantum compiler designed for 2-local qubit Hamiltonian simulation on quantum chiplet architectures. Existing general-purpose quantum compilers for chiplet architectures target quantum programs at the gate level and miss optimizations requiring high-level semantics of Hamiltonian simulation. Conversely, existing domain-specific compilers for Hamiltonian simulation are designed for monolithic architectures, and their limited scalability and inability to adapt to the heterogeneity of chiplet architectures lead to sub-optimal circuit outputs. QBX implements a scalable hierarchical approach to reduce both the amount and distance of cross-chiplet communications. It integrates the highway mechanism, a chiplet-oriented solution for efficient long-range qubit communication, to diminish cross-chiplet interaction costs. Furthermore, QBX efficiently aggregates 2-local Pauli strings into multi-target controlled gates, harnessing highways for deep optimization. Our evaluations show that QBX markedly outperforms both general-purpose and domain-specific compilers in circuit depth and operation count, while scaling to much larger 2-local Hamiltonian simulations.

AI Summary

QBX addresses compilation of Trotterized 2-local qubit Hamiltonian simulation for chiplet architectures with sparse connectivity and noisier inter-chiplet couplings. It combines Hamiltonian-level scheduling with “highways”: ancilla GHZ states supporting remote and multi-target controlled operations through measurement-assisted protocols. The compiler partitions the Hamiltonian’s interaction graph into chiplet-sized groups, assigns groups to chiplets to minimize communication distance, and aggregates same-type interactions sharing a control into Pauli blocks. Partitioning uses either an ILP formulation or METIS; chiplet assignment uses ILP. Greedy scheduling coordinates highway-assisted blocks and local routing. State-evolution proofs establish two highway-reuse rules: reuse across target-only operations, and reuse across an intervening control-$Y$ operation with additional ancilla-$X$ gates. Classical compilation benchmarks cover 51 QAOA, Ising, XY, and Heisenberg instances on modeled heavy-hex chiplet systems with 324–990 data qubits. QBX-METIS reduces geometric-mean depth by factors of 2.57 versus Qiskit and 10.35 versus tket, and error-weighted effective CNOT count by 1.30 and 2.62, respectively. Separate comparisons with highway-based MECH give factors of 1.69 and 1.08. On instances completed by 2QAN, QBX gives 1.13-fold lower depth and 19.54-fold faster compilation, but 2QAN uses fewer effective CNOTs. Stated limitations include ILP scalability, manually chosen ancilla layouts, and conservative scheduling requiring concurrent blocks to occupy disjoint chiplets. The exploited models have homogeneous $XX$, $YY$, and $ZZ$ interactions. Evaluation uses circuit-resource proxies rather than hardware execution; depth excludes classical communication and single-qubit gates. QBX-METIS compilation is slower than Qiskit and tket.

Little sign of AI-generated textIncrementalStrong assumptionsPossible error

Central claim may not hold: The abstract overstates operation-count improvements over domain-specific compilers: on completed comparisons, 2QAN uses approximately 0.63 times QBX-METIS's effective CNOT count. The paper advertises general 2-local Hamiltonian compilation but develops and evaluates its construction for a restricted interaction structure involving homogeneous XX, YY and ZZ terms. The paper incorrectly asserts that Pauli-string exponentials and schedule layers commute, and its unrestricted reordering leaves resource advantages for noncommuting Hamiltonians unestablished at matched simulation accuracy. The synthesis description incorrectly uses ordinary Pauli Y as the basis change for a Y interaction; that conjugation does not transform a ZZ rotation into a YY rotation.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
22 pages, 12 figures

Related papers

2QAN: a quantum compiler for 2-local qubit hamiltonian simulation algorithms

Lingling Lao, Dan E. Browne

Simulating quantum systems is one of the most important potential applications of quantum computers. The high-level circuit defining the simulation needs to be compiled into one that complies with hardware limitations such as qubit architecture (connectivity) and instruction (gate) set. General-purpose quantum compilers work at the gate level and have little knowledge of the mathematical properties of quantum applications, missing further optimization opportunities. Existing application-specific compilers only apply advanced optimizations in the scheduling procedure and are restricted to the CNOT or CZ gate set. In this work, we develop a compiler, named 2QAN, to optimize quantum circuits for 2-local qubit Hamiltonian simulation problems, a framework which includes the important quantum approximate optimization algorithm (QAOA). In particular, we exploit the flexibility of permuting different operators in the Hamiltonian (no matter whether they commute) and propose permutation-aware techniques for qubit routing, gate optimization and scheduling to minimize compilation overhead. 2QAN can target different architectures and different instruction sets. Compilation results on four applications (up to 50 qubits) and three quantum computers (namely, Google Sycamore, IBMQ Montreal and Rigetti Aspen) show that 2QAN outperforms state-of-the-art general-purpose compilers and application-specific compilers. Specifically, 2QAN can reduce the number of inserted SWAP gates by 11.5X, reduce overhead in hardware gate count by 68.5X, and reduce overhead in circuit depth by 21X. Experimental results on the Montreal device demonstrate that benchmarks compiled by 2QAN achieve the highest fidelity.

Proceedings - International Symposium on Computer Architecture/Proceedings•May 31, 2022•45 citations

Chipmunq: A Fault-Tolerant Compiler for Chiplet Quantum Architectures

Peter Wegmann, Aleksandra Świerkowska, Emmanouil Giortamis +1 more

As quantum computing advances toward fault-tolerance through quantum error correction, modular chiplet architectures have emerged to provide the massive qubit counts required while overcoming fabrication limits of monolithic chips. However, this transition introduces a critical compilation gap: existing frameworks cannot handle the scale of fault-tolerant quantum circuits while managing the noisy, sparse interconnects of chiplet backends. We present Chipmunq, the first hardware-aware compiler for mapping and routing fault-tolerant circuits onto modular architectures. Chipmunq employs a quantum-error-correction-aware partitioning strategy that preserves the integrity of logical qubit patches, preventing prohibitive gate overheads common in general-purpose compilers. Our evaluation demonstrates that Chipmunq achieves a 13.5x speedup in compilation time compared to state-of-the-art tools. By incorporating chiplet constraints and defective qubits, it reduces circuit depth by 86.4% and SWAP gate counts by 91.4% across varying code distances. Crucially, Chipmunq overcomes heterogeneous inter-chiplet links, improving logical error rates by up to two orders of magnitude.

quant-pharXiv:2603.16389•Mar 18, 2026•1 citation

MECH: Multi-Entry Communication Highway for Superconducting Quantum Chiplets

Hezi Zhang, Keyi Yin, Anbang Wu +3 more

Chiplet architecture is an emerging architecture for quantum computing that could significantly increase qubit resources with its great scalability and modularity. However, as the computing scale increases, communication between qubits would become a more severe bottleneck due to the long routing distances. In this paper, we propose a multi-entry communication highway (MECH) mechanism to trade ancillary qubits for program concurrency, and build a compilation framework to efficiently manage and utilize the highway resources. Our evaluation shows that this framework significantly outperforms the baseline approach in both the circuit depth and the number of operations on typical quantum benchmarks. This implies a more efficient and less error-prone compilation of quantum programs.

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

Hamiltonian engineering and quantum compilation

Baßler, Pascal

Quantum computers hold the promise of solving certain computational problems significantly faster than classical computers. Unlocking the full potential of quantum hardware depends on our ability to efficiently translate high-level quantum algorithms into executable sequences of quantum operations tailored to the specific constraints of a given device, a task known as quantum compilation. Among the most promising applications is the simulation of quantum systems, such as in quantum chemistry, where scalable, error resilient, and experimentally feasible Hamiltonian simulation techniques are essential. In the first part of this thesis, we present recent advances in the field of quantum compilation, emphasizing on efficient gate decomposition and circuit optimization. In particular, we analyze compilation techniques for Clifford circuits and general single-qubit rotations. Clifford operations play a central role in quantum error correction, the characterization of quantum devices and quantum cryptography. We explore asymptotically optimal decomposition methods, including constructions using either two-qubit gates or global entangling operations, the latter being especially well-suited for platforms like trapped ions. For single-qubit unitaries, we discuss approximation schemes that achieve the theoretically optimal scaling of gate count with respect to the desired precision. Beyond gate synthesis, we examine various hardware-aware optimization strategies aimed at reducing circuit depth and gate overhead. These include techniques for qubit routing in systems with limited connectivity, as well as methods for removing redundant operations. The second and primary, scientific contribution of this thesis focuses on implementation of effective many-body interactions on quantum hardware by combining the system’s native dynamics with control operations, which we call Hamiltonian engineering. Motivated by the central role of Hamiltonian simulation in quantum science, we introduce a general and efficient framework for synthesizing arbitrary target Hamiltonians under mild locality constraints. We propose a novel linear programming (LP) approach that computes pulse sequences consisting of single-qubit π or π/2 rotations applied at certain times during free evolution under the system’s native Hamiltonian. Our LP-based framework offers multiple advantages. First, its classical runtime depends only on the number and locality of the interactions in the system Hamiltonian, not directly on the overall system size. Second, we extend the method to include robustness against common error sources such as finite pulse time effects and systematic control errors, leveraging tools from average Hamiltonian theory and robust composite pulses. Our approach enables the efficient realization of high-fidelity Hamiltonian dynamics with minimal experimental overhead. The scalability of the approach are demonstrated through simulations, including the engineering of a random two-body Hamiltonian on a 225 qubit lattice in under a minute of classical preprocessing. In conclusion, this thesis contributes both theoretical insights and practical tools that bridge the gap between algorithm design and experimental implementation in quantum computing. The techniques developed here are directly applicable to a variety of platforms, including trapped ions, neutral atoms, and superconducting circuits. By advancing the frontiers of Hamiltonian engineering, this work enables more efficient, robust, and scalable quantum simulations on nearterm devices. Finally, it brings us closer to realizing quantum technologies, which are possibly capable of solving meaningful problems.

•Dec 8, 2025•0 citations

Quantum-Chiplet: A VLSI-Like Methodology for Hierarchical Quantum Design and Verification

Haoyu Lu, Yu-Ting Kao, Yeong-Jar Chang +2 more

In this work, we introduce “Quantum-Chiplet”, a novel design flow for quantum circuits via a VLSI-like methodology. A large-scale quantum problem is hierarchically decomposed into several functions, or “chiplets,” and designed one by one. Each “chiplet” is initially represented with a behavior model without the need for quantum gate-level details, allowing for greater flexibility in designing arbitrary digital logic under any qubit count within a quantum environment. Focusing on behavior-level design, we also shorten the simulation time by more than an order of magnitude, as demonstrated by comparing the simulation time of QuantumChiplet to the conventional quantum simulator, Qiskit. To synthesize the design into real quantum gates, we leverage the conventional VLSI tool–Design Compiler for the automatic generation of quantum-gate-level design and automatically translate it into code interpretable by conventional quantum simulators. Moreover, Quantum-Chiplet utilizes matrices and the Python NumPy library for simulation. So even if suitable quantum gates are hard to find in existing libraries, simulations can still be done. These advancements, from bottom to top, pave the way for efficiently simulating and scaling up quantum circuits, and offer insight into electronic design automation for next-generation fault-tolerant quantum computing.

IEEE Computer Society Annual Symposium on VLSI•Jul 6, 2025•2 citations

Quantum-Chiplet: A Novel Python-Based Efficient and Scalable Design Methodology for Quantum Circuit Verification and Implementation

Kao, Yu-Ting, Haoyu Lu, Yeong-Jar Chang +1 more

Analysis and verification of quantum circuits are highly challenging, given the exponential dependence of the number of states on the number of qubits. For analytical derivation, we propose a new quantum polynomial representation (QPR) to facilitate the analysis of massively parallel quantum computation and detect subtle errors. For the verification of quantum circuits, we introduce Quantum-Chiplet, a hierarchical quantum behavior modeling methodology that facilitates rapid integration and simulation. Each chiplet is systematically transformed into quantum gates. For circuits involving n qubits and k quantum gates, the design complexity is reduced from "greater than O(2^n)" to O(k). This approach provides an open-source solution, enabling a highly customized solution for quantum circuit simulation within the native Python environment, thereby reducing reliance on traditional simulation packages. A quantum amplitude estimation example demonstrates that this method significantly improves the design process, with more than 10x speed-up compared to IBM Qiskit at 14 qubits.

arXiv:2503.10054•Mar 13, 2025•2 citations
2-local qubit Hamiltonian simulation, a fundamental task in quantum computing, is widely applied in various applications. This paper presents QBX, the first quantum compiler designed for 2-local qubit Hamiltonian simulation on quantum chiplet architectures. Existing general-purpose quantum compilers for chiplet architectures target quantum programs at the gate level and miss optimizations requiring high-level semantics of Hamiltonian simulation. Conversely, existing domain-specific compilers for Hamiltonian simulation are designed for monolithic architectures, and their limited scalability and inability to adapt to the heterogeneity of chiplet architectures lead to sub-optimal circuit outputs. QBX implements a scalable hierarchical approach to reduce both the amount and distance of cross-chiplet communications. It integrates the highway mechanism, a chiplet-oriented solution for efficient long-range qubit communication, to diminish cross-chiplet interaction costs. Furthermore, QBX efficiently aggregates 2-local Pauli strings into multi-target controlled gates, harnessing highways for deep optimization. Our evaluations show that QBX markedly outperforms both general-purpose and domain-specific compilers in circuit depth and operation count, while scaling to much larger 2-local Hamiltonian simulations.
QBX addresses compilation of Trotterized 2-local qubit Hamiltonian simulation for chiplet architectures with sparse connectivity and noisier inter-chiplet couplings. It combines Hamiltonian-level scheduling with “highways”: ancilla GHZ states supporting remote and multi-target controlled operations through measurement-assisted protocols.
The compiler partitions the Hamiltonian’s interaction graph into chiplet-sized groups, assigns groups to chiplets to minimize communication distance, and aggregates same-type interactions sharing a control into Pauli blocks. Partitioning uses either an ILP formulation or METIS; chiplet assignment uses ILP. Greedy scheduling coordinates highway-assisted blocks and local routing. State-evolution proofs establish two highway-reuse rules: reuse across target-only operations, and reuse across an intervening control-YYY operation with additional ancilla-XXX gates.
Classical compilation benchmarks cover 51 QAOA, Ising, XY, and Heisenberg instances on modeled heavy-hex chiplet systems with 324–990 data qubits. QBX-METIS reduces geometric-mean depth by factors of 2.57 versus Qiskit and 10.35 versus tket, and error-weighted effective CNOT count by 1.30 and 2.62, respectively. Separate comparisons with highway-based MECH give factors of 1.69 and 1.08. On instances completed by 2QAN, QBX gives 1.13-fold lower depth and 19.54-fold faster compilation, but 2QAN uses fewer effective CNOTs.
Stated limitations include ILP scalability, manually chosen ancilla layouts, and conservative scheduling requiring concurrent blocks to occupy disjoint chiplets. The exploited models have homogeneous XXXXXX, YYYYYY, and ZZZZZZ interactions. Evaluation uses circuit-resource proxies rather than hardware execution; depth excludes classical communication and single-qubit gates. QBX-METIS compilation is slower than Qiskit and tket.
Simulating quantum systems is one of the most important potential applications of quantum computers. The high-level circuit defining the simulation needs to be compiled into one that complies with hardware limitations such as qubit architecture (connectivity) and instruction (gate) set. General-purpose quantum compilers work at the gate level and have little knowledge of the mathematical properties of quantum applications, missing further optimization opportunities. Existing application-specific compilers only apply advanced optimizations in the scheduling procedure and are restricted to the CNOT or CZ gate set. In this work, we develop a compiler, named 2QAN, to optimize quantum circuits for 2-local qubit Hamiltonian simulation problems, a framework which includes the important quantum approximate optimization algorithm (QAOA). In particular, we exploit the flexibility of permuting different operators in the Hamiltonian (no matter whether they commute) and propose permutation-aware techniques for qubit routing, gate optimization and scheduling to minimize compilation overhead. 2QAN can target different architectures and different instruction sets. Compilation results on four applications (up to 50 qubits) and three quantum computers (namely, Google Sycamore, IBMQ Montreal and Rigetti Aspen) show that 2QAN outperforms state-of-the-art general-purpose compilers and application-specific compilers. Specifically, 2QAN can reduce the number of inserted SWAP gates by 11.5X, reduce overhead in hardware gate count by 68.5X, and reduce overhead in circuit depth by 21X. Experimental results on the Montreal device demonstrate that benchmarks compiled by 2QAN achieve the highest fidelity.
As quantum computing advances toward fault-tolerance through quantum error correction, modular chiplet architectures have emerged to provide the massive qubit counts required while overcoming fabrication limits of monolithic chips. However, this transition introduces a critical compilation gap: existing frameworks cannot handle the scale of fault-tolerant quantum circuits while managing the noisy, sparse interconnects of chiplet backends. We present Chipmunq, the first hardware-aware compiler for mapping and routing fault-tolerant circuits onto modular architectures. Chipmunq employs a quantum-error-correction-aware partitioning strategy that preserves the integrity of logical qubit patches, preventing prohibitive gate overheads common in general-purpose compilers. Our evaluation demonstrates that Chipmunq achieves a 13.5x speedup in compilation time compared to state-of-the-art tools. By incorporating chiplet constraints and defective qubits, it reduces circuit depth by 86.4% and SWAP gate counts by 91.4% across varying code distances. Crucially, Chipmunq overcomes heterogeneous inter-chiplet links, improving logical error rates by up to two orders of magnitude.
Chiplet architecture is an emerging architecture for quantum computing that could significantly increase qubit resources with its great scalability and modularity. However, as the computing scale increases, communication between qubits would become a more severe bottleneck due to the long routing distances. In this paper, we propose a multi-entry communication highway (MECH) mechanism to trade ancillary qubits for program concurrency, and build a compilation framework to efficiently manage and utilize the highway resources. Our evaluation shows that this framework significantly outperforms the baseline approach in both the circuit depth and the number of operations on typical quantum benchmarks. This implies a more efficient and less error-prone compilation of quantum programs.
Quantum computers hold the promise of solving certain computational problems significantly faster than classical computers. Unlocking the full potential of quantum hardware depends on our ability to efficiently translate high-level quantum algorithms into executable sequences of quantum operations tailored to the specific constraints of a given device, a task known as quantum compilation. Among the most promising applications is the simulation of quantum systems, such as in quantum chemistry, where scalable, error resilient, and experimentally feasible Hamiltonian simulation techniques are essential. In the first part of this thesis, we present recent advances in the field of quantum compilation, emphasizing on efficient gate decomposition and circuit optimization. In particular, we analyze compilation techniques for Clifford circuits and general single-qubit rotations. Clifford operations play a central role in quantum error correction, the characterization of quantum devices and quantum cryptography. We explore asymptotically optimal decomposition methods, including constructions using either two-qubit gates or global entangling operations, the latter being especially well-suited for platforms like trapped ions. For single-qubit unitaries, we discuss approximation schemes that achieve the theoretically optimal scaling of gate count with respect to the desired precision. Beyond gate synthesis, we examine various hardware-aware optimization strategies aimed at reducing circuit depth and gate overhead. These include techniques for qubit routing in systems with limited connectivity, as well as methods for removing redundant operations. The second and primary, scientific contribution of this thesis focuses on implementation of effective many-body interactions on quantum hardware by combining the system’s native dynamics with control operations, which we call Hamiltonian engineering. Motivated by the central role of Hamiltonian simulation in quantum science, we introduce a general and efficient framework for synthesizing arbitrary target Hamiltonians under mild locality constraints. We propose a novel linear programming (LP) approach that computes pulse sequences consisting of single-qubit π or π/2 rotations applied at certain times during free evolution under the system’s native Hamiltonian. Our LP-based framework offers multiple advantages. First, its classical runtime depends only on the number and locality of the interactions in the system Hamiltonian, not directly on the overall system size. Second, we extend the method to include robustness against common error sources such as finite pulse time effects and systematic control errors, leveraging tools from average Hamiltonian theory and robust composite pulses. Our approach enables the efficient realization of high-fidelity Hamiltonian dynamics with minimal experimental overhead. The scalability of the approach are demonstrated through simulations, including the engineering of a random two-body Hamiltonian on a 225 qubit lattice in under a minute of classical preprocessing. In conclusion, this thesis contributes both theoretical insights and practical tools that bridge the gap between algorithm design and experimental implementation in quantum computing. The techniques developed here are directly applicable to a variety of platforms, including trapped ions, neutral atoms, and superconducting circuits. By advancing the frontiers of Hamiltonian engineering, this work enables more efficient, robust, and scalable quantum simulations on nearterm devices. Finally, it brings us closer to realizing quantum technologies, which are possibly capable of solving meaningful problems.
In this work, we introduce “Quantum-Chiplet”, a novel design flow for quantum circuits via a VLSI-like methodology. A large-scale quantum problem is hierarchically decomposed into several functions, or “chiplets,” and designed one by one. Each “chiplet” is initially represented with a behavior model without the need for quantum gate-level details, allowing for greater flexibility in designing arbitrary digital logic under any qubit count within a quantum environment. Focusing on behavior-level design, we also shorten the simulation time by more than an order of magnitude, as demonstrated by comparing the simulation time of QuantumChiplet to the conventional quantum simulator, Qiskit. To synthesize the design into real quantum gates, we leverage the conventional VLSI tool–Design Compiler for the automatic generation of quantum-gate-level design and automatically translate it into code interpretable by conventional quantum simulators. Moreover, Quantum-Chiplet utilizes matrices and the Python NumPy library for simulation. So even if suitable quantum gates are hard to find in existing libraries, simulations can still be done. These advancements, from bottom to top, pave the way for efficiently simulating and scaling up quantum circuits, and offer insight into electronic design automation for next-generation fault-tolerant quantum computing.
Analysis and verification of quantum circuits are highly challenging, given the exponential dependence of the number of states on the number of qubits. For analytical derivation, we propose a new quantum polynomial representation (QPR) to facilitate the analysis of massively parallel quantum computation and detect subtle errors. For the verification of quantum circuits, we introduce Quantum-Chiplet, a hierarchical quantum behavior modeling methodology that facilitates rapid integration and simulation. Each chiplet is systematically transformed into quantum gates. For circuits involving n qubits and k quantum gates, the design complexity is reduced from "greater than O(2^n)" to O(k). This approach provides an open-source solution, enabling a highly customized solution for quantum circuit simulation within the native Python environment, thereby reducing reliance on traditional simulation packages. A quantum amplitude estimation example demonstrates that this method significantly improves the design process, with more than 10x speed-up compared to IBM Qiskit at 14 qubits.