ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2206.09159
65
22
v1v2v3 (latest)

Beating the fault-tolerance bound and security loopholes for Byzantine agreement with a quantum solution

18 June 2022
Chenkai Weng
Rui-Qi Gao
Yu Bao
Bing-Hong Li
Wen-Bo Liu
Yuan-Mei Xie
Yu-Shuo Lu
Hua‐Lei Yin
Zeng-Bing Chen
ArXiv (abs)PDFHTML
Abstract

Byzantine agreement, the underlying core of blockchain, aims to make every node in a decentralized network reach consensus. Classical Byzantine agreements unavoidably face two major problems. One is 1/31/31/3 fault-tolerance bound, which means that the system to tolerate fff malicious players requires at least 3f+13f+13f+1 players. The other is the security loopholes from its classical cryptography methods. Here, we propose a strict quantum Byzantine agreement with unconditional security to break this bound with nearly 1/21/21/2 fault tolerance due to multiparty correlation provided by quantum digital signatures. Our work strictly obeys the original Byzantine conditions and can be extended to any number of players without requirements for multiparticle entanglement. We experimentally demonstrate three-party and five-party quantum consensus for a digital ledger. Our work indicates the quantum advantage in terms of consensus problems and suggests an important avenue for quantum blockchain and quantum consensus networks.

View on arXiv
Comments on this paper