Distributing bipartite quantum systems under timing constraints

TL;DR

This paper investigates how to distribute entangled bipartite quantum states in quantum networks with timing constraints, analyzing one-way and two-way communication scenarios to understand the feasibility of various distribution tasks.

Contribution

It introduces new analysis of bipartite state distribution under timing constraints, extending previous work on summoning quantum systems with partial results for two-way communication.

Findings

Characterizes achievability of distribution tasks with one-way communication.

Provides partial results for two-way communication scenarios.

Builds on earlier summoning protocols for quantum systems.

Abstract

In many quantum information processing protocols, entangled states shared among parties are an important resource. In this article, we study how bipartite states may be distributed in the context of a quantum network limited by timing constraints. We explore various tasks that plausibly arise in this context, and characterize the achievability of several of these in settings where only one-way communication is allowed. We provide partial results in the case where two-way communication is allowed. This builds on earlier work on summoning single and bipartite systems.