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

ACM Symposium on Theory of Computing (STOC)

Fast quantum byzantine agreement

Michael Ben-Or, Avinatan Hassidim

Published May 22, 2005• 129 citations
Publisher

Abstract

We present a fast quantum Byzantine Agreement protocol that can reach agreement in O(1) expected communication rounds against a strong full information, dynamic adversary, tolerating up to the optimal t‹n3 faulty players in the synchronous setting, and up to t‹n4 faulty players for asynchronous systems. This should be contrasted with the known classical synchronous lower bound of Ω(√ nlog n) [3] when t=(n).

DOI
10.1145/1060590.1060662

Related papers

Fast Quantum Byzantine Agreement with Nearly Linear Quantum Communication

Jan Olkowski

We consider synchronous binary Byzantine agreement among $n$ processes connected by authenticated point-to-point classical and quantum channels. The adversary is computationally unbounded, sees all classical information, adaptively corrupts up to $t\le(1/3-\varepsilon)n$ processes, and may suppress messages sent by a process in the round in which it is corrupted. We give a quantum algorithm that solves Byzantine agreement in this model with probability $1$. It uses $O(\log^4 n)$ rounds, $O(n\log^8 n)$ qubits, and $O(n^2\log^8 n)$ classical bits in expectation, with constants depending on $\varepsilon$. This reduces the quantum communication of the protocol of Ben-Or and Hassidim (STOC~2005), which achieves $O(1)$ expected rounds but whose Byzantine coin implementation requires $Ω(n^4\log n)$ qubits and classical bits. We also extend the quadratic message lower bound of Abraham et al.\ (PODC~2019) to quantum channels, obtaining an $Ω(t^2)$ lower bound on worst-case expected total communication. For $t=Θ(n)$, the communication and round complexity of our algorithm are therefore optimal up to polylogarithmic factors.

arXiv:2611.05598•Nov 3, 2026•0 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

Efficient quantum detectable weak Byzantine agreement with optimal fault-tolerant bound

Lide Xue, Wei Yang, BingRen Chen +2 more

Quantum entanglement can be employed in some distributed communication tasks to reduce computation and communication overheads, yielding speedups over their classical counterparts. However, existing quantum Byzantine protocols often entail excessive communication and entanglement resource consumption. Conversely, classical schemes face insecurity with the impending reality of quantum computers. To address these challenges, we present a novel quantum Detectable Weak Byzantine Agreement (DWBA) protocol with high practicability, security and optimal fault-tolerance bound. For all n players, our protocol can complete the consensus of infinite classical information via fixed n + 1 -entangled qubits and a digest function, which requires infinite entanglement resources in previous schemes. Moreover, our protocol can tolerate arbitrary t ( t < n ) faulty players without necessitating any additional initial setup information (e.g., digital signature, private random coins). In terms of efficiency, our protocol only requires O (1) rounds and O ( ( n − t ) 2 ) communication complexity, constituting an order of magnitude improvement over previous protocols. In addition, the DWBA problem solved by our protocol is inherently stronger than the 3-player Detectable Byzantine Agreement (DBA) problem solved by previous protocols, and in a weaker but sufficiently practical model, our protocol can achieve Weak Byzantine Agreement (WBA).

Information and Computation•Jul 24, 2026•0 citations

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

A Quantum Detectable Byzantine Agreement Protocol Using Only EPR Pairs

Theodore Andronikos, Alla Sirokofskich

In this paper, we introduce a new quantum protocol for Detectable Byzantine Agreement. What distinguishes the proposed protocol among similar quantum protocols, is the fact that it uses only EPR pairs, and, in particular, |Ψ+⟩ pairs. There are many sophisticated quantum protocols that guarantee Detectable Byzantine Agreement, but they do not easily lend themselves to practical implementations, due to present-day technological limitations. For a large number n of players, |GHZ⟩n-tuples, or other more exotic entangled states, are not easy to produce, a fact which might complicate the scalability of such protocols. In contrast, Bell states are, undoubtedly, the easiest to generate among maximally entangled states. This will, hopefully, facilitate the scalability of the proposed protocol, as only EPR pairs are required, irrespective of the number n of players. Finally, we mention that, even for arbitrary many players n, our protocol always completes in a constant number of rounds, namely 4.

arXiv:2306.10825•Applied Sciences•Jul 20, 2023•11 citations

Multi-Party Quantum Byzantine Agreement without Entanglement

Xin Sun, Piotr Kulicki, Mirek Sopek

In this paper, we propose a protocol of quantum communication to achieve Byzantine agreement among multiple parties. Our protocol's striking feature compared to the existing protocols is that we do not use entanglement to achieve the agreement. The role played by entangled states in other protocols is replaced in our protocol by a group of semi-honest list distributors. Such a replacement makes the implementation of our protocol more feasible. Moreover, our protocol is efficient in the sense that it achieves agreement in only three rounds which is a significant improvement with respect to the alternative agreement protocol not using entanglement. In the first round, a list of numbers that satisfies some special properties is distributed to every participant by list distributors via quantum secure communication. Then, in the second and third rounds, those participants exchange some information to reach an agreement.

