Write, autoreview, editor, reviewer
3,129
edits
Fast Quantum Byzantine Agreement: Difference between revisions
→Notations Used
| Line 25: | Line 25: | ||
**<math>b_i:</math> input bit of player <math>i</math> | **<math>b_i:</math> input bit of player <math>i</math> | ||
**<math>d:</math> the agreement value at the end of the protocol | **<math>d:</math> the agreement value at the end of the protocol | ||
===Relevant Parameters=== | |||
The number of players <math>n$ and the number of failures <math>t</math> are previously introduced parameters of the agreement protocol. The Quantum Oblivious Common Coin protocol has a single parameter <math>k</math> (used in Verified Quantum Secret Sharing scheme), but it is unclear from the works [[Quantum Byzantine Agreement#References|(1), (3)]] how this influences the guarantees of the protocol. 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>. The Quantum Oblivious Common Coin subroutine proposed by [[Quantum Byzantine Agreement#References|(3)]] has <math>p > \frac{1}{3}</math> (synchronous case, <math>p > \frac{1}{4}</math> asynchronous case). | |||
==Hardware Requirements== | ==Hardware Requirements== | ||