Revisiting the Mapping of Quantum Circuits

Entering the Multi-core Era

Journal Article (2025)
Author(s)

Pau Escofet (Universitat Politecnica de Catalunya)

Anabel Ovide (Universitat Politécnica de Valencia)

M. Bandic (TU Delft - QCD/Feld Group)

Luise Prielinger (TU Delft - QCD/Feld Group)

J. Van Someren (TU Delft - QCD/Feld Group)

Sebastian Feld (TU Delft - QCD/Feld Group)

Eduard Alarcón (Universitat Politecnica de Catalunya)

Sergi Abadal (Universitat Politecnica de Catalunya)

Carmen Almudever (Universitat Politécnica de Valencia)

Research Group
QCD/Feld Group
DOI related publication
https://doi.org/10.1145/3655029
More Info
expand_more
Publication Year
2025
Language
English
Research Group
QCD/Feld Group
Issue number
1
Volume number
6
Reuse Rights

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

Quantum computing represents a paradigm shift in computation, offering the potential to solve complex problems intractable for classical computers. Although current quantum processors already consist of a few hundred qubits, their scalability remains a significant challenge. Modular quantum computing architectures have emerged as a promising approach to scale up quantum computing systems. This article delves into the critical aspects of distributed multi-core quantum computing, focusing on quantum circuit mapping, a fundamental task to successfully execute quantum algorithms across cores while minimizing inter-core communications. We derive the theoretical bounds on the number of non-local communications needed for random quantum circuits and introduce the Hungarian Qubit Assignment (HQA) algorithm, a multi-core mapping algorithm designed to optimize qubit assignments to cores with the aim of reducing inter-core communications. Our exhaustive evaluation of HQA against state-of-the-art circuit mapping algorithms for modular architectures reveals a 4.9× and 1.6× improvement in terms of execution time and non-local communications, respectively, compared to the best-performing algorithm. HQA emerges as a very promising scalable approach for mapping quantum circuits into multi-core architectures, positioning it as a valuable tool for harnessing the potential of quantum computing at scale.

Files

3655029.pdf
(pdf | 3.71 Mb)
- Embargo expired in 14-07-2025
License info not available