  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.
