Poster: Maximal Rate Entanglement Swapping Schedules for Routing in the Quantum Internet

In this work, we describe a routing algebra corresponding to the problem of establishing end-to-end quantum entanglements between nodes connected through a network of first generation quantum repeaters. Our goal is to design an algorithm which can determine all the routes and swapping schedules to achieve maximal rates of end-to-end entanglement. We aim to provide an improvement in terms of complexity over an existing solution while increasing the number of routes and schedules available to offer more alternatives for the entanglement generation layer of a quantum protocol stack.