Nuwa: A Quantum Circuit Transpiler Based on a Finite-Horizon Heuristic for Placement and Routing

Abstract

We introduce a novel transpiler for the placement and routing of quantum circuits on arbitrary target hardware architectures. We use finite-horizon, and optionally discounted, reward functions to heuristically find a suitable placement and routing policy. We employ a finite lookahead to refine the reward functions when breaking a tie between multiple policies. We benchmark our transpiler against multiple alternative solutions and on various test sets of quantum algorithms to demonstrate the benefits of our approach.

11 pages, 7 figures, 3 tables

References in corpus (6)

• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Focus beyond quadratic speedups for error-corrected quantum advantage
• Optimized Surface Code Communication in Superconducting Quantum Computers
• Circuit Transformations for Quantum Architectures
• Exploiting Quantum Teleportation in Quantum Circuit Mapping
• Using Reinforcement Learning to find Efficient Qubit Routing Policies for Deployment in Near-term Quantum Computers