Queueing systems are widely studied because they provide mathematically tractable 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 ac-B Appendix of Chapter 3 B.1 Analytical comparison of the two M/M/c heavy traffic prescriptions . . . . . . . . . . . . . . . .
Queueing systems are widely studied because they provide mathematically tractable 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 ac-B Appendix of Chapter 3 B.1 Analytical comparison of the two M/M/c heavy traffic prescriptions . . . . . . . . . . . . . . . .
Quantum computing is revolutionizing various fields, including operations research and queueing theory. This work presents a transformative quantum simulation framework that addresses the long-standing challenge of accurately modeling single-server Markovian queues, a fundamental problem in both quantum computing and stochastic modeling. Our approach introduces a dynamic amplitude amplification technique that leverages custom parameterized quantum gates to model Poisson arrivals and exponential service times in real time. The core innovation lies in the adaptive adjustment of these gate parameters, which selectively amplifies critical quantum states based on evolving queue conditions. This dynamic mechanism not only accelerates convergence towards theoretical predictions but also significantly reduces computational overhead compared to static quantum methods. Empirical evaluations demonstrate accuracy across diverse traffic scenarios, with relative errors dropping below 0.002 in high-traffic regimes. By effectively bridging the gap between classical queueing theory and quantum simulation, our method opens new avenues for leveraging quantum resources to tackle complex stochastic processes in operations research.
The convergence of quantum computing and classical service system modeling presents a transformative opportunity. This paper proposes the formalization of Quantum Queueing Theory (QQT), a novel framework for modeling, analyzing, and optimizing service systems where quantum processors act as servers, quantum algorithms constitute service tasks, and quantum communication channels facilitate arrivals and departures. We outline the fundamental challenges posed by quantum mechanics (superposition, entanglement, measurement, decoherence) to classical queueing paradigms. Key research directions include defining quantum analogues of arrival processes, service disciplines, and performance metrics (quantum fidelity, task success probability, decoherence-limited waiting time). We explore modeling approaches leveraging quantum stochastic processes, quantum walks, and modified Lindblad master equations. The paper details critical areas for future research: hybrid quantum-classical queueing networks, resource allocation under decoherence, stability analysis in the quantum regime, and the development of quantum-aware scheduling policies. QQT is poised to become essential for designing efficient and scalable quantum computing data centers, quantum cloud services, and integrated quantum-classical computing infrastructures.
The theory of open quantum systems represents one of the major developments of quantum mechanics over the last 50 years. Its central object of study is constituted by quantum systems that cannot be regarded as fully isolated, but instead interact with additional degrees of freedom, giving rise to irreversible phenomena such as dissipation and decoherence. The tools provided by this framework are nowadays of paramount importance across many active areas of research, including quantum computation, thermodynamics, metrology and biology. In this thesis, we investigate three main topics within the field. The first contribution concerns the microscopic derivation of the evolution equations, socalled quantum master equations, for open systems which are also subject to external driving fields. Standard techniques developed for time-independent Hamiltonians encounter several difficulties in the time-dependent case, largely restricting their applicability to specific instances, such as periodic or adiabatic drivings. In contrast, a core result of the derivation presented in the thesis is that, when the environment is sufficiently Markovian (essentially, memoryless), the non-adiabatic contributions to the driving field can be neglected in a controlled fashion, yielding an accurate master equation with time-dependent generator, capable of correctly reproducing the open dynamics even for strong drivings. This result is further supported by benchmarks against numerically exact simulations. The second contribution addresses the long-time behavior of general types of (Markovian) quantum master equations, including those of the form introduced above. While this problem has been extensively analyzed in the time-independent setting, virtually no results are known for time-dependent generators. In particular, we establish the foundations of a general theory of relaxation, that is, convergence towards an asymptotic trajectory in the long-time limit, independently of the initial state. The main results include a theorem guaranteeing sufficient conditions for relaxation and the derivation of a rate function governing the convergence to the asymptotic trajectory. The analysis is further extended to a simple non-Markovian case. Moreover, we treat in detail the specific master equation derived in the first part, connecting the aforementioned relaxation property directly to the underlying microscopic dynamics. The third contribution investigates chirality-induced spin selectivity (CISS) effects from the perspective of open quantum systems. Although the majority of theoretical studies aiming to model CISS are based on a coherent description of the spin dynamics, such effects have been observed also for electrons subject to incoherent transport across molecular networks. In this regard, we provide a rigorous ab initio derivation of the microscopic Hamiltonian describing the electronic transport, incorporating electron spin effects and contributions stemming from the nuclear vibrations. Within this result, we critically revise a master equation approach aiming to explain the origin of CISS effects observed in photosynthetic complexes. Taken together, these contributions offer fresh insights and original results on the interplay between driving fields and dissipation, relaxation phenomena, and electronic spin transport in the presence of incoherent dynamics. More broadly, these results provide new theoretical tools with several potential applications in quantum technologies, from modeling of control pulses in noisy environments to quantum reservoir engineering, and contribute to a deeper understanding of the role of quantum effects in biological systems.
We consider a setting where qubits are processed sequentially, and derive fundamental limits on the rate at which classical information can be transmitted using quantum states that decohere in time. Specifically, we model the sequential processing of qubits using a single server queue, and derive explicit expressions for the capacity of such a `queue-channel.' We also demonstrate a sweet-spot phenomenon with respect to the arrival rate to the queue, i.e., we show that there exists a value of the arrival rate of the qubits at which the rate of information transmission (in bits/sec) through the queue-channel is maximized. Next, we consider a setting where the average rate of processing qubits is fixed, and show that the capacity of the queue-channel is maximized when the processing time is deterministic. We also discuss design implications of these results on quantum information processing systems.
We consider a setting where qubits are processed sequentially, and derive fundamental limits on the rate at which classical information can be transmitted using quantum states that decohere in time. Specifically, we model the sequential processing of qubits using a single server queue, and derive explicit expressions for the capacity of such a `queue-channel.' We also demonstrate a sweet-spot phenomenon with respect to the arrival rate to the queue, i.e., we show that there exists a value of the arrival rate of the qubits at which the rate of information transmission (in bits/sec) through the queue-channel is maximised. Next, we consider a setting where the average rate of processing qubits is fixed, and show that the capacity of the queue-channel is maximised when the processing time is deterministic. We also discuss design implications of these results on quantum information processing systems.
Collision models describe the sequential interactions of a system with independent ancillas. Motivated by recent advances in neutral atom arrays, here we investigate a model where the ancillas are governed by a classical controller that allows them to queue up while they wait for their turn to interact with the system. The ancillas can undergo individual open dynamics while they wait, which could cause them to, e.g., decohere. The system, which plays the role of the server in the queue, can also undergo its own open dynamics whenever it is idle. We show that this framework greatly generalizes existing approaches for quantum collision models, recovering the deterministic and stochastic formulations in the appropriate limits. Next, we show how the combination of queueing dynamics with quantum collisions introduces rich dynamical phenomena, including phase transitions and a sharp dependence on the queue statistics.