A quantum internet holds promise for achieving communication tasks that seem to be intractable by the current internet. The required functionality of a physical layer for such a quantum internet is to distribute entanglement efficiently to clients over a quantum network. A fundamental building block to design such efficient distribution of entanglement is to bound capacities of such quantum internet protocols. In this talk, we present a set of efficient linear programs to bound quantum/private capacities of quantum internet protocols, as well as their analytic upper/lower bounds. Our linear program is applied to bipartite cases, multi-pair cases, and a multi-partite case, covering almost all known situations.
|