Fast quantum byzantine agreement

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 ).

Authors

• Michael Ben-Or
• Avinatan Hassidim

Keywords

• Byzantine agreement
• quantum computation