Simulating a Quantum Switch With Concurrent Demands

ABSTRACT Quantum networks rely on entanglement distribution to enable secure communication and distributed quantum computation. Most analytical models address idealized, single‐flow scenarios and overlook the impact of concurrent entanglement requests, limiting their applicability to realistic network conditions. This work studies the behavior of a quantum switch under simultaneous entanglement demands, motivated by the need to understand how concurrency affects link utilization, generation rate, and end‐to‐end fidelity. Our main contribution is a concurrency‐aware switch model that jointly captures capacity and fidelity under multi‐flow conditions, offering the first systematic simulation‐based analysis of this problem. Results show that handling several requests at the same time improves throughput but reduces fidelity once the network is too busy. This highlights the need for scheduling and routing strategies that keep a good balance between efficiency and entanglement quality in future quantum networks.