Adaptive Algorithm for Resource Generation in a Quantum Network

Using a Markov Decision Process Approach to Optimize the Quantum Resource Generation Algorithm

Bachelor thesis (2024)

Authors

I. Draganescu Electrical Engineering, Mathematics and Computer Science

Contributors

G.S. Vardoyan Quantum Computer Science - EEMCS (mentor)
B.J. Davies QID/Wehner Group - QuTech Advanced Research Centre (mentor)
R. Hai Web Information Systems - EEMCS (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
More Info
expand_more

Published Date

27-06-2024

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

Entangled links can be seen as a connection between two parties that persists remotely, but whose quality (fidelity) decreases over time. Many quantum applications rely on having a certain number of simultaneously active entangled links for their execution. Every application has a characteristic threshold fidelity - the minimum fidelity a link should have for it to be useful. There are several link generation protocols; a protocol i generates with probability P_i a link with initial fidelity F_i. Until now, research has focused on generating all links with the same protocol. Therefore, the aim of this research is to use multiple generation protocols in order to minimize the expected time needed to reach the desired number of links, and to analyze how this time changes with regard to the threshold fidelity of the target protocol. We present how to reach the minimum possible expected time by modelling the problem as a Markov decision process and determining the optimal sequence of protocols to be used. Then, we observe that our approach generally performs several orders of magnitude better than previous research in which all links were generated with the same protocol.