Brief Announcement: Improved Consensus in Quantum Networks

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.1145/3583668.3594600" rel="nofollow">DOI 10.1145/3583668.3594600</a><a class="pub-badge pub-badge--grey" href="https://openalex.org/works/W4380880753" rel="nofollow">OpenAlex</a><a class="pub-badge pub-badge--grey" href="https://www.wikidata.org/wiki/Q130910804" rel="nofollow"><img src="https://www.wikidata.org/static/favicon/wikidata.ico" class="pub-badge-icon" alt=""/>Wikidata</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q6202264" rel="nofollow">MaRDI QID Q6202264</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q6202264" rel="nofollow">FDO</a>

Authors Mohammad T. Hajiaghayi

Publication date 26 March 2024

Published in Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2305.10618

zbMATH Keywords

consensusdistributed algorithmsapproximate countingquantum algorithmscrash failuresadaptive adversaryquantum common coin

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Abstract: Fault-tolerant consensus is about reaching agreement on some of the input values in a limited time by non-faulty autonomous processes, despite of failures of processes or communication medium. This problem is particularly challenging and costly against an adaptive adversary with full information. Bar-Joseph and Ben-Or (PODC'98) were the first who proved an absolute lower bound $Omega(sqrtn/logn)$ on expected time complexity of consensus in any classic (i.e., randomized or deterministic) message-passing network with $n$ processes succeeding with probability $1$ against such a strong adaptive adversary crashing processes. Seminal work of Ben-Or and Hassidim (STOC'05) broke the $Omega(sqrtn/logn)$ barrier for consensus in classic (deterministic and randomized) networks by employing quantum computing. They showed an (expected) constant-time quantum algorithm for a linear number of crashes $t<n/3$. In this paper, we improve upon that seminal work by reducing the number of quantum and communication bits to an arbitrarily small polynomial, and even more, to a polylogarithmic number -- though, the latter in the cost of a slightly larger polylogarithmic time (still exponentially smaller than the time lower bound $Omega(sqrtn/logn)$ for classic computation).

Cites work

• scientific article; zbMATH DE number 1306905 (Why is no real title available?)
• scientific article; zbMATH DE number 6297761 (Why is no real title available?)
• A lower bound for the time to assure interactive consistency
• A tight lower bound for randomized synchronous consensus
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Bounds on information exchange for Byzantine agreement
• Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
• Communication Complexity of Byzantine Agreement, Revisited
• Communication-efficient randomized consensus
• Exact Quantum Algorithms for the Leader Election Problem
• Fast scalable deterministic consensus for crash failures
• Lower bounds for distributed coin-flipping and randomized consensus
• Message-optimal protocols for Byzantine Agreement
• On the message complexity of binary Byzantine agreement under crash failures
• Performing Work Efficiently in the Presence of Faults
• Quantum Byzantine agreement for any number of dishonest parties
• Quantum multi-valued Byzantine agreement based on d-dimensional entangled states
• Reaching Agreement in the Presence of Faults
• Robust gossiping with an application to consensus
• Scalable Quantum Consensus for Crash Failures
• Simple constant-time consensus protocols in realistic failure models
• Tight bounds for asynchronous randomized consensus

This page was built for publication: Brief Announcement: Improved Consensus in Quantum Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202264)