  Gossip algorithms is a common term to describe protocols for unreliable
information dissemination in natural networks, which are not optimally designed
for efficient communication between network entities. We consider application
of gossip algorithms to quantum networks and show that any quantum network can
be updated to optimal configuration with local operations and classical
communication. This allows to seed-up -- in the best case exponentially -- the
quantum information dissemination. Irrespective of the initial configuration of
the quantum network, the update requiters at most polynomial number of local
operations and classical communication.
