Exact quantum algorithms for the leader election problem

Authors:
Seiichiro Tani;Hirotada Kobayashi;Keiji Matsumoto
Affiliations:
,NTT Communication Science Laboratories, NTT Corporation, Kanagawa, Japan;Quantum Computation and Information Project, ERATO, Japan Science and Technology Agency, Tokyo, Japan;,Quantum Computation and Information Project, ERATO, Japan Science and Technology Agency, Tokyo, Japan
Venue:
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Year:
2005

Citing 13
Cited 4

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Symmetry breaking in distributed 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
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Exponential separation of quantum and classical communication complexity

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Unconditional security in quantum cryptography

Journal of the ACM (JACM)
Secure multi-party quantum computation

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Distributed Algorithms

Distributed Algorithms
Local and global properties in networks of processors (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Exponential separation of quantum and classical one-way communication complexity

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Multiparty Quantum Coin Flipping

CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Perfectly concealing quantum bit commitment from any quantum one-way permutation

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Distributed quantum computing: a new frontier in distributed systems or science fiction?

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

Proceedings of the 28th ACM symposium on Principles of distributed computing
What can be observed locally? round-based models for quantum distributed computing

DISC'09 Proceedings of the 23rd international conference on Distributed computing
The computational power of the W And GHZ States

Quantum Information & Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper gives two quantum algorithms that, when the parties are connected by quantum communication links, can exactly solve the problem for any network topology in polynomial rounds and polynomial communication/time complexity with respect to the number of parties. Our algorithms work well even in the case where only the upper bound of the number of parties is given.