Gossip Algorithms in Quantum Networks
arXiv:1608.04257 · doi:10.1016/j.physleta.2016.10.057
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.
arXiv comment5 pages, 1 figure, 15 references
References in corpus (8)
- Entanglement of Formation of an Arbitrary State of Two Qubits
- The Quantum Internet
- Quantum walks: a comprehensive review
- Entanglement of pure states for a single copy
- Entanglement Percolation in Quantum Networks
- Quantum Cloning Machines and the Applications
- A Quantum Model for Autonomous Learning Automata
- Quantum Entanglement Percolation