A Quantum Analogue of the Covering Lemma: Limits of Exact Anonymous Computation

Giuseppe Di Molfetta, Petra Camilli

Can quantum communication determine the size of an anonymous network when no size bound is known? Classical impossibility proofs rely on the covering lemma: an execution can be rep…