Quantum Byzantine Agreement Against Full-information AdversaryQuantum Byzantine Agreement • September 4th, 2024
Quantum-Error-Mitigated Detectable Byzantine Agreement with Dynamical Decoupling for Distributed Quantum ComputingQuantum Byzantine Agreement • November 7th, 2023
In the burgeoning domain of distributed quantum computing, achieving consensus amidst adver- sarial settings remains a pivotal challenge. We introduce an enhancement to the Quantum Byzantine Agreement (QBA) protocol, uniquely incorporating advanced error mitigation techniques: Twirled Readout Error Extinction (T-REx) and dynamical decoupling (DD)[1, 2]. Central to this refined approach is the utilization of a Noisy Intermediate Scale Quantum (NISQ) source device for height- ened performance [3]. Extensive tests on both simulated and real-world quantum devices, notably IBM’s quantum computer, provide compelling evidence of the effectiveness of our T-REx and DD adaptations in mitigating prevalent quantum channel errors.
Quantum Byzantine Agreement via Hardy correlations and entanglement swappingQuantum Byzantine Agreement • August 16th, 2018
We present a device-independent quantum scheme for the Byzantine Generals problem. The protocol is for three parties. Party C is to send two identical one bit messages to parties A and B. The receivers A and B may exchange two one bit messages informing the other party on the message received from C. A bit flipping error in one of the transmissions, does not allow the receiving parties to establish what was the message of C. Our quantum 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 C (cheating by one of the commanding general) is impossible. A and B do not have to exchange protocol messages to be sure of this.
