MIRAGE: Quantum Circuit Decomposition and Routing Collaborative Design Using Mirror Gates
Evan McKinney, Michael Hatridge, Alex K. Jones
Abstract
Building efficient large-scale quantum computers is a significant challenge due to limited qubit connectivities and noisy hardware operations. Transpilation is critical to ensure that quantum gates are on physically linked qubits, while minimizing SWAP gates and simultaneously finding efficient decomposition into native basis gates. The goal of this multifaceted optimization step is typically to minimize circuit depth and to achieve the best possible execution fidelity. In this work, we propose MIRAGE, a collaborative design and transpilation approach to minimize SWAP gates while improving decomposition using mirror gates. Mirror gates utilize the same underlying physical interactions, but when their outputs are reversed, they realize a different or mirrored quantum operation. Given the recent attention to √iSWAP as a powerful basis gate with decomposition advantages over CNOT, we show how systems that implement the iSWAP family of gates can particularly benefit from mirror gates. Further, MIRAGE uses mirror gates to reduce routing pressure and reduce true circuit depth instead of just minimizing SWAPs. We explore the benefits of decomposition for √iSWAP and 4√SWAP using mirror gates, including both expanding Haar coverage and conducting a detailed fault rate analysis trading off circuit depth against approximate gate decomposition. We also describe a novel greedy approach accepting mirror substitution at different aggression levels within MIRAGE. For iSWAP systems that use square-lattice topologies, MIRAGE provides an average of 29.6% reduction in circuit depth by eliminating an average of 59.9% SWAP gates, with a relative decrease in infidelity of 28%. MIRAGE also improves circuit depth and decreases relative infidelity by 25% and 21 % for CNOT-based and 23% and 19% SYC-based machines, respectively.
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 199a3af3-3803-40fa-956c-7e4ac5bf47e9Cited by top-tier papers2
- Unifying Qubit Routing Across Diverse Quantum ISAs via Canonical RepresentationZhaohui Yang, Kai Zhang, Xinyang Tian, Xiangyu Ren et al.ISCA 2026 · 1 citation
- Reconfigurable Quantum Instruction Set Computers for High Performance Attainable on HardwareZhaohui Yang, Dawei Ding, Qi Ye, Cupjin Huang et al.ASPLOS 2026
Builds on4
- 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
- Co-Designed Architectures for Modular Superconducting Quantum ComputersEvan McKinney, Mingkang Xia, Chao Zhou, Pinlei Lu et al.HPCA 2023 · 12 citations
- Parallel Driving for Fast Quantum Computing Under Speed LimitsEvan McKinney, Chao Zhou, Mingkang Xia, Michael Hatridge et al.ISCA 2023 · 3 citations
Related papers
- Mitigating Crosstalk in Quantum Computers through Commutativity-Based Instruction ReorderingLei Xie, Jidong Zhai, Weimin ZhengDAC 2021 · 12 citations
- Scalable Optimal Layout Synthesis for NISQ Quantum ProcessorsWan-Hsuan Lin, Jason Kimko, Bochen Tan, Nikolaj S. Bjørner et al.DAC 2023 · 34 citations
- 2QAN: a quantum compiler for 2-local qubit hamiltonian simulation algorithmsLingling Lao, Dan E. BrowneISCA 2022 · 37 citations
- DDRoute: a Novel Depth-Driven Approach to the Qubit Routing ProblemAlessandro Annechini, Marco Venere, Donatella Sciuto, Marco D. SantambrogioDAC 2025 · 2 citations
- Leveraging Phase Polynomials for Quantum Circuit OptimizationZihan Chen, Henry Chen, Yuwei Jin, Enhyeok Jang et al.ISCA 2026
