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:2301.03977 · Pervasive and Mobile Computing

Service differentiation and fair sharing in distributed quantum computing

Claudio Cicconetti, Marco Conti, Andrea Passarella

Published Feb 7, 2023• 5 citations
arXivHTMLPDF

Abstract

In the future, quantum computers will become widespread and a network of quantum repeaters will provide them with end-to-end entanglement of remote quantum bits. As a result, a pervasive quantum computation infrastructure will emerge, which will unlock several novel applications, including distributed quantum computing, that is the pooling of resources on multiple computation nodes to address problem instances that are unattainable by any individual quantum computer. In this paper, we first investigate the issue of service differentiation in this new environment. Then, we define the problem of how to select which computation nodes should participate in each pool, so as to achieve a fair share of the quantum network resources available. The analysis is performed via an open source simulator and the results are fully and readily available.

DOI
10.1016/j.pmcj.2023.101758

Related papers

Resource Allocation in Quantum Networks for Distributed Quantum Computing

Claudio Cicconetti, Marco Conti, Andrea Passarella

The evolution of quantum computing technologies has been advancing at a steady pace in the recent years, and the current trend suggests that it will become available at scale for commercial purposes in the near future. The acceleration can be boosted by pooling compute infrastructures to either parallelize algorithm execution or solve bigger instances that are not feasible on a single quantum computer, which requires an underlying Quantum Internet: the interconnection of quantum computers by quantum links and repeaters to exchange entangled quantum bits. However, Quantum Internet research so far has been focused on provisioning point-to-point flows only, which is suitable for (e.g.) quantum sensing and metrology, but not for distributed quantum computing. In this paper, after a primer on quantum computing and networking, we investigate the requirements and objectives of smart computing on distributed nodes from the perspective of quantum network provisioning. We then design a resource allocation strategy that is evaluated through a comprehensive simulation campaign, whose results highlight the key features and performance issues, and lead the way to further investigation in this direction.

arXiv:2203.05844•IEEE International Conference on Smart Computing•Jun 1, 2022•49 citations

Quality of Service in Quantum Networks

Claudio Cicconetti, Marco Conti, Andrea Passarella

In the coming years, quantum networks will allow quantum applications to thrive thanks to the new opportunities offered by end-to-end entanglement of qubits on remote hosts via quantum repeaters. On a geographical scale, this will lead to the dawn of the quantum internet. While a fullblown deployment is yet to come, the research community is already working on a variety of individual enabling technologies and solutions. In this article, with the guidance of extensive simulations, we take a broader view and investigate the problems of quality of service (QoS) and provisioning in the context of quantum networks, which are very different from their counterparts in classical data networks due to some of their fundamental properties. Our work leads the way toward a new class of studies that will allow the research community to better understand the challenges of quantum networks and their potential commercial exploitation.

arXiv:2204.09538•IEEE Network•Sep 1, 2022•11 citations

Resource Management for Distributed Quantum Computing in Quantum Data Centers

Zebo Yang, Chenliang Tian, Raj Kumar Jain +6 more

In recent years, advances in quantum computing have been driven by substantial improvements in both the number and quality of qubits. As the field progresses, there is growing interest in interconnecting quantum systems to enable scalable computation through Distributed Quantum Computing (DQC) architectures. Consider a distributed quantum application executed across multiple Quantum Processing Units (QPUs) within a quantum data center, where remote gates require establishing entanglement between different QPUs. The creation of such end-to-end entanglement can lead to network congestion and resource contention. To address these challenges, we propose a resource management framework that maximizes fidelity-guaranteed throughput while satisfying dependency constraints. We first formulate the problem as a Mixed-Integer Linear Programming (MILP) model to provide a performance benchmark. Building on this, we develop efficient approximate scheduling algorithms that achieve performance comparable to the optimization solver. Although a trade-off exists between execution time and network throughput, simulation results demonstrate that one of the proposed strategies, Weighted Group Least Resource First (WGLRF), closely approximates the solver’s performance across most scenarios. These findings suggest that the lightweight strategy is sufficient for current DQC settings, offering a practical solution for managing remote-gate resource contention in distributed quantum circuits and improving overall system performance.

IEEE Access•Jan 1, 2026•1 citation

AMARQ: adaptive multi-application routing for quantum networks

Lamarana Jallow, Majid I Khan

