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

Hyper-Reliable Distributed Consensus in MDI-QKD Trusted Node Networks Through Dynamic Multi-Metric Fusion

Freederia AI Researcher

Published Nov 23, 2025• 0 citations
Publisher

Abstract

**Abstract:** This paper introduces a novel approach to achieving robust and high-throughput distributed consensus within MDI-QKD trusted node networks. Existing consensus protocols struggle to maintain performance under varying node reliability and network latency. We propose a Dynamic Multi-Metric Fusion (DMMF) protocol that combines traditional Byzantine Fault Tolerance (BFT) with a layered evaluation pipeline, incorporating logical consistency checks, code and formula verification, novel output analysis, and dynamic impact forecasting based on historical performance. This allows for adaptive weighting of node contributions based on real-time trustworthiness assessments, significantly enhancing network resilience and throughput compared to static BFT implementations. The system offers an immediate pathway to commercial deployment, bolstering the security and scalability of quantum key distribution networks.

DOI
10.5281/zenodo.17688539

Related papers

Distributed Consensus with Byzantine Fault Tolerance via Quantum Key Distribution

Jincheng Zhang

This paper proposes a novel approach to distributed consensus that leverages quantum key distribution (QKD) for Byzantine fault tolerance. Traditional consensus algorithms struggle to guarantee agreement in the face of malicious actors introducing Byzantine faults. This work introduces a framework where a shared secret, established via QKD, serves as the foundation for a consensus protocol. The inherent cryptographic properties of QKD – specifically its ability to detect eavesdropping – are exploited to identify and neutralize malicious nodes attempting to disrupt the consensus process. We demonstrate that this combination offers a fundamentally more secure and efficient solution compared to classical approaches. The core of our system relies on the creation of a quantum-secured shared key, denoted as *K*, and the subsequent implementation of a consensus protocol designed to operate on this key. This protocol incorporates mechanisms for key verification and anomaly detection, providing robust resilience against Byzantine faults. The theoretical analysis presented highlights the advantages of this approach in terms of security and efficiency. We define the following key variables: *n* - number of nodes in the network; *f* - maximum number of faulty nodes; *m* - number of correct nodes; *si* - the state of node *i* (1 if active, 0 if faulty); *K* - the quantum key shared among the nodes; *ri,j* - the raw key shared between nodes *i* and *j*; *Ei,j* - the error rate observed between nodes *i* and *j* during QKD; *σi,j* - the quantum state used for key exchange between nodes *i* and *j*; *Ci,j* - the ciphertext generated during the QKD process; *Di,j* - the decrypted ciphertext between nodes *i* and *j*; *Hi,j* - the hash value calculated based on the decrypted ciphertext. The system's robustness is directly proportional to the level of security provided by QKD and the effectiveness of the consensus protocol in detecting and isolating faulty nodes.

•Aug 29, 2026•0 citations

Distributed Consensus with Quantum Byzantine Fault Tolerance

Jincheng Zhang

This paper presents a novel approach to distributed consensus protocols leveraging quantum entanglement and Byzantine fault tolerance. The core claim is that quantum entanglement can provide secure and efficient agreement among nodes even in the presence of malicious actors. We propose a mechanism that utilizes quantum key distribution (QKD) to establish shared entanglement between participating nodes. Subsequent quantum measurements identify faulty nodes, informing a robust consensus algorithm built upon majority voting and entanglement-based error correction. The potential advantages of this combined approach – enhanced security and efficiency compared to traditional classical methods – are explored. The research addresses the critical challenge of achieving reliable consensus in distributed systems susceptible to Byzantine attacks. This work introduces a new paradigm for consensus, potentially leading to more resilient and secure distributed applications.

•Aug 29, 2026•0 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

Decentralized Quantum Sensor Networks with Byzantine Fault Tolerance

Jincheng Zhang

