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

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2009, Pages 334-335

  Kobayashi, Hirotada ^a,b   Matsumoto, Keiji ^a,b   Tani, Seiichiro ^b,c  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^c NTT Corporation   (Japan)

Author keywords

Algorithms; F.1.1 computation by abstract devices : Models of computation; F.1.2 computation by abstract devices : Modes of computation; F.2.0 analysis of algorithms and problem complexity :General; Theory

Indexed keywords

ANONYMOUS NETWORKS; CONSTANT FACTORS; F.1.1 [COMPUTATION BY ABSTRACT DEVICES]: MODELS OF COMPUTATION; F.1.2 [COMPUTATION BY ABSTRACT DEVICES]: MODES OF COMPUTATION; F.2.0 [ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY]:GENERAL; LEADER ELECTION ALGORITHM; LEADER ELECTION PROBLEM; QUANTUM ALGORITHMS; QUANTUM COMMUNICATION; QUANTUM NETWORK; SYMMETRIC FUNCTIONS; THEORY;

ABSTRACTING; ALGORITHMS; COMPUTER SCIENCE; COMPUTER SYSTEM RECOVERY; FUNCTION EVALUATION; QUANTUM THEORY;

COMPUTATIONAL EFFICIENCY;

EID: 70350641334     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1582716.1582796     Document Type: Conference Paper

References (18)

1. Y. Afek and Y. Matias. Elections in anonymous networks. Inf. Comput., 113(2):312-330, 1994.
2. D. Angluin. Local and global properties in networks of processors (extended abstract). In Proc. 20th ACM STOC, pages 82-93, 1980.
3. H. Attiya, M. Snir, and M. K. Warmuth. Computing on an anonymous ring. J. ACM, 35(4):845-875, 1988.
4. 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.
5. R. de Wolf. Quantum communication and complexity. Theor. Comput. Sci., 287(1):337-353, 2002.
6. 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.
7. E. D'Hondt and P. Panangaden. The computational power of the W and GHZ states. Quantum Inf. Comput., 6(2):173-183, 2006.
8. C. Gavoille, A. Kosowski, and M. Markiewicz. What can be observed locally? Round-based models for quantum distributed computing. arXiv:0903.1133, 2009.
9. A. Itai and M. Rodeh. Symmetry breaking in distributive networks. In Proc. 22nd IEEE FOCS, pages 150-158, 1981.
10. A. Itai and M. Rodeh. Symmetry breaking in distributed networks. Inf. Comput., 88(1):60-87, 1990.
11. E. Kranakis and D. Krizanc. Distributed computing on cayley networks (extended abstract). In Proc. 4th IEEE SPDP, pages 222-229, 1992.
12. E. Kranakis and D. Krizanc. Distributed computing on anonymous hypercube networks. J. Algorithms, 23(1):32-50, 1997.
13. E. Kranakis, D. Krizanc, and J. van den Berg. Computing boolean functions on anonymous networks. Inf. Comput., 114(2):214-236, 1994.
14. N. A. Lynch. Distributed Algorithms. Morgan Kaufman Publishers, 1996.
15. 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.
16. 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).
17. 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.
18. 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.