14 January 2025 in ACM Transactions on Quantum Computing
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.
31 May 2025 in npj Quantum Information
When physical architectures become too complex for analytical study, numerical simulation proves essential to investigate quantum network behavior. Although highly informative, these simulations involve intricate numerical functions without known analytical forms, making traditional optimization techniques that assume continuity, differentiability, or convexity inapplicable. We introduce a more efficient computational framework that employs machine learning models as surrogates for the objective function. We demonstrate the effectiveness of our approach by applying it to three well-known optimization problems in quantum networking: allocating quantum memory across multiple nodes, tuning an experimental parameter in every physical link of a quantum entanglement switch, and finding effective protocol configurations in a large asymmetric quantum network. Our algorithm consistently outperforms Simulated Annealing and Bayesian optimization within the allotted time, improving results by up to 29% and 28%, respectively. Our framework will thus allow for more comprehensive quantum network studies, integrating surrogate-assisted optimization with existing quantum network simulators.
1 January 2026 in IEEE Journal on Selected Areas in Communications