This paper presents a novel approach to building robust and reliable decentralized quantum sensor networks capable of operating effectively even when confronted with Byzantine faults – malicious or faulty nodes intentionally disrupting network operation. The core of this system leverages quantum key distribution (QKD) for secure key exchange and incorporates advanced consensus algorithms to achieve Byzantine fault tolerance. The proposed mechanism guarantees data integrity and accuracy, mitigating the impact of compromised sensors. We detail the architecture, key components, and the theoretical underpinnings of this system, outlining a pathway towards practical, resilient quantum sensor networks. The key contributions of this work include the integration of QKD with Byzantine fault tolerance specifically tailored for sensor networks, offering a significant advancement over existing approaches that typically treat these challenges separately. Mathematical models and notation are presented for clarity and rigor.

•Sep 3, 2026•0 citations

Towards Secure and Efficient Practical Consensus Protocols in Quantum Internet

Woonghee Lee, Dong-Hee Kim, Junbeom Hur

While the quantum Internet leverages quantum mechanics to achieve unprecedented security against security threats such as eavesdropping, challenges remain, particularly in trust establishment. Traditional methods using a trusted third party in the conventional Internet system may be inadequate in decentralized or ad-hoc networks. Whereas, blockchain technology offers a decentralized solution, making it a promising solution. However, no studies have been conducted to evaluate the blockchain consensus protocols in diverse quantum Internet scenarios. This study assesses the-state-of-art Byzantine Fault Tolerance consensus protocol, ParBFT, with regard to the scal-ability and resilience through the quantum Internet simulation. Moreover, this study explores the potential enhancement to better meet the unique demands of high-latency or unstable networks.

International Conference on Information and Communication Technology Convergence (ICTC)•Oct 16, 2024•0 citations

High-secure quantum communication and networks

Guan‐Jie Fan‐Yuan

Quantum key distribution (QKD) can serve large numbers of users with unconditional secure communication, in which measurement-device-independent (MDI) QKD protocol can conveniently enhance realistic security by eliminating all detector side channels. In multi-user scenarios, MDI-QKD networks should meet the requirements of reliability and robustness. Around the issues, we complete a series of work on performance improvement, low-cost deployment, and robust networking. First is to answer how to change the trusted node to the untrusted node with low cost, here we propose and demonstrate an MDIQKD which is compatible with phase encoding BB84 networks, allowing for economical deployment of MDI-QKD networks and reconciliation between high key rate and high realistic security in the same network. Then we make the MDI networks more robust. We design an MDI-QKD networking scheme for multi-user access where more than two users can generate keys synchronously regardless of aligning reference frames and compensating channel disturbance on polarization. Third, we find a general method to distil secure keys from quantum discord, which is different to the previous entanglement-based frameworks of MDI-QKD, allowing imperfect preparation and measurement of quantum states. The series of work can help the practical application of MDI-QKD networks, and promote the development of quantum networks.

