Write, autoreview, editor, reviewer
3,125
edits
Fast Quantum Byzantine Agreement: Difference between revisions
→Pseudocode
No edit summary |
|||
| Line 58: | Line 58: | ||
Also note that the fairness <math>p</math> of the Quantum Oblivious Common Coin is not a parameter, but rather a result of the specific implementation of the protocol. The global Byzantine Agreement protocol can then tolerate up to <math>t < \left \lfloor{pn}\right \rfloor </math> failures. The Quantum Oblivious Common Coin subroutine proposed by [[Quantum Byzantine Agreement#References|(3)]] has <math>p > 1/3</math> (synchronous case, <math>p > 1/4</math> asynchronous case). | Also note that the fairness <math>p</math> of the Quantum Oblivious Common Coin is not a parameter, but rather a result of the specific implementation of the protocol. The global Byzantine Agreement protocol can then tolerate up to <math>t < \left \lfloor{pn}\right \rfloor </math> failures. The Quantum Oblivious Common Coin subroutine proposed by [[Quantum Byzantine Agreement#References|(3)]] has <math>p > 1/3</math> (synchronous case, <math>p > 1/4</math> asynchronous case). | ||
== | ==Protocol Description== | ||
This pseudocode is based on the reference [[Quantum Byzantine Agreement#References|(1)]]. | This pseudocode is based on the reference [[Quantum Byzantine Agreement#References|(1)]]. | ||