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:2508.04464 · Physical Review A

Universal configuration for optimizing randomness generation in variational distributed quantum circuits

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

Published Feb 4, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/pwz2-yg3f

Related papers

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

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

Co-Design of Network Topology and Qubit Allocation for Distributed Quantum Computing

Jiyao Liu, Lei Fan, Yuanxiong Guo +2 more

Distributed Quantum Computing (DQC) enables the execution of quantum circuits across multiple interconnected quantum processing units (QPUs), but requiring efficient qubit allocation and network topology design to optimize computational performance. Proper qubit allocation minimizes entanglement costs across QPUs, balances computational workload, and ensures efficient execution of quantum computing tasks. Meanwhile, network topology plays a crucial role in reducing entanglement routing complexity and communication overhead for remote quantum gate operations. In this paper, we propose a joint optimization framework for network topology design and qubit allocation in DQC to minimize the communication overhead. We formulate the problem as a tractable integer nonlinear programming model that explicitly incorporates entanglement routing, thereby ensuring a more tractable optimization process. To further improve computational efficiency, we present a partially linearized version of the problem, making it solvable using any classical optimization solver. Extensive simulations on both random and real-world quantum circuits validate the effectiveness of our proposed approach, demonstrating its capability to handle complex quantum circuits while reducing communication costs in DQC.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•7 citations

Network Topology Design for Distributed Quantum Computing

Yingling Mao, Yu Liu, Xiaojun Shang +1 more

Distributed Quantum Computing (DQC) has the potential to solve industrial large-scale problems by connecting multiple small quantum processors together to form a larger computing system. Concerning the emerging distributed paradigm, a pivotal challenge lies in crafting specialized network topologies to establish efficient connections among quantum processors while minimizing communication costs. In this paper, we propose a novel DQC topology generation algorithm (DQC-TG) to create optimal and near-optimal network topologies for homogeneous and heterogeneous quantum computers, respectively. Furthermore, for specific quantum circuits requiring diverse communication demands between each pair of qubits, we extend the original algorithm into DQC- TG- Plus to design network topologies tailored for these circuits to further enhance the performance. We perform extensive simulations to evaluate the superiority of the generated network topology designs by our algorithms to baselines.

IEEE International Conference on Distributed Computing Systems (ICDCS)•Jul 23, 2024•7 citations

Time-Aware Qubit Assignment and Circuit Optimization for Distributed Quantum Computing

Leo Sünkel, Jonas Stein, Maximilian Zorn +2 more

The emerging paradigm of distributed quantum computing promises a potential solution to scaling quantum computing to currently unfeasible dimensions. While this approach itself is still in its infancy, and many obstacles must still be overcome before its physical implementation, challenges from the software and algorithmic side must also be identified and addressed. For instance, this paradigm shift requires a new form of compiler that considers the network constraints in general as well as phenomena arising due to the nature of quantum communication. In distributed quantum computing, large circuits are divided into smaller subcircuits such that they can be executed individually and simultaneously on multiple QPUs that are connected through quantum channels. As quantum communication, for example, in the form of teleportation, is expensive, it must be used sparingly. We address the problem of assigning qubits to QPUs to minimize communication costs in two different ways. First by applying time-aware algorithms that take into account the changing connectivity of a given circuit as well as the underlying network topology. We define the optimization problem, use simulated annealing and an evolutionary algorithm and compare the results to graph partitioning and sequential qubit assignment baselines. In another approach, we propose an evolutionary-based quantum circuit optimization algorithm that adjusts the circuit itself rather than the schedule to reduce the overall communication cost. We evaluate the techniques against random circuits and different network topologies. Both evolutionary algorithms outperform the baseline in terms of communication cost reduction. We give an outlook on how the approaches can be integrated into a compilation framework for distributed quantum computing.

arXiv:2507.11707•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•3 citations

Optimal multicore quantum computing with few interconnects

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

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.

arXiv:2501.10247•APL Quantum•Apr 9, 2025•1 citation
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.
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.
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.
Distributed Quantum Computing (DQC) enables the execution of quantum circuits across multiple interconnected quantum processing units (QPUs), but requiring efficient qubit allocation and network topology design to optimize computational performance. Proper qubit allocation minimizes entanglement costs across QPUs, balances computational workload, and ensures efficient execution of quantum computing tasks. Meanwhile, network topology plays a crucial role in reducing entanglement routing complexity and communication overhead for remote quantum gate operations. In this paper, we propose a joint optimization framework for network topology design and qubit allocation in DQC to minimize the communication overhead. We formulate the problem as a tractable integer nonlinear programming model that explicitly incorporates entanglement routing, thereby ensuring a more tractable optimization process. To further improve computational efficiency, we present a partially linearized version of the problem, making it solvable using any classical optimization solver. Extensive simulations on both random and real-world quantum circuits validate the effectiveness of our proposed approach, demonstrating its capability to handle complex quantum circuits while reducing communication costs in DQC.
Distributed Quantum Computing (DQC) has the potential to solve industrial large-scale problems by connecting multiple small quantum processors together to form a larger computing system. Concerning the emerging distributed paradigm, a pivotal challenge lies in crafting specialized network topologies to establish efficient connections among quantum processors while minimizing communication costs. In this paper, we propose a novel DQC topology generation algorithm (DQC-TG) to create optimal and near-optimal network topologies for homogeneous and heterogeneous quantum computers, respectively. Furthermore, for specific quantum circuits requiring diverse communication demands between each pair of qubits, we extend the original algorithm into DQC- TG- Plus to design network topologies tailored for these circuits to further enhance the performance. We perform extensive simulations to evaluate the superiority of the generated network topology designs by our algorithms to baselines.
The emerging paradigm of distributed quantum computing promises a potential solution to scaling quantum computing to currently unfeasible dimensions. While this approach itself is still in its infancy, and many obstacles must still be overcome before its physical implementation, challenges from the software and algorithmic side must also be identified and addressed. For instance, this paradigm shift requires a new form of compiler that considers the network constraints in general as well as phenomena arising due to the nature of quantum communication. In distributed quantum computing, large circuits are divided into smaller subcircuits such that they can be executed individually and simultaneously on multiple QPUs that are connected through quantum channels. As quantum communication, for example, in the form of teleportation, is expensive, it must be used sparingly. We address the problem of assigning qubits to QPUs to minimize communication costs in two different ways. First by applying time-aware algorithms that take into account the changing connectivity of a given circuit as well as the underlying network topology. We define the optimization problem, use simulated annealing and an evolutionary algorithm and compare the results to graph partitioning and sequential qubit assignment baselines. In another approach, we propose an evolutionary-based quantum circuit optimization algorithm that adjusts the circuit itself rather than the schedule to reduce the overall communication cost. We evaluate the techniques against random circuits and different network topologies. Both evolutionary algorithms outperform the baseline in terms of communication cost reduction. We give an outlook on how the approaches can be integrated into a compilation framework for distributed quantum computing.
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.