Linear programs for entanglement and key distribution in the quantum internet

Linear programs for entanglement and key distribution in the quantum internet

Seminar author:Stefan Bäuml

Event date and time:07/12/2018 02:00:pm

Event location:GIQ Seminar Room (C5/262)

Event contact:S.M.G.Bauml-1@tudelft.nl

We consider the distribution of entangled resources for various quantum information protocols and user scenarios via quantum networks. We introduce private and quantum capacities for the entire network and provide upper and lower bounds that, given the single channel capacities or bounds on them, can be efficiently computed using linear programs (LPs). The user scenarios we consider include bipartite settings, where two parties are supplied with bipartite entanglement or cryptographic key, settings where multiple pairs of users are supplied in parallel as well as multipartite settings, where a group consisting of multiple users is supplied with multipartite entanglement or key. We make use the max-flow min-cut theorem and its (approximate) generalization to multi-commodity flows to obtain flow maximization LPs that bound our capacities. We also make use of a generalization of the concept of paths between user pairs in a network to Steiner trees spanning the group of users wishing to establish GHZ states