Quantum Byzantine agreement - Wikipedia, the free encyclopedia
Byzantine fault tolerant protocols are algorithms that are robust to arbitrary types of failures in distributed algorithms. With the advent and popularity of the Internet, there is a need to develop algorithms that do not require any centralized control that have some guarantee of always working correctly. The Byzantine agreement protocol is an essential part of this task. In this article the quantum version of the Byzantine protocol,[1] which works in constant time is described.
Read full article from Quantum Byzantine agreement - Wikipedia, the free encyclopedia
No comments:
Post a Comment