Content area
Abstract
To bridge the gap between high-level quantum programs and hardware constraints, efficient circuit transpilation is essential for generating executable, hardware-compliant quantum circuits. We present a complete transpilation framework that integrates three synergistic passes. The reuse pass improves qubit locality by greedily identifying valid reuse pairs. The mapping pass generates initial layouts based on qubit priority lists and refines them through a stochastic search. The routing pass integrates Bridge gates directly into the scoring and selection process, enabling more consistent decisions and reducing routing overhead. Compared to state-of-the-art transpilers, our approach achieves up to 14.33% reduction in CX gates and an average 19.1% reduction in qubit count. Our results show that each individual pass improves performance, and their combination yields even greater benefits. This work highlights the effectiveness of a reuse-aware transpilation strategy for scalable and hardware-efficient quantum computing.
