# Quantum Advantage for the LOCAL Model in Distributed Computing

arXiv: https://arxiv.org/abs/1810.10838 · HTML: https://mlsanity.com/paper/1810.10838/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 Oct 2018.

## Built on by (most cited first, 1 of 1)

- [Federated learning with distributed fixed design quantum chips and quantum channels](https://mlsanity.com/paper/2401.13421/) (2024)

## Abstract (arXiv)

There are two central models considered in (fault-free synchronous) distributed computing: the CONGEST model, in which communication channels have limited bandwidth, and the LOCAL model, in which communication channels have unlimited bandwidth. Very recently, Le Gall and Magniez (PODC 2018) showed the superiority of quantum distributed computing over classical distributed computing in the CONGEST model. In this work we show the superiority of quantum distributed computing in the LOCAL model: we exhibit a computational task that can be solved in a constant number of rounds in the quantum setting but requires Omega(n) rounds in the classical setting, where n denotes the size of the network.