Matching Queues with Abandonments in Quantum Switches: Stability and Throughput Analysis

Inspired by quantum switches, we consider a discrete-time multiway matching system with two classes of arrivals: requests for entangled pair of qubits between two nodes and qubits from each node that can be used to serve the requests. An important feature of this model is that qubits decohere and so abandon over time. In contrast to classical server-based queueing models, the combination of queueing, server-less multiway matching, and (potentially correlated) abandonments make the analysis a challenging problem. The primary focus of this paper is to study a simple system consisting of two types of requests and three types of qubits operating under a max-weight policy. In this setting, we characterize the stability region under the max-weight policy by adopting a two-time scale fluid limit to get a handle on the abandonments. In particular, we show that max-weight is throughput optimal and that it can achieve throughputs larger than the ones that can be achieved by nonidling policies when the requests are infinitely backlogged. Moreover, despite the use of the max-weight policy, we show that there can be a counter-intuitive behavior in the system: the longest request queue can have a positive drift for some time even if the overall system is stable.