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

Authors:
Hirotada Kobayashi;Keiji Matsumoto;Seiichiro Tani
Affiliations:
National Institute of Informatics, Tokyo, Japan;National Institute of Informatics, Tokyo, Japan;NTT Corporation, Atsugi, Japan
Venue:
Proceedings of the 28th ACM symposium on Principles of distributed computing
Year:
2009

Citing 14
Cited 0

Computing on an anonymous ring

Journal of the ACM (JACM)
Symmetry breaking in distributed networks

Information and Computation
Elections in anonymous networks

Information and Computation
Computing Boolean functions on anonymous networks

Information and Computation
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases

IEEE Transactions on Parallel and Distributed Systems
Computing on Anonymous Networks: Part II-Decision and Membership Problems

IEEE Transactions on Parallel and Distributed Systems
Distributed computing on anonymous hypercube networks

Journal of Algorithms
Distributed Algorithms

Distributed Algorithms
Quantum communication and complexity

Theoretical Computer Science - Natural computing
Local and global properties in networks of processors (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Symmetry breaking in distributive networks

SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Distributed quantum computing: a new frontier in distributed systems or science fiction?

ACM SIGACT News
The computational power of the W And GHZ States

Quantum Information & Computation
Exact quantum algorithms for the leader election problem

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proves that, if quantum communication and computation are available and the number of parties is given, the leader election problem can exactly (i.e., without error in bounded time) be solved with at most the same complexity up to a constant factor as that of computing certain symmetric functions on an anonymous network of any unknown topology. Together with a novel quantum algorithm that computes a certain symmetric function, this characterization yields a quantum leader election algorithm that is more efficient than existing algorithms.