Abstract
We present a device-independent quantum scheme for the Byzantine generals problem. The protocol is for three parties. Party is to send two identical one-bit messages to parties and . The receivers and may exchange two one-bit messages informing the other party on the message received from . A bit-flipping error in one of the transmissions does not allow the receiving parties to establish what was the message of . Our quantum protocol is based on Hardy's argument, which uses a set of conditions impossible for classical systems, but satisfied by predictions for a unique two-qubit state. The scheme has the feature that if the messages of the Byzantine protocol are readable (that is give an unambiguous bit value for any of the receivers), then any error by (cheating by one of the commanding generals) is impossible. and do not have to exchange protocol messages to be sure of this.
- Received 30 September 2014
- Revised 4 August 2015
DOI:https://doi.org/10.1103/PhysRevA.92.042302
©2015 American Physical Society