arXiv:2003.09120•Entropy•Oct 14, 2020•23 citations
We present a fast quantum Byzantine Agreement protocol that can reach agreement in O(1) expected communication rounds against a strong full information, dynamic adversary, tolerating up to the optimal t‹n3 faulty players in the synchronous setting, and up to t‹n4 faulty players for asynchronous systems. This should be contrasted with the known classical synchronous lower bound of Ω(√ nlog n) [3] when t=(n).
We consider synchronous binary Byzantine agreement among nnn processes connected by authenticated point-to-point classical and quantum channels. The adversary is computationally unbounded, sees all classical information, adaptively corrupts up to t≤(1/3−ε)nt\le(1/3-\varepsilon)nt≤(1/3−ε)n processes, and may suppress messages sent by a process in the round in which it is corrupted. We give a quantum algorithm that solves Byzantine agreement in this model with probability 111. It uses O(log⁡4n)O(\log^4 n)O(log4n) rounds, O(nlog⁡8n)O(n\log^8 n)O(nlog8n) qubits, and O(n2log⁡8n)O(n^2\log^8 n)O(n2log8n) classical bits in expectation, with constants depending on ε\varepsilonε. This reduces the quantum communication of the protocol of Ben-Or and Hassidim (STOC~2005), which achieves O(1)O(1)O(1) expected rounds but whose Byzantine coin implementation requires Ω(n4log⁡n)Ω(n^4\log n)Ω(n4logn) qubits and classical bits. We also extend the quadratic message lower bound of Abraham et al.\ (PODC~2019) to quantum channels, obtaining an Ω(t2)Ω(t^2)Ω(t2) lower bound on worst-case expected total communication. For t=Θ(n)t=Θ(n)t=Θ(n), the communication and round complexity of our algorithm are therefore optimal up to polylogarithmic factors.
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.
Quantum entanglement can be employed in some distributed communication tasks to reduce computation and communication overheads, yielding speedups over their classical counterparts. However, existing quantum Byzantine protocols often entail excessive communication and entanglement resource consumption. Conversely, classical schemes face insecurity with the impending reality of quantum computers. To address these challenges, we present a novel quantum Detectable Weak Byzantine Agreement (DWBA) protocol with high practicability, security and optimal fault-tolerance bound. For all n players, our protocol can complete the consensus of infinite classical information via fixed n + 1 -entangled qubits and a digest function, which requires infinite entanglement resources in previous schemes. Moreover, our protocol can tolerate arbitrary t ( t < n ) faulty players without necessitating any additional initial setup information (e.g., digital signature, private random coins). In terms of efficiency, our protocol only requires O (1) rounds and O ( ( n − t ) 2 ) communication complexity, constituting an order of magnitude improvement over previous protocols. In addition, the DWBA problem solved by our protocol is inherently stronger than the 3-player Detectable Byzantine Agreement (DBA) problem solved by previous protocols, and in a weaker but sufficiently practical model, our protocol can achieve Weak Byzantine Agreement (WBA).
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.
In this paper, we introduce a new quantum protocol for Detectable Byzantine Agreement. What distinguishes the proposed protocol among similar quantum protocols, is the fact that it uses only EPR pairs, and, in particular, |Ψ+⟩ pairs. There are many sophisticated quantum protocols that guarantee Detectable Byzantine Agreement, but they do not easily lend themselves to practical implementations, due to present-day technological limitations. For a large number n of players, |GHZ⟩n-tuples, or other more exotic entangled states, are not easy to produce, a fact which might complicate the scalability of such protocols. In contrast, Bell states are, undoubtedly, the easiest to generate among maximally entangled states. This will, hopefully, facilitate the scalability of the proposed protocol, as only EPR pairs are required, irrespective of the number n of players. Finally, we mention that, even for arbitrary many players n, our protocol always completes in a constant number of rounds, namely 4.
In this paper, we propose a protocol of quantum communication to achieve Byzantine agreement among multiple parties. Our protocol's striking feature compared to the existing protocols is that we do not use entanglement to achieve the agreement. The role played by entangled states in other protocols is replaced in our protocol by a group of semi-honest list distributors. Such a replacement makes the implementation of our protocol more feasible. Moreover, our protocol is efficient in the sense that it achieves agreement in only three rounds which is a significant improvement with respect to the alternative agreement protocol not using entanglement. In the first round, a list of numbers that satisfies some special properties is distributed to every participant by list distributors via quantum secure communication. Then, in the second and third rounds, those participants exchange some information to reach an agreement.