Using Reinforcement Learning to Perform Qubit Routing in Quantum Compilers

Abstract

"Qubit routing" refers to the task of modifying quantum circuits so that they satisfy the connectivity constraints of a target quantum computer. This involves inserting SWAP gates into the circuit so that the logical gates only ever occur between adjacent physical qubits. The goal is to minimise the circuit depth added by the SWAP gates. In this paper, we propose a qubit routing procedure that uses a modified version of the deep Q-learning paradigm. The system is able to outperform the qubit routing procedures from two of the most advanced quantum compilers currently available, on both random and realistic circuits, across near-term architecture sizes.

13 pages, 12 figures

Cited by in corpus (6)

• Noisy intermediate-scale quantum (NISQ) algorithms
• NetQASM -- A low-level instruction set architecture for hybrid quantum-classical programs in a quantum internet
• Mapping quantum circuits to modular architectures with QUBO
• Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm
• SpinQ: Compilation strategies for scalable spin-qubit architectures
• Supervised Learning Enhanced Quantum Circuit Transformation