Abstract Future quantum networks will have to support different applications on shared infrastructure, like fidelity-critical quantum key distribution (QKD) and latency-sensitive distributed quantum computing (DQC). The existing approaches for entanglement routing either optimise for a single application, or rely on sequential resource allocation, which results in inefficient resource utilisation, unfairness and degraded performance when multiple applications compete for shared network resources. In this paper, we propose AMARQ, a multi-objective deep Q-network based routing framework to jointly serve heterogeneous QKD and DQC traffic on shared quantum infrastructure. The agent makes adaptive and application-aware routing decisions to dynamically balance the rigid fidelity and latency requirements of QKD and the high-throughput and elastic rate requirements of DQC. The reward function combines a successful-routing throughput term with a per-edge fidelity penalty and an end-of-episode failure penalty; per-flow latency is enforced as a QoS constraint, and inter-application fairness is enforced by a dedicated admission-control loop that reserves a dynamic QKD qubit pool. We assess the performance of AMARQ on grid topologies with 25 to 625 nodes. AMARQ attains a request success ratio above 85%, which is up to 32 percentage points higher than ESDI and 39 percentage points higher than Cicconetti, while keeping the end-to-end fidelity above 0.80 and the inference latency below 90 ms for all configurations.

Quantum Science and Technology•Oct 14, 2026•0 citations

NarrowGap: Reducing Bottlenecks for End-to-End Entanglement Distribution in Quantum Networks

Zhonghui Li, Jian Li, Kaiping Xue +4 more

Quantum networks, which work by establishing entanglement between distant quantum end nodes (known as end-to-end entanglement distribution), are the promising infrastructure for quantum applications. However, the inherent loss in quantum channels and quantum decoherence contribute to the scarcity of entanglement resources in quantum networks. Consequently, there is an inevitable gap between available entanglement resources and requests’ demands, significantly hindering concurrent end-to-end entanglement distributions. In this paper, we present NarrowGap, an end-to-end entanglement distribution design that can alleviate the negative impact of entanglement resource scarcity on the request service capability of quantum networks. At the heart of NarrowGap, the resource transfer scheme (RTS) is designed to transfer idle entanglement resources to boost the bottlenecks’ capacities based on the unique feature of entanglement swapping, thus narrowing the gap between available entanglement resources and requests’ demands for end-to-end entanglements. Besides, NarrowGap presents a resource allocation scheme (RAS) to guarantee fairness, considering both the success probability of end-to-end entanglement distribution and each request’s demand, to address resource competition in bottlenecks. Extensive simulations demonstrate that NarrowGap outperforms three representative schemes and can achieve more than twice the performance improvement in request service rate.

IEEE Transactions on Networking•Oct 16, 2024•11 citations

Distributed quantum computing: A survey

Marcello Caleffi, Michele Amoretti, Davide Ferrari +3 more

Nowadays, quantum computing has reached the engineering phase, with fully-functional quantum processors integrating hundreds of noisy qubits. Yet – to fully unveil the potential of quantum computing out of the labs into the business reality – the challenge ahead is to substantially scale the qubit number, reaching orders of magnitude exceeding thousands of fault-tolerant qubits. To this aim, the distributed quantum computing paradigm is recognized as the key solution for scaling the number of qubits. Indeed, accordingly to such a paradigm, multiple small-to-moderate-scale quantum processors communicate and cooperate for executing computational tasks exceeding the computational power of single processing devices. The aim of this survey is to provide the reader with an overview about the main challenges and open problems arising with distributed quantum computing from a computer and communications engineering perspective. Furthermore, this survey provides an easy access and guide towards the relevant literature and the prominent results in the field.

