Hirotada Kobayashi
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.
- Y. Afek and Y. Matias. Elections in anonymous networks. Inf. Comput., 113(2):312--330, 1994. Google Scholar
Digital Library
- D. Angluin. Local and global properties in networks of processors (extended abstract). In Proc. 20th ACM STOC, pages 82--93, 1980. Google ScholarDigital Library
- H. Attiya, M. Snir, and M. K. Warmuth. Computing on an anonymous ring. J. ACM, 35(4):845--875, 1988. Google ScholarDigital Library
- G. Brassard, P. Høyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation. In Quantum Computation and Quantum Information: A Millennium Volume, AMS Contemporary Mathematics Series vol. 305, pages 53--74. 2002.Google Scholar
- R. de Wolf. Quantum communication and complexity. Theor. Comput. Sci., 287(1):337--353, 2002. Google ScholarDigital Library
- V. S. Denchev and G. Pandurangan. Distributed quantum computing: A new frontier in distributed systems or science fiction? ACM SIGACT News, 39(3):77--95, 2008. Google ScholarDigital Library
- E. D'Hondt and P. Panangaden. The computational power of the W and GHZ states. Quantum Inf. Comput., 6(2):173---183, 2006. Google ScholarDigital Library
- C. Gavoille, A. Kosowski, and M. Markiewicz. What can be observed locally? Round-based models for quantum distributed computing. arXiv:0903.1133, 2009.Google Scholar
- A. Itai and M. Rodeh. Symmetry breaking in distributive networks. In Proc. 22nd IEEE FOCS, pages 150--158, 1981. Google ScholarDigital Library
- A. Itai and M. Rodeh. Symmetry breaking in distributed networks. Inf. Comput., 88(1):60--87, 1990. Google ScholarDigital Library
- E. Kranakis and D. Krizanc. Distributed computing on cayley networks (extended abstract). In Proc. 4th IEEE SPDP, pages 222--229, 1992.Google Scholar
- E. Kranakis and D. Krizanc. Distributed computing on anonymous hypercube networks. J. Algorithms, 23(1):32--50, 1997. Google ScholarDigital Library
- E. Kranakis, D. Krizanc, and J. van den Berg. Computing boolean functions on anonymous networks. Inf. Comput., 114(2):214--236, 1994. Google ScholarDigital Library
- N. A. Lynch. Distributed Algorithms. Morgan Kaufman Publishers, 1996. Google ScholarDigital Library
- S. P. Pal, S. K. Singh, and S. Kumar. Multi-partite quantum entanglement versus randomization: Fair and unbiased leader election in networks. arXiv:quant-ph/0306195, 2003.Google Scholar
- S. Tani, H. Kobayashi, and K. Matsumoto. Exact quantum algorithms for the leader election problem. In Proc. 22nd STACS, LNCS vol. 3404, pages 581--592,2005. (Full version in arXiv:0712.4213). Google ScholarDigital Library
- M. Yamashita and T. Kameda. Computing on anonymous networks: Part I--characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst., 7(1):69--89, 1996. Google ScholarDigital Library
- M. Yamashita and T. Kameda. Computing on anonymous networks: Part II--decision and memobership problems. IEEE Trans. Parallel Distrib. Syst., 7(1):90--96, 1996. Google ScholarDigital Library
Index Terms
- Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks
Recommendations
Four shades of deterministic leader election in anonymous networks
AbstractLeader election is one of the fundamental problems in distributed computing: a single node, called the leader, must be specified. This task can be formulated either in a weak way, where one node outputs leader and all other nodes output non-leader,...
Brief Announcement: Leader Election in SINR Model with Arbitrary Power Control
PODC '17: Proceedings of the ACM Symposium on Principles of Distributed ComputingIn this article, we study the leader election problem in the Signal-to-Interference-plus-Noise-Ratio (SINR) model where nodes can adjust their transmission power. We show that in this setting it is possible to solve the leader election problem in two ...
Contextuality Supplies the Magic for Quantum Computation
ISMVL '15: Proceedings of the 2015 IEEE 45th International Symposium on Multiple-Valued LogicWe know that quantum mechanics enables the performance of computational and cryptographic tasks that are impossible (or impracticable) using only classical physics. It seems natural to examine manifestations of inherently quantum behaviour as potential ...
Comments