Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Queueing Systems

On the quantum entanglement of random walks and queueing systems

Mark S. Squillante

Published Apr 1, 2022• 2 citations
Publisher
DOI
10.1007/s11134-022-09843-x

Related papers

Exact transition operators for Markov and lattice Schrödinger processes constrained by a boundary

Joel Yellin

A closed form is given for a three-parameter family of transition matrices describing continuous-time nonsymmetric random walks on a $d=1$ semi-infinite lattice. The boundary conditions are general, allowing for an arbitrary mixture of reflection, trapping, and sojourn. Special cases give the quantum propagator for the half-lattice, and transition matrices for the random walk on the Bethe lattice and the single-server queue $\frac{\frac{M}{M}}{\frac{1}{\ensuremath{\infty}}}$.

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Feb 1, 1996•0 citations

Maximal entanglement from quantum random walks

B. Allés, Semra Gündüç, Y. Gündüç

arXiv:1011.6023•Quantum Information Processing•Apr 30, 2011•15 citations

Service-the-Longest-Queue Among d Choices Policy for Quantum Entanglement Switching

Guo Xian Yau, Thirupathaiah Vasantam, Gayane Vardoyan

An Entanglement Generation Switch (EGS) is a quantum network hub that provides entangled states to a set of connected nodes by enabling them to share a limited number of hub resources. As entanglement requests arrive, they join dedicated queues corresponding to the nodes from which they originate. We propose a load-balancing policy wherein the EGS queries nodes for entanglement requests by randomly sampling d of all available request queues and choosing the longest of these to service. This policy is an instance of the well-known power-of-d-choices paradigm previously introduced for classical systems such as data-centers. In contrast to previous models, however, we place queues at nodes instead of directly at the EGS, which offers some practical advantages. Additionally, we incorporate a tunable back-off mechanism into our load-balancing scheme to reduce the classical communication load in the network. To study the policy, we consider a homogeneous star network topology that has the EGS at its center, and model it as a queueing system with requests that arrive according to a Poisson process and whose service times are exponentially distributed. We provide an asymptotic analysis of the system by deriving a set of differential equations that describe the dynamics of the mean-field limit and provide expressions for the corresponding unique equilibrium state. Consistent with analogous results from randomized load-balancing for classical systems, we observe a significant decrease in the average request processing time when the number of choices d increases from one to two during the sampling process, with diminishing returns for a higher number of choices. We also observe that our mean-field model provides a good approximation to study even moderately-sized systems.

arXiv:2503.22292•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•1 citation

Quantum walk, entanglement and Markov process

A. Romanelli

•Apr 7, 2010•0 citations

Non-Markovian dynamics and entanglement in quantum Brownian motion

K. Shiokawa

Journal of Mathematical Chemistry•May 16, 2008•4 citations

Distributed Coordination Based on Quantum Entanglement (Work in Progress)

Yotam Ashkenazi, Shlomi Dolev

This paper demonstrates and proves that the coordination of actions in a distributed swarm can be enhanced by using quantum entanglement. In particular, we focus on• Global and local simultaneous random walks, using entangled qubits that collapse into the same (or opposite) direction, either random direction or totally controlled simultaneous movements.• Identifying eavesdropping from malicious eavesdroppers aimed at disturbing the simultaneous random walks by using entangled qubits that were sent at random or with predefined bases.

arXiv:2210.10551•IEEE International Symposium on Network Computing and Applications (NCA)•Dec 14, 2022•5 citations
A closed form is given for a three-parameter family of transition matrices describing continuous-time nonsymmetric random walks on a d=1d=1d=1 semi-infinite lattice. The boundary conditions are general, allowing for an arbitrary mixture of reflection, trapping, and sojourn. Special cases give the quantum propagator for the half-lattice, and transition matrices for the random walk on the Bethe lattice and the single-server queue $\frac{\frac{M}{M}}{\frac{1}{\ensuremath{\infty}}}$.
An Entanglement Generation Switch (EGS) is a quantum network hub that provides entangled states to a set of connected nodes by enabling them to share a limited number of hub resources. As entanglement requests arrive, they join dedicated queues corresponding to the nodes from which they originate. We propose a load-balancing policy wherein the EGS queries nodes for entanglement requests by randomly sampling d of all available request queues and choosing the longest of these to service. This policy is an instance of the well-known power-of-d-choices paradigm previously introduced for classical systems such as data-centers. In contrast to previous models, however, we place queues at nodes instead of directly at the EGS, which offers some practical advantages. Additionally, we incorporate a tunable back-off mechanism into our load-balancing scheme to reduce the classical communication load in the network. To study the policy, we consider a homogeneous star network topology that has the EGS at its center, and model it as a queueing system with requests that arrive according to a Poisson process and whose service times are exponentially distributed. We provide an asymptotic analysis of the system by deriving a set of differential equations that describe the dynamics of the mean-field limit and provide expressions for the corresponding unique equilibrium state. Consistent with analogous results from randomized load-balancing for classical systems, we observe a significant decrease in the average request processing time when the number of choices d increases from one to two during the sampling process, with diminishing returns for a higher number of choices. We also observe that our mean-field model provides a good approximation to study even moderately-sized systems.
This paper demonstrates and proves that the coordination of actions in a distributed swarm can be enhanced by using quantum entanglement. In particular, we focus on• Global and local simultaneous random walks, using entangled qubits that collapse into the same (or opposite) direction, either random direction or totally controlled simultaneous movements.• Identifying eavesdropping from malicious eavesdroppers aimed at disturbing the simultaneous random walks by using entangled qubits that were sent at random or with predefined bases.