Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2501.10247 · APL Quantum

Optimal multicore quantum computing with few interconnects

J. Montes, F. Borondo, Gabriel G. Carlo

Published Apr 9, 2025• 1 citation
arXivHTMLPDF

Abstract

Noisy intermediate-scale quantum processors have produced a quantum computation revolution in recent times. However, to make further advances, new strategies to overcome the error rate growth are needed. One possible way out is dividing these devices into many cores. On the other hand, the majorization criterion efficiently classifies quantum circuits in terms of their complexity, which can be directly related to their ability of performing non-classically simulatable computations. In this paper, we use this criterion to study the complexity behavior of a paradigmatic universal family of random circuits distributed into several cores with different architectures. We find that the optimal complexity is reached with few interconnects, giving further hope to actual implementations in available devices at present. A universal behavior is found irrespective of the architecture and (approximately) the core size. We also analyze the complexity properties when scaling processors up by means of adding cores of the same size. We provide a conjecture to explain the results.

DOI
10.1063/5.0252348

Related papers

Characterizing the Inter-Core Qubit Traffic in Large-Scale Quantum Modular Architectures

Sahar Ben Rached, Isaac Lopez Agudo, Santiago Rodrigo +7 more

Modular quantum processor architectures are envisioned as a promising solution for the scalability of quantum computing systems beyond the Noisy Intermediate Scale Quantum (NISQ) era. Based upon interconnecting tens to hundreds of quantum processors (i.e cores) via quantum coherent and classical links, this approach unravels the pressing limitations of densely qubit-packed monolithic processors, mainly by mitigating the requirements of qubit control and enhancing qubit isolation. Therefore, this new architectural design enables executing large-scale algorithms in a distributed manner. In order to assess the performance and optimize such architectures, it is crucial to analyze the quantum state transfers occurring via inter-core communication networks, referred to as inter-core qubit traffic. This would provide insights to improve the software and hardware stack for multi-core quantum computers. To this aim, we present a characterization of the spatio-temporal inter-core qubit traffic for different large-scale quantum algorithms. The programs are compiled on an all-to-all connected multi-core architecture that supports up to around 1000 qubits. We characterize the qubit traffic based on multiple performance metrics to assess the computational process and the communication overhead. Based on the showcased results, we conclude on the parallelization and scalability of presented algorithms, qualitatively evaluate the resource requirements as we scale circuit sizes, and lay the foundations of application-oriented benchmarking of large-scale multi-core architectures.

arXiv:2310.01921•IEEE Access•Jan 1, 2025•6 citations

Optimal Complexity of Parameterized Quantum Circuits

Guilherme Ilário Correr, Pedro C. Azado, Diogo O. Soares-Pinto +1 more

Parameterized quantum circuits are central to the development of variational quantum algorithms in the NISQ era. A key feature of these circuits is their ability to generate an expressive set of quantum states, enabling the approximation of solutions to diverse problems. The expressibility of such circuits can be assessed by analyzing the ensemble of states produced when their parameters are randomly sampled, a property closely tied to quantum complexity. In this work, we compare different classes of parameterized quantum circuits with a prototypical family of universal random circuits to investigate how rapidly they approach the asymptotic complexity defined by the Haar measure. We find that parameterized circuits exhibit faster convergence in terms of the number of gates required, as quantified through expressibility and majorization-based complexity measures. Moreover, the topology of qubit connections proves crucial, significantly affecting entanglement generation and, consequently, complexity growth. The majorization criterion emerges as a valuable complementary tool, offering distinct insights into the behavior of random state generation in the considered circuit families.

arXiv:2405.19537•Entropy•Jan 8, 2026•3 citations

Universal configuration for optimizing randomness generation in variational distributed quantum circuits

J. Montes, F. Borondo, Gabriel G. Carlo

