Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks.

Hirotada Kobayashi Keiji Matsumoto Seiichiro Tani Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks. 334-335 2009 PODC http://doi.acm.org/10.1145/1582716.1582796 conf/podc/2009 db/conf/podc/podc2009.html#KobayashiMT09