Gossip algorithms in quantum networks
From MaRDI portal
Publication:1691019
DOI10.1016/J.PHYSLETA.2016.10.057zbMATH Open1378.90035arXiv1608.04257OpenAlexW2508670504MaRDI QIDQ1691019FDOQ1691019
Authors: Michael Siomau
Publication date: 12 January 2018
Published in: Physics Letters. A (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1608.04257
Recommendations
Social networks; opinion dynamics (91D30) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) Communication networks in operations research (90B18)
Cites Work
- Complex networks: structure and dynamics
- Metric structure of random networks
- Title not available (Why is that?)
- Entanglement of formation of an arbitrary state of two qubits
- Quantum walks: a comprehensive review
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Gossip algorithms
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)