We proved that the leader election problem \LEn can exactly be
solved with at most the same complexity (up to constant factor) as
that of computing symmetric Boolean functions on an anonymous quantum
network. In particular, the hardness of the leade…