Gossip algorithms in quantum networks

Siomau, Michael

doi:10.1016/j.physleta.2016.10.057

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

このアイテムの新しいバージョンが利用可能です:
https://pure.mpg.de/pubman/item/item_2378041_4

詳細要約

公開

学術論文

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

There are no locators available

Fulltext (restricted access)

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

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

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

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

要旨

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.