Nuwa: A Quantum Circuit Transpiler Based on a Finite-Horizon Heuristic for Placement and Routing
Shengru Ren, KaWai Chen, Navid Ghadermarzy, Brandon Nguyen, Yanhao, Huang, Pooya Ronagh

TL;DR
Nuwa is a quantum circuit transpiler that uses finite-horizon heuristics and lookahead strategies to optimize placement and routing on diverse hardware architectures, improving performance over existing methods.
Contribution
It introduces a novel heuristic-based transpiler employing finite-horizon reward functions and lookahead refinement for quantum circuit placement and routing.
Findings
Benchmark results show improved routing efficiency.
Outperforms alternative solutions on various quantum algorithms.
Demonstrates flexibility across hardware architectures.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Parallel Computing and Optimization Techniques
