Divide-et-impera Heuristic-based Randomized Search for the Qubit Routing Problem

Marco Baioletti, Fabrizio Fagiolo, Angelo Oddi +1

This paper introduces the DIRSH algorithm for the Qubit Routing Problem (QRP), using a heuristic-guided randomized divide-and-conquer strategy. The method splits the circuit into c…