Distributed quantum computing represents at present one of the most promising approaches to scaling quantum processors. Current implementations typically partition circuits into multiple cores, each composed of several qubits, with inter-core connectivity playing a central role in ensuring scalability. Identifying the optimal configuration -- defined as the arrangement that maximizes circuit complexity with minimal depth -- thus constitutes a fundamental design challenge. In this work, we demonstrate, both analytically and numerically, the existence of a universal optimal configuration for distributing single and two qubit gates across arbitrary intercore communication topologies in variational distributed circuits. Our proof is based on a complexity measure based on Markov matrices, which quantifies the convergence rate toward the Haar measure, as introduced by Weinstein et al. Finally, we validate our predictions through numerical comparisons with the well established majorization criterion proposed in Ref 2.

arXiv:2508.04464•Physical Review A•Feb 4, 2026•0 citations

Revisiting the Mapping of Quantum Circuits: Entering the Multi-core Era

Pau Escofet, Anabel Ovide, Medina Bandić +6 more

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.

arXiv:2403.17205•ACM Transactions on Quantum Computing•Mar 30, 2024•43 citations

Multicore Quantum Computing

Hamza Jnane, Brennan Undseth, Zhenyu Cai +2 more

Any architecture for practical quantum computing must be scalable. An attractive approach is to create multiple cores, computing regions of fixed size that are well spaced but interlinked with communication channels. This exploded architecture can relax the demands associated with a single monolithic device: the complexity of control, cooling and power infrastructure, as well as the difficulties of crosstalk suppression and near-perfect component yield. Here we explore interlinked multicore architectures through analytic and numerical modeling. While elements of our analysis are relevant to diverse platforms, our focus is on semiconductor electron spin systems in which numerous cores may exist on a single chip within a single fridge. We model shuttling and microwave-based interlinks and estimate the achievable fidelities, finding values that are encouraging but markedly inferior to intracore operations. We therefore introduce optimized entanglement purification to enable high-fidelity communication, finding that $99.5\mathrm{%}$ is a very realistic goal. We then assess the prospects for quantum advantage using such devices in the noisy intermediate-scale quantum era and beyond: we simulate recently proposed exponentially powerful error mitigation schemes in the multicore environment and conclude that these techniques impressively suppress imperfections in both the inter- and intracore operations.

arXiv:2201.08861•Physical Review Applied•Oct 26, 2022•71 citations

Optimal quantum reservoir computing for the noisy intermediate-scale quantum era

Laia Domingo, Gabriel G. Carlo, F. Borondo

Universal fault-tolerant quantum computers require millions of qubits with low error rates. Since this technology is years ahead, noisy intermediate-scale quantum (NISQ) computation is receiving tremendous interest. In this setup, quantum reservoir computing is a relevant machine learning algorithm. Its simplicity of training and implementation allows to perform challenging computations on today's available machines. In this Letter, we provide a criterion to select optimal quantum reservoirs, requiring few and simple gates. Our findings demonstrate that they render better results than other commonly used models with significantly less gates and also provide insight on the theoretical gap between quantum reservoir computing and the theory of quantum states' complexity.

