Exponential Quantum Advantage for Message Complexity in Distributed Algorithms

François Le Gall, Maël Luce, Joseph Marchand +1

We investigate how much quantum distributed algorithms can outperform classical distributed algorithms with respect to the message complexity (the overall amount of communication u…