A Throughput Optimal Scheduling Policy for a Quantum Switch
arXiv:2206.03205 · doi:10.1117/12.2616950
Abstract
We study a quantum switch that creates shared end-to-end entangled quantum states to multiple sets of users that are connected to it. Each user is connected to the switch via an optical link across which bipartite Bell-state entangled states are generated in each time-slot with certain probabilities, and the switch merges entanglements of links to create end-to-end entanglements for users. One qubit of an entanglement of a link is stored at the switch and the other qubit of the entanglement is stored at the user corresponding to the link. Assuming that qubits of entanglements of links decipher after one time-slot, we characterize the capacity region, which is defined as the set of arrival rates of requests for end-to-end entanglements for which there exists a scheduling policy that stabilizes the switch. We propose a Max-Weight scheduling policy and show that it stabilizes the switch for all arrival rates that lie in the capacity region. We also provide numerical results to support our analysis.
arXiv commentarXiv admin note: text overlap with arXiv:2106.00831
References in corpus (16)
- Quantum cryptography: Public key distribution and coin tossing
- Advances in Quantum Metrology
- Experimental demonstration of memory-enhanced quantum communication
- Universal blind quantum computation
- End-to-end capacities of a quantum communication network
- A Link Layer Protocol for Quantum Networks
- A Crossbar Network for Silicon Quantum Dot Qubits
- Programmable Multimode Quantum Networks
- Optimal and Secure Measurement Protocols for Quantum Sensor Networks
- Demonstration of a Reconfigurable Entangled Radiofrequency-Photonic Sensor Network
- Rate-loss analysis of an efficient quantum repeater architecture
- Ultrafast switching of photonic entanglement
- On the waiting time in quantum repeaters with probabilistic entanglement swapping
- A Quantum Router Architecture for High-Fidelity Entanglement Flows in Quantum Networks
- Demonstration of active routing of entanglement in a multi-user network
- Multiplexed quantum repeaters based on dual-species trapped-ion systems
Cited by in corpus (9)
- A Control Architecture for Entanglement Generation Switches in Quantum Networks
- A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks
- Simulation of fidelity in entanglement-based networks with repeater chains
- Analytical Performance Estimations for Quantum Repeater Network Scenarios
- Quantum Network Routing based on Surface Code Error Correction
- A Continuous Variable Quantum Switch
- Online Stochastic Matching: A Polytope Perspective
- An on-demand resource allocation algorithm for a quantum network hub and its performance analysis
- Dynamic Entanglement Packet Scheduling for Quantum Networks