Speaker
Description
In an entanglement summoning task, a set of distributed, cooperating parties attempt to fulfill requests to prepare entanglement between distant locations. The parties share limited communication resources: timing constraints may require the entangled state to be prepared before some pairs of distant parties can communicate, and a restricted set of links in a quantum network may further constrain communication. Such a task may arise in real-world quantum networking scenarios, where a set of labs under timing constraints may want to generate entanglement between a specific pair of labs to implement a quantum protocol.
Building on previous work, we continue the characterization of entanglement summoning. In particular, we provide an if and only if condition on entanglement summoning tasks with only bidirected causal connections between parties, and we offer a set of sufficient conditions that addresses the most general case, encompassing both oriented and bidirected causal connections. Our results rely on the recent development of entanglement sharing schemes.
| Keyword-1 | Quantum network |
|---|---|
| Keyword-2 | Entanglement |
| Keyword-3 | Quantum task |