Fast quantum Byzantine agreement

Michael Ben-Or, A. Hassidim

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We present a fast quantum Byzantine Agreement protocol that can reach agreement in O(1) expected communication rounds against a strong full information, dynamic adversary, tolerating up to the optimal t‹n3 faulty players in the synchronous setting, and up to t‹n4 faulty players for asynchronous systems. This should be contrasted with the known classical synchronous lower bound of Ω(√ nlog n) [3] when t=(n).
Original languageAmerican English
Title of host publicationProceedings of the thirty-seventh annual ACM symposium on Theory of computing
StatePublished - 2005

Bibliographical note

Place of conference:USA


Dive into the research topics of 'Fast quantum Byzantine agreement'. Together they form a unique fingerprint.

Cite this