Mapping quantum algorithms to multi-core quantum computing architectures

Abstract

Current monolithic quantum computer architectures have limited scalability. One promising approach for scaling them up is to use a modular or multi-core architecture, in which different quantum processors (cores) are connected via quantum and classical links. This new architectural design poses new challenges such as the expensive inter-core communication. To reduce these movements when executing a quantum algorithm, an efficient mapping technique is required. In this paper, a detailed critical discussion of the quantum circuit mapping problem for multi-core quantum computing architectures is provided. In addition, we further explore the performance of a mapping method, which is formulated as a partitioning over time graph problem, by performing an architectural scalability analysis.

A Modular Quantum Compilation Framework for Distributed Quantum Computing

“…Ovide et al [26], investigate the performance of the qubit assignment strategy proposed by Baker et al [27] on the Cuccaro and QFT adder circuits [35], [36], under the assumption of local and network all-to-all connectivity. In [27], qubit assignment is treated as a graph partitioning problem, under the assumption that a SWAP operation primitive exists to exchange data qubits between different QPUs.…”