arXiv:2212.10609•Computer Networks•Aug 8, 2024•379 citations
In the future, quantum computers will become widespread and a network of quantum repeaters will provide them with end-to-end entanglement of remote quantum bits. As a result, a pervasive quantum computation infrastructure will emerge, which will unlock several novel applications, including distributed quantum computing, that is the pooling of resources on multiple computation nodes to address problem instances that are unattainable by any individual quantum computer. In this paper, we first investigate the issue of service differentiation in this new environment. Then, we define the problem of how to select which computation nodes should participate in each pool, so as to achieve a fair share of the quantum network resources available. The analysis is performed via an open source simulator and the results are fully and readily available.
The evolution of quantum computing technologies has been advancing at a steady pace in the recent years, and the current trend suggests that it will become available at scale for commercial purposes in the near future. The acceleration can be boosted by pooling compute infrastructures to either parallelize algorithm execution or solve bigger instances that are not feasible on a single quantum computer, which requires an underlying Quantum Internet: the interconnection of quantum computers by quantum links and repeaters to exchange entangled quantum bits. However, Quantum Internet research so far has been focused on provisioning point-to-point flows only, which is suitable for (e.g.) quantum sensing and metrology, but not for distributed quantum computing. In this paper, after a primer on quantum computing and networking, we investigate the requirements and objectives of smart computing on distributed nodes from the perspective of quantum network provisioning. We then design a resource allocation strategy that is evaluated through a comprehensive simulation campaign, whose results highlight the key features and performance issues, and lead the way to further investigation in this direction.
In the coming years, quantum networks will allow quantum applications to thrive thanks to the new opportunities offered by end-to-end entanglement of qubits on remote hosts via quantum repeaters. On a geographical scale, this will lead to the dawn of the quantum internet. While a fullblown deployment is yet to come, the research community is already working on a variety of individual enabling technologies and solutions. In this article, with the guidance of extensive simulations, we take a broader view and investigate the problems of quality of service (QoS) and provisioning in the context of quantum networks, which are very different from their counterparts in classical data networks due to some of their fundamental properties. Our work leads the way toward a new class of studies that will allow the research community to better understand the challenges of quantum networks and their potential commercial exploitation.
In recent years, advances in quantum computing have been driven by substantial improvements in both the number and quality of qubits. As the field progresses, there is growing interest in interconnecting quantum systems to enable scalable computation through Distributed Quantum Computing (DQC) architectures. Consider a distributed quantum application executed across multiple Quantum Processing Units (QPUs) within a quantum data center, where remote gates require establishing entanglement between different QPUs. The creation of such end-to-end entanglement can lead to network congestion and resource contention. To address these challenges, we propose a resource management framework that maximizes fidelity-guaranteed throughput while satisfying dependency constraints. We first formulate the problem as a Mixed-Integer Linear Programming (MILP) model to provide a performance benchmark. Building on this, we develop efficient approximate scheduling algorithms that achieve performance comparable to the optimization solver. Although a trade-off exists between execution time and network throughput, simulation results demonstrate that one of the proposed strategies, Weighted Group Least Resource First (WGLRF), closely approximates the solver’s performance across most scenarios. These findings suggest that the lightweight strategy is sufficient for current DQC settings, offering a practical solution for managing remote-gate resource contention in distributed quantum circuits and improving overall system performance.
Abstract Future quantum networks will have to support different applications on shared infrastructure, like fidelity-critical quantum key distribution (QKD) and latency-sensitive distributed quantum computing (DQC). The existing approaches for entanglement routing either optimise for a single application, or rely on sequential resource allocation, which results in inefficient resource utilisation, unfairness and degraded performance when multiple applications compete for shared network resources. In this paper, we propose AMARQ, a multi-objective deep Q-network based routing framework to jointly serve heterogeneous QKD and DQC traffic on shared quantum infrastructure. The agent makes adaptive and application-aware routing decisions to dynamically balance the rigid fidelity and latency requirements of QKD and the high-throughput and elastic rate requirements of DQC. The reward function combines a successful-routing throughput term with a per-edge fidelity penalty and an end-of-episode failure penalty; per-flow latency is enforced as a QoS constraint, and inter-application fairness is enforced by a dedicated admission-control loop that reserves a dynamic QKD qubit pool. We assess the performance of AMARQ on grid topologies with 25 to 625 nodes. AMARQ attains a request success ratio above 85%, which is up to 32 percentage points higher than ESDI and 39 percentage points higher than Cicconetti, while keeping the end-to-end fidelity above 0.80 and the inference latency below 90 ms for all configurations.
Quantum networks, which work by establishing entanglement between distant quantum end nodes (known as end-to-end entanglement distribution), are the promising infrastructure for quantum applications. However, the inherent loss in quantum channels and quantum decoherence contribute to the scarcity of entanglement resources in quantum networks. Consequently, there is an inevitable gap between available entanglement resources and requests’ demands, significantly hindering concurrent end-to-end entanglement distributions. In this paper, we present NarrowGap, an end-to-end entanglement distribution design that can alleviate the negative impact of entanglement resource scarcity on the request service capability of quantum networks. At the heart of NarrowGap, the resource transfer scheme (RTS) is designed to transfer idle entanglement resources to boost the bottlenecks’ capacities based on the unique feature of entanglement swapping, thus narrowing the gap between available entanglement resources and requests’ demands for end-to-end entanglements. Besides, NarrowGap presents a resource allocation scheme (RAS) to guarantee fairness, considering both the success probability of end-to-end entanglement distribution and each request’s demand, to address resource competition in bottlenecks. Extensive simulations demonstrate that NarrowGap outperforms three representative schemes and can achieve more than twice the performance improvement in request service rate.
Nowadays, quantum computing has reached the engineering phase, with fully-functional quantum processors integrating hundreds of noisy qubits. Yet – to fully unveil the potential of quantum computing out of the labs into the business reality – the challenge ahead is to substantially scale the qubit number, reaching orders of magnitude exceeding thousands of fault-tolerant qubits. To this aim, the distributed quantum computing paradigm is recognized as the key solution for scaling the number of qubits. Indeed, accordingly to such a paradigm, multiple small-to-moderate-scale quantum processors communicate and cooperate for executing computational tasks exceeding the computational power of single processing devices. The aim of this survey is to provide the reader with an overview about the main challenges and open problems arising with distributed quantum computing from a computer and communications engineering perspective. Furthermore, this survey provides an easy access and guide towards the relevant literature and the prominent results in the field.