Policies for elementary links in a quantum network
Sumeet Khatri

TL;DR
This paper introduces a decision process framework for optimizing entanglement distribution protocols in quantum networks, focusing on elementary links, and provides algorithms to find optimal policies considering hardware limitations.
Contribution
It develops a novel decision process approach for elementary link entanglement distribution and offers algorithms, including an optimal one, to improve protocol performance.
Findings
Proposed a quantum decision process for elementary links.
Provided algorithms to determine optimal policies.
Reformulated the memory-cutoff protocol as a policy within the framework.
Abstract
Distributing entanglement over long distances is one of the central tasks in quantum networks. An important problem, especially for near-term quantum networks, is to develop optimal entanglement distribution protocols that take into account the limitations of current and near-term hardware, such as quantum memories with limited coherence time. We address this problem by initiating the study of quantum network protocols for entanglement distribution using the theory of decision processes, such that optimal protocols (referred to as policies in the context of decision processes) can be found using dynamic programming or reinforcement learning algorithms. As a first step, in this work we focus exclusively on the elementary link level. We start by defining a quantum decision process for elementary links, along with figures of merit for evaluating policies. We then provide two algorithms for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
