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

Entangled state testing in the quantum Byzantine agreement

Heng-yue JIA Xia WU, Heng-yue JIA, Jian-ming ZHU

Published Nov 1, 2016• 0 citations
Publisher

Abstract

In distributed computing,Byzantine agreement is a practical method to solve its fault-tolerance problem.There is a variation of the Byzantine agreement which is called detectable Byzantine agreement.This kind of protocol is unsolvable by classical means,but can be solved using quantum resources——quantum entangled states.A typical quantum detectable Byzantine agreement is the GBKCW protocol.The part with the generation and distribution of the lists in the GBKCW protocol was dealed with.In order to keep the GBKCW protocol from the intercept-and-resend strategy,the property of the determination of entangled states were employed to test the sharing state between the parties.

DOI
10.11959/j.issn.2096-109x.2016.00110

Related papers

An improved quantum solution to the detectable byzantine problem

Xiaojun Wen, Yongzhi Chen, Zhi-Jia Lu +4 more

In distributed computing systems such as blockchain, Byzantine protocol is a practical method to solve its fault-tolerance problem. The Byzantine question has a variant called the “detectable Byzantine protocol.” This type of protocol is unsolvable in the classical field, but it can be solved using quantum physics properties in quantum systems. Based on the wonderful characteristics of quantum entanglement, a method of quantum channel detection, generation and safe distribution of digital lists is designed by using two quantum entangled states of three photons as quantum channels, so as to solve the tripartite Byzantine problem of detection more simply. Finally, the correctness and security of the scheme are analyzed.

Modern Physics Letters A•Jul 29, 2025•0 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

A New Solution to Detectable Byzantine Agreement Problem

Qin Su-Juan, Wen Qiao-yan, Luoming Meng +1 more

We present a new quantum protocol for solving detectable Byzantine agreement problem between three parties by employing one quantum key distribution protocol. The protocol is suggested by a special four-qubit entangled state instead of singlet states, which shows that singlet states are not necessary to achieve detectable Byzantine agreement.

Communications in Theoretical Physics•Dec 1, 2009•0 citations

Experimental Demonstration of a Quantum Protocol for Byzantine Agreement and Liar Detection

Sascha Gaertner, Mohamed Bourennane, Christian Kurtsiefer +2 more

We introduce a new quantum protocol for solving detectable Byzantine agreement (also called detectable broadcast) between three parties, and also for solving the detectable liar detection problem. The protocol is suggested by the properties of a four-qubit entangled state, and the classical part of the protocol is simpler than that of previous proposals. In addition, we present an experimental implementation of the protocol using four-photon entanglement.

arXiv:0710.0290•Physical Review Letters•Feb 21, 2008•90 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.

Quantum Information Processing•Apr 1, 2022•9 citations

Distributed Consensus Algorithms with Byzantine Fault Tolerance via Quantum Entanglement

Jincheng Zhang

This paper proposes a novel distributed consensus algorithm utilizing quantum entanglement to achieve Byzantine fault tolerance. Traditional consensus algorithms struggle to guarantee correctness in the face of malicious actors (Byzantine faults) where nodes can arbitrarily deviate from the honest majority. This work introduces a protocol that leverages the unique properties of quantum entanglement to establish correlated states between nodes, enabling the detection and mitigation of these malicious behaviors without relying on trusted third parties or computationally intensive verification processes. The core claim is that quantum entanglement provides a provably secure and efficient mechanism for distributed consensus, offering superior resilience compared to classical approaches. The algorithm is formally described, and key mathematical components, including state transformations and probability calculations, are presented. The theoretical analysis demonstrates the algorithm's ability to converge to a correct consensus state even when a significant fraction of nodes are faulty. The use of entanglement fundamentally alters the Byzantine fault tolerance landscape, offering a pathway towards more robust and secure distributed systems.

•Sep 3, 2026•0 citations
In distributed computing,Byzantine agreement is a practical method to solve its fault-tolerance problem.There is a variation of the Byzantine agreement which is called detectable Byzantine agreement.This kind of protocol is unsolvable by classical means,but can be solved using quantum resources——quantum entangled states.A typical quantum detectable Byzantine agreement is the GBKCW protocol.The part with the generation and distribution of the lists in the GBKCW protocol was dealed with.In order to keep the GBKCW protocol from the intercept-and-resend strategy,the property of the determination of entangled states were employed to test the sharing state between the parties.
In distributed computing systems such as blockchain, Byzantine protocol is a practical method to solve its fault-tolerance problem. The Byzantine question has a variant called the “detectable Byzantine protocol.” This type of protocol is unsolvable in the classical field, but it can be solved using quantum physics properties in quantum systems. Based on the wonderful characteristics of quantum entanglement, a method of quantum channel detection, generation and safe distribution of digital lists is designed by using two quantum entangled states of three photons as quantum channels, so as to solve the tripartite Byzantine problem of detection more simply. Finally, the correctness and security of the scheme are analyzed.
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).
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.
This paper proposes a novel distributed consensus algorithm utilizing quantum entanglement to achieve Byzantine fault tolerance. Traditional consensus algorithms struggle to guarantee correctness in the face of malicious actors (Byzantine faults) where nodes can arbitrarily deviate from the honest majority. This work introduces a protocol that leverages the unique properties of quantum entanglement to establish correlated states between nodes, enabling the detection and mitigation of these malicious behaviors without relying on trusted third parties or computationally intensive verification processes. The core claim is that quantum entanglement provides a provably secure and efficient mechanism for distributed consensus, offering superior resilience compared to classical approaches. The algorithm is formally described, and key mathematical components, including state transformations and probability calculations, are presented. The theoretical analysis demonstrates the algorithm's ability to converge to a correct consensus state even when a significant fraction of nodes are faulty. The use of entanglement fundamentally alters the Byzantine fault tolerance landscape, offering a pathway towards more robust and secure distributed systems.