Using Reinforcement Learning to find Efficient Qubit Routing Policies for Deployment in Near-term Quantum Computers

Abstract

This paper addresses the problem of qubit routing in first-generation and other near-term quantum computers. In particular, it is asserted that the qubit routing problem can be formulated as a reinforcement learning (RL) problem, and that this is sufficient, in principle, to discover the optimal qubit routing policy for any given quantum computer architecture. In order to achieve this, it is necessary to alter the conventional RL framework to allow combinatorial action space, and this represents a second contribution of this paper, which is expected to find additional application, beyond the qubit routing problem addressed herein. Numerical results are included demonstrating the advantage of the RL-trained qubit routing policy over using a sorting network.

Reference added. 13 pages, 7 figures

References in corpus (10)

• Continuous control with deep reinforcement learning
• Quantum Computing in the NISQ era and beyond
• Playing Atari with Deep Reinforcement Learning
• Elementary gates for quantum computation
• ProjectQ: An Open Source Software Framework for Quantum Computing
• Efficient Distributed Quantum Computing
• Superconducting Qubits: A Short Review
• Compiling quantum circuits to realistic hardware architectures using temporal planners
• Reinforcement Learning with External Knowledge and Two-Stage Q-functions for Predicting Popular Reddit Threads
• Advantages of a modular high-level quantum programming framework

Cited by in corpus (4)

• Reinforcement learning for optimization of variational quantum circuit architectures
• SpinQ: Compilation strategies for scalable spin-qubit architectures
• Realizing Quantum Algorithms on Real Quantum Computing Devices
• Nuwa: A Quantum Circuit Transpiler Based on a Finite-Horizon Heuristic for Placement and Routing