Abstract:
The following problem is considered: a finite set of nodes (vertices of a graph or hypergraph) is connected by sources of two-particle entangled states (edges) and/or sources of GHZ states (Greenberger-Horne-Zeilinger states) linking several nodes simultaneously (hyperedges). In one "round" (unit of time), each source generates its state. A certain subset of nodes wishes to generate a common secret conference key or GHZ state. The task is to do this at the highest rate, i.e., to generate as many bits of the conference key or, respectively, GHZ states per unit time as possible. The talk will describe how this problem can be solved, and the problem of rigorously deriving the maximum achievable rates.
|
