activity
20242026
collaborators
Showing cs.DCShow all

9 papers · 1 filter

cs.DC2026

DejaVu: A Minimalistic Mechanism for Distributed Plurality Consensus

Francesco d'Amore, Niccolò D'Archivio, George Giakkoupis +2

We study the plurality consensus problem in distributed systems where a population of extremely simple agents, each initially holding one of opinions, aims to agree on the init…

cs.DC2025

On the -majority dynamics with many opinions

Francesco d'Amore, Niccolò D'Archivio, George Giakkoupis +1

We present the first upper bound on the convergence time to consensus of the well-known -majority dynamics with opinions, in the synchronous setting, for and that ar…

cs.DC2025

New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs

Alkida Balliu, Corinna Coupette, Antonio Cruciani +6

In this work, we give two results that put new limits on distributed quantum advantage in the context of the LOCAL model of distributed computing. First, we show that there is no d…

cs.DC2025

Distributed Quantum Advantage in Locally Checkable Labeling Problems

Alkida Balliu, Filippo Casagrande, Francesco d'Amore +6

In this paper, we present the first known example of a locally checkable labeling problem (LCL) that admits asymptotic distributed quantum advantage in the LOCAL model of distribut…

cs.DC2025

On the Limits of Distributed Quantum Computing

Francesco d'Amore

Quantum advantage is well-established in centralized computing, where quantum algorithms can solve certain problems exponentially faster than classical ones. In the distributed set…

cs.DC2024

Distributed Quantum Advantage for Local Problems

Alkida Balliu, Sebastian Brandt, Xavier Coiteux-Roy +10

We present the first local problem that shows a super-constant separation between the classical randomized LOCAL model of distributed computing and its quantum counterpart. By prio…