2001/07/25 by Matthias Fitzi, Nicolas Gisin, Ueli Maurer · 3 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1103/physrevlett.87.217901
published as Physical Review Letters, 87, 217901/1-4, 2001 · 4 pages, 1 figure
arxiv created 2001/07/25 · openalex publication_date 2001/11/01 · arxiv updated 2013/01/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
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.