Revisiting the Mapping of Quantum Circuits: Entering the Multi-Core Era
Preprint
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 of qubits, their scalability remains a significant challenge. Modular quantum computing architectures have emerged as a promising approach to scale up quantum computing systems. This paper 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\times$ and $1.6\times$ 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.
Keywords
All Related Versions
This publication has 48 references indexed in Scilit:
- Entanglement across separate silicon dies in a modular superconducting qubit devicenpj Quantum Information, 2021
- Quantum intranetIET Quantum Communication, 2021
- Deterministic quantum state transfer and remote entanglement using microwave photonsNature, 2018
- Optically active quantum dots in monolayer WSe2Nature Nanotechnology, 2015
- Quantum Computation and Quantum Information2012
- Demonstrating the viability of universal quantum computation using teleportation and single-qubit operationsNature, 1999
- Coherent control of macroscopic quantum states in a single-Cooper-pair boxNature, 1999
- Algorithms for partitioning a graphComputers & Industrial Engineering, 1995
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955