Stochastic Analysis of Entanglement-assisted Quantum Communication Channels

2024/12/20 by Karim S. Elsayed, Elsayed, Karim S., Olga Izyumtseva +5
Computer Science · Engineering · #60F05 #60F17 #60K25 #68M20 #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Molecular Communication and Nanonetworks #Networking and Internet Architecture (cs.NI) #Probability (math.PR) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph)

paper · pdf · doi:10.48550/arxiv.2412.16157

openalex publication_date 2024/12/20 · openalex created_date 2024/12/24 · openalex updated_date 2026/07/28

Abstract

We present a queueing model for a quantum communication network consisting of a primary queue and a service queue in which Bell pairs are formed and stored. The Bell pairs are inherently extremely short-lived rendering the service queue (the quantum queue) much faster than the primary queue. We study the asymptotic behaviour of this multi-scale queueing system via a stochastic averaging principle. We prove a Functional Law of Large Numbers (FLLN) and a Functional Central Limit Theorem (FCLT) for the standard queue averaging the dynamics of the fast service queue.

Related

• Performance Analysis of Quantum Channels
• Analytical Performance Estimations for Quantum Repeater Network Scenarios
• Entanglement distribution modeling with quantum memories in a global and local clock system
• The Classical Capacity of Quantum Jackson Networks with Waiting Time-Dependent Erasures
• Qubits through Queues: The Capacity of Channels with Waiting Time\n Dependent Errors