A Quantum solution to the Byzantine agreement problem
classification
🪐 quant-ph
keywords
quantumagreementproblemsolutionachieveadversarybyzantinechannels
read the original abstract
We present a solution to an old and timely problem in distributed computing. Like Quantum Key Distribution (QKD), quantum channels make it possible to achieve taks classically impossible. However, unlike QKD, here the goal is not secrecy but agreement, and the adversary is not outside but inside the game, and the resources require qutrits.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.