NDLI: Exact Quantum Algorithms for the Leader Election Problem

Please wait, while we are loading the content...

Exact Quantum Algorithms for the Leader Election Problem

Content Provider	ACM Digital Library
Author	Kobayashi, Hirotada Matsumoto, Keiji Tani, Seiichiro
Copyright Year	2012
Abstract	This article gives a separation between quantum and classical models in pure (i.e., noncryptographic) computing abilities with no restriction on the amount of available computing resources, by considering the exact solvability of the leader election problem in anonymous networks, a celebrated unsolvable problem in classical distributed computing. The goal of the leader election problem is to elect a unique leader from among distributed parties. In an anonymous network, all parties with the same number of communication links are identical. It is well-known that no classical algorithm can exactly solve (i.e., in bounded time without error) the leader election problem in anonymous networks, even if the number of parties is given. This article devises a quantum algorithm that, if the number of parties is given, exactly solves the problem for any network topology in polynomial rounds with polynomial communication/time complexity with respect to the number of parties, when the parties are connected with quantum communication links and they have the ability of quantum computing. Our algorithm works even when only an upper bound of the number of parties is given. In such a case, no classical algorithm can solve the problem even under the zero-error setting, the setting in which error is not allowed but running time may be unbounded.
Starting Page	1
Ending Page	24
Page Count	24
File Format	PDF
ISSN	19423454
e-ISSN	19423462
DOI	10.1145/2141938.2141939
Volume Number	4
Issue Number	1
Journal	ACM Transactions on Computation Theory (TOCT)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-03-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Distributed computing Quantum algorithms Quantum communication
Content Type	Text
Resource Type	Article
Subject	Computational Theory and Mathematics Theoretical Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Exact Quantum Algorithms for the Leader Election Problem

Leader election in asynchronous distributed systems

A leader election algorithm for dynamic networks with causal clocks

Improved bounds for electing a leader in a synchronous ring

Self-Stabilizing Leader Election in Polynomial Steps

An Algebraic Language for Distributed Quantum Computing

Mesh computer algorithms for computational geometry

How much memory is needed for leader election

Leader election for anonymous asynchronous agents in arbitrary networks

Exact Quantum Algorithms for the Leader Election Problem

Similar Documents

Exact Quantum Algorithms for the Leader Election Problem

Leader election in asynchronous distributed systems

A leader election algorithm for dynamic networks with causal clocks

Improved bounds for electing a leader in a synchronous ring

Self-Stabilizing Leader Election in Polynomial Steps

An Algebraic Language for Distributed Quantum Computing

Mesh computer algorithms for computational geometry

How much memory is needed for leader election

Leader election for anonymous asynchronous agents in arbitrary networks

Exact Quantum Algorithms for the Leader Election Problem