This requires private channels of information, so we have the random secrets of overlaying | replace φ ⟩ – 1 n ∑ a 0 n n | a « display style » ⟩| « | {1} » in which the state is coded with a quantum verifiable secret sharing protocol (QVSS). [5] We cannot distribute the state| ϕ , ϕ , … φ ⟩, | display style « `phi` To prevent bad players from doing this, we encode the state with the verifiable Secret Sharing Quantum (QVSS) and send each player its share of the secret. Here too, the revision requires a Byzantine arrangement, but just replace the agreement with the Grad Cast protocol. [6] In 2007, a quantum protocol for Byzantine chords was experimentally demonstrated [8] using a polarizing state of four photosnes. This shows that the quantum implementation of classical Byzantine chords is indeed achievable. Error-tolerant Byzantine protocols are robust algorithms compared to any type of error in distributed algorithms. With the advent and popularity of the Internet, there is a need to develop algorithms that do not require centralized control, which have some guarantee to always work properly. [Original research?] The Byzantine agreement is an essential part of this task. This article describes the quantum version of the Byzantine protocol[1] that works in constant time. To < n 4 "Displaystyle t<" {4}, the verification phase of the QVSS protocol ensures that the correct condition will be coded for a good distributor and that for any dealer that may be defective, a particular state will be restored during the recovery phase. We find that, for the purposes of our Byzantine protocol of the quantum piece Flip, the recovery phase is much simpler.
Each player measures his or her share of the QVSS and sends the classic value to all other players. The verification phase most likely ensures that in the presence of t < n 4 "Displaystyle t< {4}", defective players recover the same classic value (which is the same value that would result from a direct measurement of the coded state). A P protocol should obtain a noted transfer if, at the beginning of the minutes, a player named D (the "donor") has a value of v, and at the end of the protocol, each reader P i `displaystyle P_`i` emits a pair (v a l u e, c o n n n c e i) `displaystyle (`mathrm`∀`e i i ∈, 0, 1, 2) , Display style (`forall`, `mathrm`, « ,« `