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

IEEE Interregional NEWCAS Conference (NEWCAS)

Synthesis of Application-Specific Quantum Network-on-Chip

Milad Eslaminia, Sébastien Le Beux

Published Jun 1, 2026• 0 citations
Publisher

Abstract

Distributed quantum computing (DQC) enables scalable quantum systems by connecting multiple QPUs, but performance is limited by inter-QPU communication resources such as communication qubits, entanglement generation, and link capacity. This motivates application-specific Quantum NoC (QNoC) design, where the interconnect is tailored to the application workload. We present an automated QNoC synthesis framework for multi-QPU architectures using dedicated communication qubits with LTM interfaces and a silicon-photonic entanglement distribution network (EDN). The flow explores candidate subnet mappings and link configurations, evaluates them through transpilation, and ranks them using a weighted score based on communication usage, SWAP overhead, and execution time. Experiments on benchmark circuits show workloaddependent trade-offs and demonstrate that application-specific QNoC synthesis can reveal useful architectural design insights.

DOI
10.1109/newcas64543.2026.11673963

Related papers

A Modular, Topology-Aware Software Stack for Entanglement-Based Distributed Quantum Computing

Luke Andreesen, Shobhit Gupta, Sean Sullivan +1 more

Distributed quantum computing (DQC) seeks to scale beyond the limits of monolithic processors by interconnecting multiple quantum processing units (QPUs) through entanglement-based links. Realizing this vision requires the co-design of hardware and software across the domains of quantum networking, compilation, and scheduling, yet existing tools remain fragmented between monolithic circuit compilers and long-distance quantum network simulators. We present an open-source, topology-informed framework for the compilation and scheduling of distributed quantum programs. Given an input circuit and a description of the target network, the framework partitions and reconstructs the circuit into a distributed program that respects the specified inter- and intra-QPU topology, covers cross-QPU operations through gate and state teleportation, and schedules the result under either deterministic or stochastic entanglement-generation models. By accepting and emitting standard OpenQASM, the framework interoperates with existing monolithic toolchains, and its standardized module interfaces allow partitioning and scheduling strategies to be interchanged and benchmarked. Using this framework, we show that the best-performing compilation strategy varies across the tested circuits and network configurations, and that both network topology and intra-QPU connectivity substantially affect the entanglement cost of execution. These findings underscore the need for a co-design approach to distributed quantum computing, which our framework is designed to support.

quant-pharXiv:2609.15728•Sep 15, 2026•0 citations

Distributed quantum computing via enhanced connectivity

Jiyao Liu

As quantum computing transitions into the Noisy Intermediate-Scale Quantum (NISQ) era, scaling monolithic quantum processors remains a significant challenge due to decoherence and operational noise. This dissertation proposes enhancing the connectivity of distributed quantum systems as a scalable solution, focusing on three major research tasks: architectural co-design, operation scheduling optimization, and network topology design. First, to address the physical qubit limits of single-chip processors, we investigate the co-design of network topology and logical qubit allocation for Distributed Quantum Computing (DQC). By modeling qubit interaction as a graph partition problem, we propose a joint optimization framework to minimize inter-QPU communication overhead. Our results demonstrate that the proposed linearized formulation, TACO-L, significantly outperforms traditional two-stage methods in executing complex quantum circuits. Second, we address the challenge of maintaining high-fidelity long-distance entanglements through the optimization of Swapping and Purification Schemes (SPS). We prove that in Binary systems, any optimal swapping and purification tree (OSPT) must follow a Restricted SPT (RT) pattern, where purification is integrated at the link level prior to swapping. Furthermore, we introduce the gradient-based GradTree algorithm, which enables an efficient search for low-cost, high-fidelity scheduling in complex noise environments. Finally, this dissertation formulates the first general Topology Design Problem (TDP) for quantum networks, jointly optimizing quantum memory allocation, optical channel deployment, and entanglement scheduling. By analyzing flow-based and path-based formulations, we prove the optimality of the Relaxed Complete Swapping Tree (RCST) in minimizing the expected cost of entanglement distribution. Collectively, these contributions provide a comprehensive theoretical and algorithmic framework for building scalable, cost-effective global quantum internet architectures.

•Jun 11, 2026•0 citations

