Service Differentiation and Fair Sharing in Distributed Quantum Computing

TL;DR

This paper explores how to ensure fair resource sharing and service differentiation in future distributed quantum computing networks, analyzing node selection strategies through simulation.

Contribution

It introduces a framework for service differentiation and fair resource allocation in distributed quantum computing environments, supported by simulation results.

Findings

Effective node selection strategies for fair resource sharing

Simulation results demonstrating the impact of different policies

Insights into service differentiation in quantum networks

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.