Quantum circuit and Byzantine generals problem

This paper designs quantum circuit to detect the fault components in the Byzantine generals problem. This circuit is verification circuit that can investigate the equivalence of quantum input particles. In this problem, reach agreement and liar detection are two major issues. In the quantum field, quantum secret sharing can support a special correlation among sharing party. By using this relation, quantum circuit can detect the behavior of the traitor to obtain the consistence of the Byzantine agreement. In regard to the performance, quantum solution can obtain little message exchange and more tolerant faulty components. Furthermore, the proposed circuit is scalable.