Arqon: A suite of control applications enabling a reliable quantum network

2026-04-09

AI Summary

This study addresses the challenge of reliably delivering entanglement link service requests in quantum networks by extending the classical notion of reliability into the quantum domain and formally defining quantum-network-specific reliability requirements. To meet these requirements, the authors propose Arqon, a centralized control framework that integrates admission control and scheduling algorithms. The framework is rigorously evaluated through both analytical and numerical methods. Experimental results demonstrate that Arqon effectively satisfies the proposed reliability guarantees, with computational complexities of O(k³) for admission control and O(N³) for scheduling. This work thus presents the first complete and practical control solution for ensuring service reliability in quantum networks.

Technology Category

• Machine Learning: Quantum Machine Learning
• Planning, Routing, and Scheduling: Scheduling under Uncertainty
• Knowledge Representation and Reasoning: Qualitative Reasoning

Application Category

• Economics, Online Markets and Human Computation: LLM based quality controls for crowd work
• Responsible Web: Human-perceived consequences of algorithmic deployment on the web
• Web Mining and Content Analysis: Web data provenance, reliability, and authenticity

Abstract

A quantum network's purpose is to enable users to execute applications on end nodes. This requires the network to provide the service of creating entangled links between those nodes. Users of mature networks, such as the internet or the telephone network expect accepted service demands to be met reliably. We first define reliability requirements that extend classical computer network concepts to quantum network service delivery. We then introduce Arqon, a suite of control applications designed to deliver reliable service in centrally controlled quantum networks. We demonstrate through both analytic and numerical evaluation that Arqon satisfies all reliability requirements for accepted demands. These evaluations consider static network topologies. We provide a complete Python implementation and perform complexity analysis showing that admission control scales as $O(k^3)$ in the number of incoming demands $k$ and schedule computation scales as ${O(N^3)}$ in the number of accepted demands to schedule $N$.

Problem

• quantum network
• reliability
• entangled links
• service delivery
• control applications

Innovation

• quantum network reliability
• entanglement distribution
• centralized control
• admission control
• schedule computation