Gossip algorithms in quantum networks

Siomau, Michael

doi:10.1016/j.physleta.2016.10.057

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_2378041_4

DetailsSummary

Released

Journal Article

Gossip algorithms in quantum networks

MPS-Authors

/persons/resource/persons199638

Siomau, Michael
Max Planck Research Group Network Dynamics, Max Planck Institute for Dynamics and Self-Organization, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Siomau, M. (2017). Gossip algorithms in quantum networks. Physics Letters A, 381(3), 136-139. doi:10.1016/j.physleta.2016.10.057.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002C-2DCD-1

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 speed-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.