Gossip Algorithms in Quantum Networks

TL;DR

This paper demonstrates that applying gossip algorithms to quantum networks enables efficient, near-optimal configuration updates using local operations and classical communication, significantly speeding up quantum information dissemination.

Contribution

It introduces a method to optimize quantum network configurations via gossip algorithms, achieving exponential speed-ups in information dissemination.

Findings

Quantum networks can be efficiently optimized with gossip algorithms.

Network updates require at most polynomial local operations and classical communication.

The method accelerates quantum information dissemination exponentially in the best case.

Abstract

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.