Brief Announcement: Improved Consensus in Quantum Networks

DOI10.1145/3583668.3594600arXiv2305.10618OpenAlexW4380880753WikidataQ130910804 ScholiaQ130910804MaRDI QIDQ6202264

Unnamed Author, Mohammad Taghi Hajiaghayi, Unnamed Author

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

quantum algorithmsdistributed algorithmsconsensusapproximate countingcrash failuresadaptive adversaryquantum common coin

Mathematics Subject Classification ID

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

Cites Work

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

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