Order Matters: On the Impact of Swapping Order on an Entanglement Path in a Quantum Network
Alena Chang, Guoliang Xue
Abstract
In this paper, we study the properties of path metrics of an entanglement path for a given entanglement swapping order of the path. We show how to efficiently compute the path metrics of an entanglement path for any given swapping order. We show that different entanglement swapping orders for the same path can lead to different expected throughputs. A key finding is that the binary operator corresponding to entanglement swapping along a path is not associative. We further show that the problem of computing an s-t path with maximum expected throughput under any entanglement swapping order does not have the subpath optimality property, which is a key property most path finding algorithms such as Dijkstra’s algorithm rely on. We use extensive simulations to validate our theoretical findings.