Opto-Electronics and Communications Conference (OECC)•Jun 30, 2024•0 citations
Abstract: This paper introduces a novel approach to achieving robust and high-throughput distributed consensus within MDI-QKD trusted node networks. Existing consensus protocols struggle to maintain performance under varying node reliability and network latency. We propose a Dynamic Multi-Metric Fusion (DMMF) protocol that combines traditional Byzantine Fault Tolerance (BFT) with a layered evaluation pipeline, incorporating logical consistency checks, code and formula verification, novel output analysis, and dynamic impact forecasting based on historical performance. This allows for adaptive weighting of node contributions based on real-time trustworthiness assessments, significantly enhancing network resilience and throughput compared to static BFT implementations. The system offers an immediate pathway to commercial deployment, bolstering the security and scalability of quantum key distribution networks.
This paper proposes a novel approach to distributed consensus that leverages quantum key distribution (QKD) for Byzantine fault tolerance. Traditional consensus algorithms struggle to guarantee agreement in the face of malicious actors introducing Byzantine faults. This work introduces a framework where a shared secret, established via QKD, serves as the foundation for a consensus protocol. The inherent cryptographic properties of QKD – specifically its ability to detect eavesdropping – are exploited to identify and neutralize malicious nodes attempting to disrupt the consensus process. We demonstrate that this combination offers a fundamentally more secure and efficient solution compared to classical approaches. The core of our system relies on the creation of a quantum-secured shared key, denoted as *K*, and the subsequent implementation of a consensus protocol designed to operate on this key. This protocol incorporates mechanisms for key verification and anomaly detection, providing robust resilience against Byzantine faults. The theoretical analysis presented highlights the advantages of this approach in terms of security and efficiency. We define the following key variables: *n* - number of nodes in the network; *f* - maximum number of faulty nodes; *m* - number of correct nodes; *si* - the state of node *i* (1 if active, 0 if faulty); *K* - the quantum key shared among the nodes; *ri,j* - the raw key shared between nodes *i* and *j*; *Ei,j* - the error rate observed between nodes *i* and *j* during QKD; *σi,j* - the quantum state used for key exchange between nodes *i* and *j*; *Ci,j* - the ciphertext generated during the QKD process; *Di,j* - the decrypted ciphertext between nodes *i* and *j*; *Hi,j* - the hash value calculated based on the decrypted ciphertext. The system's robustness is directly proportional to the level of security provided by QKD and the effectiveness of the consensus protocol in detecting and isolating faulty nodes.
This paper presents a novel approach to distributed consensus protocols leveraging quantum entanglement and Byzantine fault tolerance. The core claim is that quantum entanglement can provide secure and efficient agreement among nodes even in the presence of malicious actors. We propose a mechanism that utilizes quantum key distribution (QKD) to establish shared entanglement between participating nodes. Subsequent quantum measurements identify faulty nodes, informing a robust consensus algorithm built upon majority voting and entanglement-based error correction. The potential advantages of this combined approach – enhanced security and efficiency compared to traditional classical methods – are explored. The research addresses the critical challenge of achieving reliable consensus in distributed systems susceptible to Byzantine attacks. This work introduces a new paradigm for consensus, potentially leading to more resilient and secure distributed applications.
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.
This paper presents a novel approach to building robust and reliable decentralized quantum sensor networks capable of operating effectively even when confronted with Byzantine faults – malicious or faulty nodes intentionally disrupting network operation. The core of this system leverages quantum key distribution (QKD) for secure key exchange and incorporates advanced consensus algorithms to achieve Byzantine fault tolerance. The proposed mechanism guarantees data integrity and accuracy, mitigating the impact of compromised sensors. We detail the architecture, key components, and the theoretical underpinnings of this system, outlining a pathway towards practical, resilient quantum sensor networks. The key contributions of this work include the integration of QKD with Byzantine fault tolerance specifically tailored for sensor networks, offering a significant advancement over existing approaches that typically treat these challenges separately. Mathematical models and notation are presented for clarity and rigor.
While the quantum Internet leverages quantum mechanics to achieve unprecedented security against security threats such as eavesdropping, challenges remain, particularly in trust establishment. Traditional methods using a trusted third party in the conventional Internet system may be inadequate in decentralized or ad-hoc networks. Whereas, blockchain technology offers a decentralized solution, making it a promising solution. However, no studies have been conducted to evaluate the blockchain consensus protocols in diverse quantum Internet scenarios. This study assesses the-state-of-art Byzantine Fault Tolerance consensus protocol, ParBFT, with regard to the scal-ability and resilience through the quantum Internet simulation. Moreover, this study explores the potential enhancement to better meet the unique demands of high-latency or unstable networks.
Quantum key distribution (QKD) can serve large numbers of users with unconditional secure communication, in which measurement-device-independent (MDI) QKD protocol can conveniently enhance realistic security by eliminating all detector side channels. In multi-user scenarios, MDI-QKD networks should meet the requirements of reliability and robustness. Around the issues, we complete a series of work on performance improvement, low-cost deployment, and robust networking. First is to answer how to change the trusted node to the untrusted node with low cost, here we propose and demonstrate an MDIQKD which is compatible with phase encoding BB84 networks, allowing for economical deployment of MDI-QKD networks and reconciliation between high key rate and high realistic security in the same network. Then we make the MDI networks more robust. We design an MDI-QKD networking scheme for multi-user access where more than two users can generate keys synchronously regardless of aligning reference frames and compensating channel disturbance on polarization. Third, we find a general method to distil secure keys from quantum discord, which is different to the previous entanglement-based frameworks of MDI-QKD, allowing imperfect preparation and measurement of quantum states. The series of work can help the practical application of MDI-QKD networks, and promote the development of quantum networks.