Quantum Solution to the Byzantine Agreement Problem

Top Cited Papers
Publisher Website
Google Scholar
Abstract
We present a solution to an old problem in distributed computing. In its simplest form, a sender has to broadcast some information to two receivers, but they have access only to pairwise communication channels. Unlike quantum key distribution, here the goal is not secrecy but agreement, and the adversary (one of the receivers or the sender himself) is not outside but inside the game. Using only classical channels this problem is provably impossible. The solution uses pairwise quantum channels and entangled qutrits.
All Related Versions

This publication has 8 references indexed in Scilit: