We study the k-pair communication problem for quantum information in networks
of quantum channels. We consider the asymptotic rates of high fidelity quantum
communication between specific sender-receiver pairs. Four scenarios of
classical communication assistance (none, forward, backward, and two-way) are
considered. (i) We obtain outer and inner bounds of the achievable rate regions
in the most general directed networks. (ii) For two particular networks
(including the butterfly network) routing is proved optimal, and the free
assisting classical communication can at best be used to modify the directions
of quantum channels in the network. Consequently, the achievable rate regions
are given by counting edge avoiding paths, and precise achievable rate regions
in all four assisting scenarios can be obtained. (iii) Optimality of routing
can also be proved in classes of networks. The first class consists of directed
unassisted networks in which (1) the receivers are information sinks, (2) the
maximum distance from senders to receivers is small, and (3) a certain type of
4-cycles are absent, but without further constraints (such as on the number of
communicating and intermediate parties). The second class consists of arbitrary
backward-assisted networks with 2 sender-receiver pairs. (iv) Beyond the k-pair
communication problem, observations are made on quantum multicasting and a
static version of network communication related to the entanglement of
assistance.Comment: 15 pages, 17 figures. Final versio