arXiv:2205.10107•Physical review. E•Oct 13, 2022•38 citations
Noisy intermediate-scale quantum processors have produced a quantum computation revolution in recent times. However, to make further advances, new strategies to overcome the error rate growth are needed. One possible way out is dividing these devices into many cores. On the other hand, the majorization criterion efficiently classifies quantum circuits in terms of their complexity, which can be directly related to their ability of performing non-classically simulatable computations. In this paper, we use this criterion to study the complexity behavior of a paradigmatic universal family of random circuits distributed into several cores with different architectures. We find that the optimal complexity is reached with few interconnects, giving further hope to actual implementations in available devices at present. A universal behavior is found irrespective of the architecture and (approximately) the core size. We also analyze the complexity properties when scaling processors up by means of adding cores of the same size. We provide a conjecture to explain the results.
Modular quantum processor architectures are envisioned as a promising solution for the scalability of quantum computing systems beyond the Noisy Intermediate Scale Quantum (NISQ) era. Based upon interconnecting tens to hundreds of quantum processors (i.e cores) via quantum coherent and classical links, this approach unravels the pressing limitations of densely qubit-packed monolithic processors, mainly by mitigating the requirements of qubit control and enhancing qubit isolation. Therefore, this new architectural design enables executing large-scale algorithms in a distributed manner. In order to assess the performance and optimize such architectures, it is crucial to analyze the quantum state transfers occurring via inter-core communication networks, referred to as inter-core qubit traffic. This would provide insights to improve the software and hardware stack for multi-core quantum computers. To this aim, we present a characterization of the spatio-temporal inter-core qubit traffic for different large-scale quantum algorithms. The programs are compiled on an all-to-all connected multi-core architecture that supports up to around 1000 qubits. We characterize the qubit traffic based on multiple performance metrics to assess the computational process and the communication overhead. Based on the showcased results, we conclude on the parallelization and scalability of presented algorithms, qualitatively evaluate the resource requirements as we scale circuit sizes, and lay the foundations of application-oriented benchmarking of large-scale multi-core architectures.
Parameterized quantum circuits are central to the development of variational quantum algorithms in the NISQ era. A key feature of these circuits is their ability to generate an expressive set of quantum states, enabling the approximation of solutions to diverse problems. The expressibility of such circuits can be assessed by analyzing the ensemble of states produced when their parameters are randomly sampled, a property closely tied to quantum complexity. In this work, we compare different classes of parameterized quantum circuits with a prototypical family of universal random circuits to investigate how rapidly they approach the asymptotic complexity defined by the Haar measure. We find that parameterized circuits exhibit faster convergence in terms of the number of gates required, as quantified through expressibility and majorization-based complexity measures. Moreover, the topology of qubit connections proves crucial, significantly affecting entanglement generation and, consequently, complexity growth. The majorization criterion emerges as a valuable complementary tool, offering distinct insights into the behavior of random state generation in the considered circuit families.
Distributed quantum computing represents at present one of the most promising approaches to scaling quantum processors. Current implementations typically partition circuits into multiple cores, each composed of several qubits, with inter-core connectivity playing a central role in ensuring scalability. Identifying the optimal configuration -- defined as the arrangement that maximizes circuit complexity with minimal depth -- thus constitutes a fundamental design challenge. In this work, we demonstrate, both analytically and numerically, the existence of a universal optimal configuration for distributing single and two qubit gates across arbitrary intercore communication topologies in variational distributed circuits. Our proof is based on a complexity measure based on Markov matrices, which quantifies the convergence rate toward the Haar measure, as introduced by Weinstein et al. Finally, we validate our predictions through numerical comparisons with the well established majorization criterion proposed in Ref 2.
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.
Any architecture for practical quantum computing must be scalable. An attractive approach is to create multiple cores, computing regions of fixed size that are well spaced but interlinked with communication channels. This exploded architecture can relax the demands associated with a single monolithic device: the complexity of control, cooling and power infrastructure, as well as the difficulties of crosstalk suppression and near-perfect component yield. Here we explore interlinked multicore architectures through analytic and numerical modeling. While elements of our analysis are relevant to diverse platforms, our focus is on semiconductor electron spin systems in which numerous cores may exist on a single chip within a single fridge. We model shuttling and microwave-based interlinks and estimate the achievable fidelities, finding values that are encouraging but markedly inferior to intracore operations. We therefore introduce optimized entanglement purification to enable high-fidelity communication, finding that $99.5\mathrm{%}$ is a very realistic goal. We then assess the prospects for quantum advantage using such devices in the noisy intermediate-scale quantum era and beyond: we simulate recently proposed exponentially powerful error mitigation schemes in the multicore environment and conclude that these techniques impressively suppress imperfections in both the inter- and intracore operations.
Universal fault-tolerant quantum computers require millions of qubits with low error rates. Since this technology is years ahead, noisy intermediate-scale quantum (NISQ) computation is receiving tremendous interest. In this setup, quantum reservoir computing is a relevant machine learning algorithm. Its simplicity of training and implementation allows to perform challenging computations on today's available machines. In this Letter, we provide a criterion to select optimal quantum reservoirs, requiring few and simple gates. Our findings demonstrate that they render better results than other commonly used models with significantly less gates and also provide insight on the theoretical gap between quantum reservoir computing and the theory of quantum states' complexity.