Fast quantum byzantine agreement

Michael Ben-Or*, Avinatan Hassidim

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

68 Scopus citations


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 < n/3 faulty players in the synchronous setting, and up to t < n/4 faulty players for asynchronous systems. This should be contrasted with the known classical synchronous lower bound of ω(√ n/log n) [3] when t = ω(n).

Original languageAmerican English
Pages (from-to)481-485
Number of pages5
JournalProceedings of the Annual ACM Symposium on Theory of Computing
StatePublished - 2005
Event13th Color Imaging Conference: Color Science, Systems, Technologies, and Applications - Scottsdale, AZ, United States
Duration: 7 Nov 200511 Nov 2005


  • Byzantine Agreement
  • Quantum Computation


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

Cite this