Scheduling Performance Evaluation for Quantum Entanglement Distribution

Designed a queuing-theoretic framework for efficient entanglement distribution from a single server to three clients. The goal was to model and compare scheduling strategies for quantum network resource allocation.

Some highlights of this project are:

• Modeled entanglement distribution using round-robin scheduling in a queuing-theoretic framework.
• Compared round-robin against processor-sharing scheduling strategies in terms of throughput and fairness.
• Analyzed trade-offs between scheduling policies for quantum networking scenarios.

Figure: Quantum teleportation circuit by Bender2k14, CC BY-SA 3.0, via Wikimedia Commons.