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.

# [https://people.eecs.berkeley.edu/~luca/cs174/byzantine.pdf LSP (1982)]

# [https://iopscience.iop.org/article/10.1088/2058-9565/aa9bb1/meta TNM (2017)]

# [https://dl.acm.org/citation.cfm?id=510000 CGS (2002)]

# [https://link.springer.com/book/10.1007%2F978-3-642-15763-9 LS (2010)]

# [https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.87.217901 FGM (2001)]