Fast Quantum Byzantine Agreement: Difference between revisions

* The protocol [Quantum Byzantine Agreement#References|(2)] is based on the classical protocol of [Quantum Byzantine Agreement#References|(5)], where the classical Oblivious Common Coin is replaced by a Quantum version, which is based on the Verifiable Quantum Secret Sharing Scheme presented in [Quantum Byzantine Agreement#References|(6)]. The protocol of [Quantum Byzantine Agreement#References|(5)] also runs in constant expected time, but can only deal with limited-information adversaries. This means that the adversaries can not read communication between honest parties and read their internal state. The classical lower bound in the same model of <math>\Omega(\sqrt{n \log n})</math> is proven in [Quantum Byzantine Agreement#References|(4)].

* The work [Quantum Byzantine Agreement#References|(2)] also provides a protocol in a weaker failure model known as fail-stop failures. Here the nodes will crash and stop working indefinitely (stop responding). Another protocol in the same model is presented in [Quantum Byzantine Agreement#References|(7)].

* Another weakened version of the problem, known as detectable byzantine agreement, is solved with quantum resources in [Quantum Byzantine Agreement#References|(8)] (and following works). In detectable byzantine agreement, the protocol is also allowed to abort (upon detecting failures) instead of reaching agreement.