A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks
arXiv:2307.06009 · doi:10.1109/TQE.2023.3341151
Abstract
Quantum Internetworking is a recent field that promises numerous interesting applications, many of which require the distribution of entanglement between arbitrary pairs of users. This work deals with the problem of scheduling in an arbitrary entanglement swapping quantum network - often called first generation quantum network - in its general topology, multicommodity, loss-aware formulation. We introduce a linear algebraic framework that exploits quantum memory through the creation of intermediate entangled links. The framework is then employed to apply Lyapunov Drift Minimization (a standard technique in classical network science) to mathematically derive a natural class of scheduling policies for quantum networks minimizing the square norm of the user demand backlog. Moreover, an additional class of Max-Weight inspired policies is proposed and benchmarked, reducing significantly the computation cost at the price of a slight performance degradation. The policies are compared in terms of information availability, localization and overall network performance through an ad-hoc simulator that admits user-provided network topologies and scheduling policies in order to showcase the potential application of the provided tools to quantum network design.
arXiv comment19 pages, 7 figures. Accepted for publication in "IEEE Transactions on Quantum Engineering"
References in corpus (22)
- Long-distance quantum communication with atomic ensembles and linear optics
- Heralded entanglement between solid-state qubits separated by 3 meters
- Quantum repeaters: From quantum networks to the quantum internet
- Efficient long distance quantum communication
- Qubit teleportation between non-neighboring nodes in a quantum network
- Telecom-heralded entanglement between remote multimode solid-state quantum memories
- When Entanglement meets Classical Communications: Quantum Teleportation for the Quantum Internet (Invited Paper)
- A Link Layer Protocol for Quantum Networks
- NetSquid, a NETwork Simulator for QUantum Information using Discrete events
- A quantum network stack and protocols for reliable entanglement-based networks
- Distributing Graph States Over Arbitrary Quantum Networks
- Shortcuts to quantum network routing
- Distributing Multipartite Entanglement over Noisy Quantum Networks
- Opportunistic Entanglement Distribution for the Quantum Internet
- On the Stochastic Analysis of a Quantum Entanglement Switch
- A Throughput Optimal Scheduling Policy for a Quantum Switch
- Entanglement Swapping in Quantum Switches: Protocol Design and Stability Analysis
- Entanglement Swapping for Repeater Chains with Finite Memory Sizes
- A Multiple-Entanglement Routing Framework for Quantum Networks
- Measurement-Adaptive Cellular Random Access Protocols
- An Architecture for Meeting Quality-of-Service Requirements in Multi-User Quantum Networks
- Entanglement Routing Based on Fidelity Curves