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

Practical quantum Byzantine protocol via nearly optimal entanglement resources

Lide Xue, Bingren Chen, Wei Yang, Liusheng Huang

Published Aug 20, 2019• 5 citations
Publisher
DOI
10.1007/s11128-019-2419-y

Related papers

Detectable Byzantine Agreement Based on Quantum Resource Distribution

Zengyu Pang, HUA XIANG

•Jan 1, 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

\textit{In Silico} Benchmarking of Detectable Byzantine Agreement in Noisy Quantum Networks

Bhatia, Mayank, Doshi, Shaan, Daniel Winton +3 more

Quantum communication resources offer significant advantages for fault-tolerant distributed protocols, particularly in Byzantine Agreement (BA), where reliability against adversarial interference is essential. Quantum Detectable Byzantine Agreement (QDBA) enables consensus protocols that surpass classical limitations by leveraging entangled quantum states. In this work, we focus on the practical realization of QDBA using Einstein-Podolsky-Rosen (EPR) pairs, the simplest maximally entangled quantum resources, making the protocol experimentally accessible across current quantum hardware platforms. We present a comprehensive computational study of the EPRQDBA protocol under realistic quantum network conditions, utilizing the Aliro Quantum Network Simulator to evaluate the performance and robustness of the protocol. Our simulations systematically explore the protocol's parameter space --including variations in network size, traitorous node count, the amount of entanglement consumed in the protocol, and physically motivated noise models tailored specifically for superconducting and photonic qubit technologies. Through extensive numerical experiments, we provide insights into how these physically realistic parameters impact protocol performance, establishing critical thresholds and optimal operational regimes for experimental implementations. This work bridges theoretical advances in quantum consensus protocols with practical network implementations, offering a concrete reference for experimentalists. Our findings serve as a guideline for evaluating and optimizing QDBA implementations in realistic, noisy environments.

arXiv:2509.02629•Sep 1, 2025•0 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

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•0 citations

Entangled state testing in the quantum Byzantine agreement

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

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.

•Nov 1, 2016•0 citations
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).
Quantum communication resources offer significant advantages for fault-tolerant distributed protocols, particularly in Byzantine Agreement (BA), where reliability against adversarial interference is essential. Quantum Detectable Byzantine Agreement (QDBA) enables consensus protocols that surpass classical limitations by leveraging entangled quantum states. In this work, we focus on the practical realization of QDBA using Einstein-Podolsky-Rosen (EPR) pairs, the simplest maximally entangled quantum resources, making the protocol experimentally accessible across current quantum hardware platforms. We present a comprehensive computational study of the EPRQDBA protocol under realistic quantum network conditions, utilizing the Aliro Quantum Network Simulator to evaluate the performance and robustness of the protocol. Our simulations systematically explore the protocol's parameter space --including variations in network size, traitorous node count, the amount of entanglement consumed in the protocol, and physically motivated noise models tailored specifically for superconducting and photonic qubit technologies. Through extensive numerical experiments, we provide insights into how these physically realistic parameters impact protocol performance, establishing critical thresholds and optimal operational regimes for experimental implementations. This work bridges theoretical advances in quantum consensus protocols with practical network implementations, offering a concrete reference for experimentalists. Our findings serve as a guideline for evaluating and optimizing QDBA implementations in realistic, noisy environments.
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.