Stability Analysis of a Quantum Network with Max-Weight Scheduling

• URL: http://arxiv.org/abs/2106.00831v1
• Date: Tue, 1 Jun 2021 22:19:33 GMT
• Title: Stability Analysis of a Quantum Network with Max-Weight Scheduling
• Abstract summary: We study a quantum network that distributes entangled quantum states to multiple sets of users that are connected to the network. All the links of the network generate bipartite Bell-state entangled states in each time-slot with certain probabilities. We propose a Max-Weight scheduling policy and show that this policy stabilizes the network for all feasible arrival rates.
• Score: 16.74626042261441
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We study a quantum network that distributes entangled quantum states to multiple sets of users that are connected to the network. Each user is connected to a switch of the network via a link. All the links of the network generate bipartite Bell-state entangled states in each time-slot with certain probabilities, and each end node stores one qubit of the entanglement generated by the link. To create shared entanglements for a set of users, measurement operations are performed on qubits of link-level entanglements on a set of related links, and these operations are probabilistic in nature and are successful with certain probabilities. Requests arrive to the system seeking shared entanglements for different sets of users. Each request is for the creation of shared entanglements for a fixed set of users using link-level entanglements on a fixed set of links. Requests are processed according to First-Come-First-Served service discipline and unserved requests are stored in buffers. Once a request is selected for service, measurement operations are performed on qubits of link-level entanglements on related links to create a shared entanglement. For given set of request arrival rates and link-level entanglement generation rates, we obtain necessary conditions for the stability of queues of requests. In each time-slot, the scheduler has to schedule entanglement swapping operations for different sets of users to stabilize the network. Next, we propose a Max-Weight scheduling policy and show that this policy stabilizes the network for all feasible arrival rates. We also provide numerical results to support our analysis. The analysis of a single quantum switch that creates multipartite entanglements for different sets of users is a special case of our work.

Related papers

• Dynamic Entanglement Distribution for Multi-User and Multi-Protocol Quantum Networking [3.4294079441889314]
  A quantum reconfigurable optical add-drop multiplexer (q-ROADM) dynamically distributes polarisation-entangled photon pairs from a broadband source to six users over deployed campus and metropolitan fibre.<n>We demonstrate stable six-user full-mesh operation over more than 150 hours, compare full-mesh and time-shared partial-mesh strategies under different source and detector conditions, and realise quantum network slicing with optional/additional interconnection links.<n>These results demonstrate a q-ROADM-enabled entanglement distribution architecture as a novel route towards reconfigurable, service-oriented quantum networking over optical fibre infrastructure.
  arXiv  Detail & Related papers  (2026-07-16T17:54:43Z)
• Arqon: A suite of control applications enabling a reliable quantum network [0.0]
  A quantum network's purpose is to enable users to execute applications on end nodes.<n>We first define reliability requirements that extend classical computer network concepts to quantum network service delivery.<n>We introduce Arqon, a suite of control applications designed to deliver reliable service in centrally controlled quantum networks.
  arXiv  Detail & Related papers  (2026-04-09T18:25:44Z)
• Telemetry-Based Server Selection in the Quantum Internet via Cross-Layer Runtime Estimation [0.0]
  The Quantum Internet will allow clients to delegate quantum workloads to remote servers over heterogeneous networks.<n>We propose $T_max$, a lightweight runtime score that sums coarse telemetry from multiple layers to obtain a conservative ranking for online server selection.
  arXiv  Detail & Related papers  (2026-02-24T15:25:55Z)
• Dynamic Scheduling in Fiber and Spaceborne Quantum Repeater Networks [0.0]
  We present a framework to mathematically formulate the scheduling problem over quantum networks.<n>By leveraging the framework, we apply Lyapunov drift minimization to derive a novel class of quadratic optimization based scheduling policies.<n>We also report on the development of numerous extensions to QuISP, an established quantum network simulator.
  arXiv  Detail & Related papers  (2025-10-07T12:23:46Z)
• Entanglement Coordination Rates in Multi-User Networks [16.025002076222002]
  The optimal coordination rates are determined in three primary settings of multi-user quantum networks. We show the implications of our results on nonlocal games with quantum strategies.
  arXiv  Detail & Related papers  (2024-03-18T15:53:30Z)
• Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing [73.7522199491117]
  Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources. The fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. We propose a resource allocation model to provision quantum computing and networking resources.
  arXiv  Detail & Related papers  (2023-07-25T00:38:46Z)
• On the Bipartite Entanglement Capacity of Quantum Networks [9.377912974064227]
  We consider multi-path entanglement distribution to a pair of nodes in a quantum network consisting of devices with non-deterministic entanglement swapping capabilities. We propose a mixed-integer quadratically constrained program (MIQCP) to solve this flow problem. We then compute the overall network capacity, defined as the maximum number of EPR states distributed to users per time unit.
  arXiv  Detail & Related papers  (2023-07-10T10:58:02Z)
• Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
  In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes. We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
  arXiv  Detail & Related papers  (2023-04-10T07:16:51Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Adaptive, Continuous Entanglement Generation for Quantum Networks [59.600944425468676]
  Quantum networks rely on entanglement between qubits at distant nodes to transmit information. We present an adaptive scheme that uses information from previous requests to better guide the choice of randomly generated quantum links. We also explore quantum memory allocation scenarios, where a difference in latency performance implies the necessity of optimal allocation of resources for quantum networks.
  arXiv  Detail & Related papers  (2022-12-17T05:40:09Z)
• A Quantum Overlay Network for Efficient Entanglement Distribution [15.034732044326752]
  We introduce Quantum Overlay Networks (QONs) for efficient entanglement distribution in quantum networks. When the demand to create end-to-end user entanglements is low, QONs can generate and store maximally entangled Bell pairs. We show that QONs fare well by a factor of 40% with respect to meeting surge and changing demands compared to traditional non-overlay proposals.
  arXiv  Detail & Related papers  (2022-12-03T21:20:30Z)
• A Throughput Optimal Scheduling Policy for a Quantum Switch [16.74626042261441]
  We study a quantum switch that creates shared end-to-end entangled quantum states to multiple sets of users that are connected to it. We propose a Max-Weight scheduling policy and show that it stabilizes the switch for all arrival rates that lie in the capacity region.
  arXiv  Detail & Related papers  (2022-06-07T11:49:32Z)
• Optimized Quantum Networks [68.8204255655161]
  Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests. We utilize this to design entanglement-based quantum networks tailored to their desired functionality.
  arXiv  Detail & Related papers  (2021-07-21T18:00:07Z)
• Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
  We show how to make quantum networks, both standard and entanglement-based, genuine quantum. We provide them with the possibility of handling superposed tasks and superposed addressing.
  arXiv  Detail & Related papers  (2020-04-30T18:00:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.