A Resource Estimation Model for the Hardware-Software Co-Design of Distributed Quantum Architectures

Raymond P. H. Wu, Chathurika Ranaweera, Sutharshan Rajasegarar +3 more

In distributed quantum computing (DQC), executing monolithic quantum circuits across multiple interconnected quantum processing units (QPUs) requires dedicated communication qubits to generate and distribute entanglement. Because the number of physical qubits within a QPU is finite, a trade-off emerges where allocating more communication qubits increases the capacity of quantum channels for concurrent non-local operations, but reduces the number of computational qubits available for local gate operations. Distributed quantum compilation routinely ignores this channel capacity, while hardware architects lack a method to determine it prior to quantum circuit partitioning. Moreover, scheduling entanglement on demand introduces severe latency, whereas pre-fetching exposes stored pairs to decoherence. We propose an economic order quantity model from perishable inventory theory to optimize the trade-off between entanglement distribution latency and the time cost of decoherence. The resulting estimate is driven by algorithmic demand and physical constraints, offering a dual application for the hardware-software co-design of high-performance DQC: for hardware architects, it gives the optimal allocation of dedicated communication qubits in static heterogeneous architectures; for compiler developers, it gives the optimal number to reserve dynamically in homogeneous architectures.

quant-pharXiv:2607.22998•Jul 28, 2026•0 citations

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

Resource Management and Circuit Scheduling for Distributed Quantum Computing Interconnect Networks

Sima Bahrani, Romerson Deiny Oliveira, Juan Marcelo Parra-Ullauri +2 more

Distributed quantum computing (DQC) has emerged as a promising approach to overcome the scalability limitations of monolithic quantum processors in terms of computational capability. However, realising the full potential of DQC requires effective resource management and circuit scheduling. This involves efficiently assigning each circuit to a subset of quantum processing units (QPUs), based on factors such as their computational power and connectivity. In heterogeneous DQC networks with arbitrary connectivity topologies and non-identical QPUs, this becomes a complex challenge. This paper addresses resource management and circuit scheduling in such settings, with a focus on computing resource allocation in a quantum data centre. We propose circuit scheduling algorithms based on Mixed-Integer Linear Programming (MILP). Our MILP model accounts for errors arising from inter-QPU communication. In particular, the proposed schemes consider key factors, including network topology, QPU capacities, and quantum circuit structure, to make efficient scheduling and allocation decisions. Simulation results demonstrate that our proposed algorithms significantly improve circuit execution time and scheduling efficiency (measured by makespan and throughput), while also reducing inter-QPU communication overhead, compared to baseline strategies. This work provides valuable insights into resource management strategies for scalable and heterogeneous DQC systems.

