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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- Complex networks: structure and dynamics
- Entanglement of formation of an arbitrary state of two qubits
- Gossip algorithms
- Metric structure of random networks
- Quantum walks: a comprehensive review
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Cited in
(1)
This page was built for publication: Gossip algorithms in quantum networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1691019)