Byzantine容错
量子纠缠
计算机科学
量子
上下界
节点(物理)
容错
量子计算机
理论计算机科学
数学
物理
分布式计算
量子力学
数学分析
作者
Chen-Xun Weng,Ruiqi Gao,Yu Bao,Bing-Hong Li,Wen‐Bo Liu,Yuan-Mei Xie,Yu-Shuo Lu,Hua‐Lei Yin,Zeng‐Bing Chen
出处
期刊:Research
[American Association for the Advancement of Science]
日期:2023-01-01
卷期号:6
被引量:15
标识
DOI:10.34133/research.0272
摘要
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/3 fault-tolerance bound, which means that the system to tolerate f malicious players requires at least 3 f + 1 players. The other is the security loopholes from its classical cryptography methods. Here, we propose a Byzantine agreement framework with unconditional security to break this bound with nearly 1/2 fault tolerance due to multiparty correlation provided by quantum digital signatures. It is intriguing that quantum entanglement is not necessary to break the 1/3 fault-tolerance bound, and we show that weaker correlation, such as asymmetric relationship of quantum digital signature, can also work. Our work strictly obeys two Byzantine conditions and can be extended to any number of players without requirements for multiparticle entanglement. We experimentally demonstrate three-party and five-party 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.
科研通智能强力驱动
Strongly Powered by AbleSci AI