Mapping quantum algorithms to multi-core quantum computing architectures
Anabel Ovide (Universitat Politécnica de Valencia)
Santiago Rodrigo (Universitat Politecnica de Catalunya)
M. Bandic (TU Delft - QCD/Almudever Lab, TU Delft - QCD/Feld Group)
J. van Someren (TU Delft - QCD/Feld Group)
S. Feld (TU Delft - Quantum Circuit Architectures and Technology)
Sergi Abadal (Universitat Politecnica de Catalunya)
Eduard Alarcón (Universitat Politecnica de Catalunya)
Carmen G. Almudever (Universitat Politécnica de Valencia)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
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.