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

arXiv:2502.05515 · Quantum Information Processing

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

Yao Zhou, Feng Yi Lu, Zhen Yin, Shuang Wang, Wei Chen, Guang‐Can Guo, Zhaowei Han

Published Oct 12, 2026• 1 citation
arXivHTMLPDF
DOI
10.1007/s11128-026-05332-9

Related papers

Efficient Byzantine agreement secure against general adversaries: Extended abstract

Matthias Fitzi, Ueli M. Maurer

Lecture notes in computer science•Jan 1, 1998•61 citations

Detectable Byzantine Agreement Based on Quantum Resource Distribution

Zengyu Pang, HUA XIANG

•Jan 1, 2025•0 citations

Quantum Byzantine Agreement for Any Number of Dishonest Parties

Vicent Cholvi

Abstract Reaching agreement in the presence of arbitrary faults is a fundamental problem in distributed computation, which has been shown to be unsolvable if one-third of the processes can fail, unless signed messages are used. In this paper, we propose a solution to a variation of the original BA problem, called Detectable Byzantine Agreement (DBA), that does not need to use signed messages. The proposed algorithm uses what we call Q-correlated lists, which are generated by a quantum source device. Once each process has one of these lists, they use them to reach the agreement in a classical manner. Although, in general, the agreement is reached by using $$m+1$$ m + 1 rounds (where m is the number of processes that can fail), if less than one-third of the processes fail it only needs one round to reach the agreement.

arXiv:2112.09437•Quantum Information Processing•Apr 1, 2022•11 citations

Quantum Byzantine Agreement with Tripartite Entangled States

Yanyan Feng, Ronghua Shi, Jian Zhou +2 more

International Journal of Theoretical Physics•Mar 7, 2019•13 citations

Quantum Byzantine Agreement Against Full-Information Adversary

Longcheng Li, Xiaoming Sun, Jiadong Zhu

We exhibit that, when given a classical Byzantine agreement protocol designed in the private-channel model, it is feasible to construct a quantum agreement protocol that can effectively handle a full-information adversary. Notably, both protocols have equivalent levels of resilience, round complexity, and communication complexity. In the classical private-channel scenario, participating players are limited to exchanging classical bits, with the adversary lacking knowledge of the exchanged messages. In contrast, in the quantum full-information setting, participating players can exchange qubits, while the adversary possesses comprehensive and accurate visibility into the system's state and messages. By showcasing the reduction from quantum to classical frameworks, this paper demonstrates the strength and flexibility of quantum protocols in addressing security challenges posed by adversaries with increased visibility. It underscores the potential of leveraging quantum principles to improve security measures without compromising on efficiency or resilience. By applying our reduction, we demonstrate quantum advantages in the round complexity of asynchronous Byzantine agreement protocols in the full-information model. It is well known that in the full-information model, any classical protocol requires $Ω(n)$ rounds to solve Byzantine agreement with probability one even against Fail-stop adversary when resilience $t=Θ(n)$. We show that quantum protocols can achieve $O(1)$ rounds (i) with resilience $t0$, therefore surpassing the classical lower bound.

arXiv:2409.01707•Leibniz international proceedings in informatics•Jan 1, 2024•5 citations

Practical quantum Byzantine protocol via nearly optimal entanglement resources

Lide Xue, Bingren Chen, Wei Yang +1 more

Quantum Information Processing•Aug 20, 2019•5 citations
Abstract Reaching agreement in the presence of arbitrary faults is a fundamental problem in distributed computation, which has been shown to be unsolvable if one-third of the processes can fail, unless signed messages are used. In this paper, we propose a solution to a variation of the original BA problem, called Detectable Byzantine Agreement (DBA), that does not need to use signed messages. The proposed algorithm uses what we call Q-correlated lists, which are generated by a quantum source device. Once each process has one of these lists, they use them to reach the agreement in a classical manner. Although, in general, the agreement is reached by using m+1m+1m+1 m + 1 rounds (where m is the number of processes that can fail), if less than one-third of the processes fail it only needs one round to reach the agreement.
We exhibit that, when given a classical Byzantine agreement protocol designed in the private-channel model, it is feasible to construct a quantum agreement protocol that can effectively handle a full-information adversary. Notably, both protocols have equivalent levels of resilience, round complexity, and communication complexity. In the classical private-channel scenario, participating players are limited to exchanging classical bits, with the adversary lacking knowledge of the exchanged messages. In contrast, in the quantum full-information setting, participating players can exchange qubits, while the adversary possesses comprehensive and accurate visibility into the system's state and messages. By showcasing the reduction from quantum to classical frameworks, this paper demonstrates the strength and flexibility of quantum protocols in addressing security challenges posed by adversaries with increased visibility. It underscores the potential of leveraging quantum principles to improve security measures without compromising on efficiency or resilience. By applying our reduction, we demonstrate quantum advantages in the round complexity of asynchronous Byzantine agreement protocols in the full-information model. It is well known that in the full-information model, any classical protocol requires Ω(n)Ω(n)Ω(n) rounds to solve Byzantine agreement with probability one even against Fail-stop adversary when resilience t=Θ(n)t=Θ(n)t=Θ(n). We show that quantum protocols can achieve O(1)O(1)O(1) rounds (i) with resilience t0t0t0, therefore surpassing the classical lower bound.