Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

Multi-party quantum Byzantine consensus based on full quantum one-way function

Tao Shang, Yao Tang, Yuanjing Zhang, Kun Zhang, Yazhuo Jiang

Published Dec 24, 2024• 1 citation
Publisher
DOI
10.1007/s11128-024-04621-5

Related papers

Round-Efficient Byzantine Agreement and Multi-party Computation with Asynchronous Fallback

Giovanni Deligios, Martin Hirt, Chen-Da Liu-Zhang

Lecture notes in computer science•Jan 1, 2021•31 citations

Full quantum one‐way function for quantum cryptography

Fei Gao

Quantum Engineering•Feb 21, 2020•2 citations

Quantum Multi-Party Computation (QMPC) for Enhanced Blockchain Consensus

Hsiau Chuen Chong, K L Eddie Law

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Apr 6, 2026•1 citation

Implementing an information-theoretically secure Byzantine agreement with quantum signed message solution

Yao Zhou, Feng Yi Lu, Zhen Yin +4 more

arXiv:2502.05515•Quantum Information Processing•Oct 12, 2026•1 citation

Beating the Fault-Tolerance Bound and Security Loopholes for Byzantine Agreement with a Quantum Solution

Chen-Xun Weng, Rui-Qi Gao, Yu Bao +6 more

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.

arXiv:2206.09159•Research•Jan 1, 2023•46 citations

Detectable Byzantine Agreement Based on Quantum Resource Distribution

Zengyu Pang, HUA XIANG

•Jan 1, 2025•0 citations
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.