Cornell University
Stochastic Dynamics and Control with Applications to Quantum Queueing Networks
Abstract
dc:description.abstractQueueing systems are widely studied because they provide mathematicallytractable models for a broad range of high-value applications in service, communication, and computing systems. Quantum queueing channels are a new rising subject sitting at a cross section of qunatum computation and queueing theory, aiming to use the rich toolkit of queueing theory to tackle challenges in the field of quantum computation. Motivated by these challenges, this dissertation develops theoretical results that stem from queueing-based models for three related problems that could be applied to quantum queue channels. Our work investigates the dynamics of quantum queue channels under various settings. Incentivized by minimizing environment-induced decoherence rate, we start by investigating overlap times in a two-dimensional infinite server tandem queue. More specifically, we analyze the amount of time that a pair of qubits (customers) spend overlapping in any gate (stations) of the two dimensional tandem network when the stations have independent and identically distributed service times that follow an exponential distribution. Our main contribution is the derivation of the joint tail distribution, the two marginal tail probabilities and several moments of the overlap times. We extend our results to the non-identically distributed case as well. Our results shed light on how customers overlap downstream in serial queueing systems. Next, we follow the traditional quantum queue channel frameworks and accept a wait time dependent decoherence factor with an exponentially increasing probability of total information loss. We then investigate the channel capacity which we call total fidelity \lambda \mathbb{E}[e-\kappa Wq], which captures the fundamental tradeoff between injecting qubits aggressively and avoiding information loss caused by long wait times. Within this framework, we show how the fidelity-maximizing arrival rate varies under various queueing regimes, including single and multiple servers and various service time assumptions. Together, these results provide a queueing theoretic basis for designing quantum scheduling and admission rules that target the least fidelity loss. Finally, we analyze systems that evolve continuously while experiencing sudden, discrete interventions.The combination of such framework with Erlang-A queue give rise to multiple real-life applications, such as improving efficiency at call centers and designing optimal timing to apply Quantum Error Correction (QEC) in trying to increase QEC efficiency while maintaining the same level of cost. We derive closed-form expressions for steady-state amplitude bounds and average queue lengths under impulse, and we identify the impulse timings that optimize system performance.
Degree
thesis:*- Name thesis:degree_name
- Ph. D., Operations Research and Information Engineering
- Level thesis:degree_level
- Doctor of Philosophy
- Discipline thesis:degree_discipline
- Operations Research and Information Engineering
- Grantor
- Cornell University
- Year dc:date.issued
- 2026
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Gao, Valarie
- Chair dc:contributor.chair
-
- Pender, Jamol
- Committee members dc:contributor.committeemember
-
- Scully, Ziv
- Minca, Andreea
Subjects
dc:subject × 3Rights
dc:rights- Statement dc:rights
-
- Attribution-NonCommercial-NoDerivatives 4.0 International
- Licence dc:rights.uri
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Dc Identifier Other
-
Gao_cornellgrad_0058F_15593
https://www.proquest.com/LegacyDocView/DISSNUM/32676979