Service Differentiation and Fair Sharing in Distributed Quantum Computing
arXiv:2301.03977 · doi:10.1016/j.pmcj.2023.101758
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.
arXiv commentSubmitted to Elsevier for possible journal publication. arXiv admin note: text overlap with arXiv:2203.05844
References in corpus (12)
- Experimental quantum teleportation
- Realization of a multi-node quantum network of remote solid-state qubits
- Efficient long distance quantum communication
- A Link Layer Protocol for Quantum Networks
- Path Selection for Quantum Repeater Networks
- System Design for a Long-Line Quantum Repeater
- Entanglement generation in a quantum network at distance-independent rate
- Optimized compiler for Distributed Quantum Computing
- Field-deployable Quantum Memory for Quantum Networking
- NetQASM -- A low-level instruction set architecture for hybrid quantum-classical programs in a quantum internet
- Quantum repeaters for communication
- Quantum Transport Protocols for Distributed Quantum Computing