pith. sign in

arxiv: 1608.04257 · v1 · pith:3KFUAFRSnew · submitted 2016-08-15 · 🪐 quant-ph

Gossip Algorithms in Quantum Networks

classification 🪐 quant-ph
keywords quantumalgorithmscommunicationgossipnetworknetworksclassicalconfiguration
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.