Opportunistic routing in quantum networks
department or school: Applied Science, Faculty of
department or school: Engineering, School of (Okanagan)
data provider: DSpace
degree campus: UBCO
creator: Farahbakhsh, Ali
issued: 2022-09-15T18:21:52Z
issued: 2022
related degree: Master of Applied Science - MASc
degree grantor: University of British Columbia
description: Unlike classical routing algorithms, quantum routing algorithms make use of entangled states - a type of resources that have a limited lifetime and need to be regenerated after consumption. In a nutshell, quantum routing algorithms have to use these resources efficiently, while optimizing some objectives such as the total waiting time. Current routing algorithms tend to keep a routing request waiting until all of the resources on its path are available. In this thesis, we introduce a new way of managing entanglement resources in an opportunistic fashion: a request can move forward along its path as soon as possible (even if some resources on its path are not ready). We show that this opportunistic approach is fundamentally better than conventional approaches. In particular, our results indicate that this new approach achieves a 30-50% improvement in the average total waiting time and average link waiting time compared with several state-of-the-art routing algorithms. As a by-product of this work, we develop a new simulator for quantum routing, which can be used to evaluate various design choices under different scenarios.
aggregated CHO: https://circle.library.ubc.ca/rest/handle/2429/82715
note: Opportunistic Routing in QuantumNetworksbyAli FarahbakhshB.Sc., Sharif University of Technology, 2019A THESIS SUBMITTED IN PARTIAL FULFILLMENT OFTHE REQUIREMENTS FOR THE DEGREE OFMASTER OF APPLIED SCIENCEinTHE COLLEGE OF GRADUATE STUDIES(Electrical Engineering)THE UNIVERSITY OF BRITISH COLUMBIA(Okanagan)September 2022© Ali Farahbakhsh, 2022The following individuals certify that they have read, and recommendto the College of Graduate Studies for acceptance, a thesis/dissertation en-titled:Opportunistic Routing in Quantum Networkssubmitted by Ali Farahbakhsh in partial fulfilment of the requirementsof the degree of Master of Applied ScienceChen Feng, School of EngineeringSupervisorZheng Liu, School of EngineeringSupervisory Committee MemberJulian Cheng, School of EngineeringSupervisory Committee MemberAlexandra Fedorova, Department of Electrical and Computer EngineeringUniversity of British Columbia, VancouverUniversity ExamineriiAbstractUnlike classical routing algorithms, quantum routing algorithms makeuse of entangled states—a type of resources that have a limited lifetime andneed to be regenerated after consumption. In a nutshell, quantum rout-ing algorithms have to use these resources efficiently, while optimizing someobjectives such as the total waiting time. Current routing algorithms tendto keep a routing request waiting until all of the resources on its path areavailable. In this thesis, we introduce a new way of managing entanglementresources in an opportunistic fashion: a request can move forward alongits path as soon as possible (even if some resources on its path are notready). We show that this opportunistic approach is fundamentally betterthan conventional approaches. In particular, our results indicate that thisnew approach achieves a 30-50% improvement in the average total waitingtime and average link waiting time compared with several state-of-the-artrouting algorithms. As a by-product of this work, we develop a new sim-ulator for quantum routing, wh…
has type: Thesis/Dissertation
date issued: 2022-09
is shown at: 10.14288/1.0419951
language: eng
degree discipline: Electrical Engineering
provider: Vancouver : University of British Columbia Library
publisher: University of British Columbia
rights: Attribution-NonCommercial-NoDerivatives 4.0 International
rights URI: http://creativecommons.org/licenses/by-nc-nd/4.0/
scholar level: Graduate
contributor: Feng, Chen
type: Text
identifier URI: http://hdl.handle.net/2429/82715