arXiv:2409.12675•IEEE Journal on Selected Areas in Communications•Jan 1, 2026•11 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
Distributed quantum computing (DQC) enables scalable quantum systems by connecting multiple QPUs, but performance is limited by inter-QPU communication resources such as communication qubits, entanglement generation, and link capacity. This motivates application-specific Quantum NoC (QNoC) design, where the interconnect is tailored to the application workload. We present an automated QNoC synthesis framework for multi-QPU architectures using dedicated communication qubits with LTM interfaces and a silicon-photonic entanglement distribution network (EDN). The flow explores candidate subnet mappings and link configurations, evaluates them through transpilation, and ranks them using a weighted score based on communication usage, SWAP overhead, and execution time. Experiments on benchmark circuits show workloaddependent trade-offs and demonstrate that application-specific QNoC synthesis can reveal useful architectural design insights.
Distributed quantum computing (DQC) seeks to scale beyond the limits of monolithic processors by interconnecting multiple quantum processing units (QPUs) through entanglement-based links. Realizing this vision requires the co-design of hardware and software across the domains of quantum networking, compilation, and scheduling, yet existing tools remain fragmented between monolithic circuit compilers and long-distance quantum network simulators. We present an open-source, topology-informed framework for the compilation and scheduling of distributed quantum programs. Given an input circuit and a description of the target network, the framework partitions and reconstructs the circuit into a distributed program that respects the specified inter- and intra-QPU topology, covers cross-QPU operations through gate and state teleportation, and schedules the result under either deterministic or stochastic entanglement-generation models. By accepting and emitting standard OpenQASM, the framework interoperates with existing monolithic toolchains, and its standardized module interfaces allow partitioning and scheduling strategies to be interchanged and benchmarked. Using this framework, we show that the best-performing compilation strategy varies across the tested circuits and network configurations, and that both network topology and intra-QPU connectivity substantially affect the entanglement cost of execution. These findings underscore the need for a co-design approach to distributed quantum computing, which our framework is designed to support.
As quantum computing transitions into the Noisy Intermediate-Scale Quantum (NISQ) era, scaling monolithic quantum processors remains a significant challenge due to decoherence and operational noise. This dissertation proposes enhancing the connectivity of distributed quantum systems as a scalable solution, focusing on three major research tasks: architectural co-design, operation scheduling optimization, and network topology design. First, to address the physical qubit limits of single-chip processors, we investigate the co-design of network topology and logical qubit allocation for Distributed Quantum Computing (DQC). By modeling qubit interaction as a graph partition problem, we propose a joint optimization framework to minimize inter-QPU communication overhead. Our results demonstrate that the proposed linearized formulation, TACO-L, significantly outperforms traditional two-stage methods in executing complex quantum circuits. Second, we address the challenge of maintaining high-fidelity long-distance entanglements through the optimization of Swapping and Purification Schemes (SPS). We prove that in Binary systems, any optimal swapping and purification tree (OSPT) must follow a Restricted SPT (RT) pattern, where purification is integrated at the link level prior to swapping. Furthermore, we introduce the gradient-based GradTree algorithm, which enables an efficient search for low-cost, high-fidelity scheduling in complex noise environments. Finally, this dissertation formulates the first general Topology Design Problem (TDP) for quantum networks, jointly optimizing quantum memory allocation, optical channel deployment, and entanglement scheduling. By analyzing flow-based and path-based formulations, we prove the optimality of the Relaxed Complete Swapping Tree (RCST) in minimizing the expected cost of entanglement distribution. Collectively, these contributions provide a comprehensive theoretical and algorithmic framework for building scalable, cost-effective global quantum internet architectures.
In distributed quantum computing (DQC), executing monolithic quantum circuits across multiple interconnected quantum processing units (QPUs) requires dedicated communication qubits to generate and distribute entanglement. Because the number of physical qubits within a QPU is finite, a trade-off emerges where allocating more communication qubits increases the capacity of quantum channels for concurrent non-local operations, but reduces the number of computational qubits available for local gate operations. Distributed quantum compilation routinely ignores this channel capacity, while hardware architects lack a method to determine it prior to quantum circuit partitioning. Moreover, scheduling entanglement on demand introduces severe latency, whereas pre-fetching exposes stored pairs to decoherence. We propose an economic order quantity model from perishable inventory theory to optimize the trade-off between entanglement distribution latency and the time cost of decoherence. The resulting estimate is driven by algorithmic demand and physical constraints, offering a dual application for the hardware-software co-design of high-performance DQC: for hardware architects, it gives the optimal allocation of dedicated communication qubits in static heterogeneous architectures; for compiler developers, it gives the optimal number to reserve dynamically in homogeneous architectures.
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.
Distributed quantum computing (DQC) has emerged as a promising approach to overcome the scalability limitations of monolithic quantum processors in terms of computational capability. However, realising the full potential of DQC requires effective resource management and circuit scheduling. This involves efficiently assigning each circuit to a subset of quantum processing units (QPUs), based on factors such as their computational power and connectivity. In heterogeneous DQC networks with arbitrary connectivity topologies and non-identical QPUs, this becomes a complex challenge. This paper addresses resource management and circuit scheduling in such settings, with a focus on computing resource allocation in a quantum data centre. We propose circuit scheduling algorithms based on Mixed-Integer Linear Programming (MILP). Our MILP model accounts for errors arising from inter-QPU communication. In particular, the proposed schemes consider key factors, including network topology, QPU capacities, and quantum circuit structure, to make efficient scheduling and allocation decisions. Simulation results demonstrate that our proposed algorithms significantly improve circuit execution time and scheduling efficiency (measured by makespan and throughput), while also reducing inter-QPU communication overhead, compared to baseline strategies. This work provides valuable insights into resource management strategies for scalable and heterogeneous DQC systems.
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.