Unifying Qubit Routing Across Diverse Quantum ISAs via Canonical Representation
Zhaohui Yang, Kai Zhang, Xinyang Tian, Xiangyu Ren, Yingjian Liu, Yunfeng Li, Dawei Ding, Jianxin Chen, Yuan Xie
Abstract
Qubit mapping/routing is a critical stage in compilation for both near-term and fault-tolerant quantum computers, yet existing scalable methods typically impose several times the routing overhead in terms of circuit depth or duration. This inefficiency stems from a fundamental disconnect: compilers rely on an abstract routing model (e.g., three-CX-unrolled SWAP insertion) that completely ignores the idiosyncrasies of native gates supported by physical devices.
Recent hardware breakthroughs have enabled high-precision implementations of diverse instruction set architectures (ISAs) beyond standard CX-based gates. Advanced ISAs involving gates such as √ iSWAP and ZZ(θ) gates offer superior circuit synthesis capabilities and can be realized with higher fidelities. However, systematic compiler optimization strategies tailored to these advanced ISAs are lacking.
To address this, we propose CANOPUS, a unified qubit mapping/routing framework applicable to diverse quantum ISAs. Built upon the canonical representation of two-qubit gates, CANOPUS centers on qubit routing to perform deep cooptimization in an ISA-aware approach. CANOPUS leverages the two-qubit canonical representation and the monodromy polytope theory to model the synthesis cost for more intelligent SWAP insertion during qubit routing. We also formalize the commutation relations between two-qubit gates through the canonical form, providing a generalized approach to commutativity-based optimization. Experiments show that CANOPUS consistently reduces routing overhead by 15%-35% compared to state-of-theart methods across various backend ISAs and device topologies. More broadly, this work establishes a coherent method for coexploration of program patterns, quantum ISAs, and hardware topologies, yielding concrete guidelines for hardware-software co-design. This is the first practical demonstration of how to efficiently utilize advanced quantum ISAs, opening the door to designing more powerful and synergistic quantum systems.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 074d85ed-ac22-4d10-9cb8-efd261abed1dBuilds on10
- Time-optimal Qubit mappingChi Zhang, Ari B. Hayes, Longfei Qiu, Yuwei Jin et al.ASPLOS 2021 · 72 citations
- QUEST: systematically approximating Quantum circuits for higher output fidelityTirthak Patel, Ed Younis, Costin Iancu, Wibe de Jong et al.ASPLOS 2022 · 50 citations
- 2QAN: a quantum compiler for 2-local qubit hamiltonian simulation algorithmsLingling Lao, Dan E. BrowneISCA 2022 · 37 citations
- Not All SWAPs Have the Same Cost: A Case for Optimization-Aware Qubit RoutingJi Liu, Peiyi Li, Huiyang ZhouHPCA 2022 · 30 citations
- Designing Calibration and Expressivity-Efficient Instruction Sets for Quantum ComputingLingling Lao, Prakash Murali, Margaret Martonosi, Dan E. BrowneISCA 2021 · 23 citations
Related papers
- Qubit Routing Using Graph Neural Network Aided Monte Carlo Tree SearchAnimesh Sinha, Utkarsh Azad, Harjinder SinghAAAI 2022 · 31 citations
- Reconfigurable Quantum Instruction Set Computers for High Performance Attainable on HardwareZhaohui Yang, Dawei Ding, Qi Ye, Cupjin Huang et al.ASPLOS 2026
- MIRAGE: Quantum Circuit Decomposition and Routing Collaborative Design Using Mirror GatesEvan McKinney, Michael Hatridge, Alex K. JonesHPCA 2024 · 4 citations
- DDRoute: a Novel Depth-Driven Approach to the Qubit Routing ProblemAlessandro Annechini, Marco Venere, Donatella Sciuto, Marco D. SantambrogioDAC 2025 · 2 citations
- A fast and scalable qubit-mapping method for noisy intermediate-scale quantum computersSunghye Park, Daeyeon Kim, Minhyuk Kweon, Jae-Yoon Sim et al.DAC 2022 · 21 citations
