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:2510.07874

A Quantum Walk-Enabled Blockchain with Weighted Quantum Voting Consensus

Chong‐Qiang Ye, Heng-Ji Li, J. Li, Xiaoyu Chen

Published Oct 9, 2025• 0 citations
arXivHTMLPDF

Abstract

Quantum blockchains provide inherent resilience against quantum adversaries and represent a promising alternative to classical blockchain systems in the quantum era. However, existing quantum blockchain architectures largely depend on entanglement to maintain inter-block connections, facing challenges in stability, consensus efficiency, and system verification. To address these issues, this work proposes a novel quantum blockchain framework based on quantum walks, which reduces reliance on entanglement while improving stability and connection efficiency. We further propose a quantum consensus mechanism based on a weighted quantum voting protocol, which enables a fairer voting process while reflecting the weights of different nodes. To validate the proposed framework, we conduct circuit simulations to evaluate the correctness and effectiveness of both the quantum walk-based block construction and the quantum voting consensus mechanism. Compared with existing entanglement-dependent approaches, our framework achieves stronger stability and enables simpler verification of block integrity, making it a practical candidate for quantum-era blockchain applications.

DOI
10.48550/arxiv.2510.07874

Related papers

Efficient Quantum Blockchain With a Consensus Mechanism QDPoS

Qin Li, Jiajie Wu, Junyu Quan +2 more

Quantum blockchain is expected to offer an alternative to classical blockchain to resist malicious attacks laughed by future quantum computers. Although a few quantum blockchain schemes have been constructed, their efficiency is low and unable to meet application requirements due to the fact that they lack of a suitable consensus mechanism. To tackle this issue, a consensus mechanism called quantum delegated proof of stake (QDPoS) is constructed by using quantum voting to provide fast decentralization for the quantum blockchain scheme at first. Then an efficient scheme is proposed for quantum blockchain based on QDPoS, where the classical information is initialized as a part of each single quantum state and these quantum states are entangled to form the chain. Compared with previous methods, the designed quantum blockchain scheme is more complete and carried out with higher efficiency, which greatly contributes to better adapting to the challenges of the quantum era.

IEEE Transactions on Information Forensics and Security•Jan 1, 2022•81 citations

EXPERIMENTAL MODEL OF BLOCKCHAIN CONSENSUS INTEGRATING THE QUANTUM COMPUTING PARADIGM

M. D. (Muhamediyeva) T, T. F. (Tagayev) A

This study proposes an experimental model of blockchain consensus that integrates the quantum computing paradigm with classical digital signature mechanisms. In the model, validators employ a commit–reveal scheme using ECDSA or RSA digital signatures, and the decision-making process is modeled in the presence of Byzantine-behaving nodes. The final consensus decision is based on a quantum voting primitive implemented using a GHZ-type entangled state through the Qiskit simulator. In addition, a per-qubit calibration and probability mitigation method is applied to reduce measurement errors. The research results are visualized through the quantum confirmation share per block, the distribution of votes from honest and Byzantine validators, and histograms of raw and mitigated probabilities. The obtained results allow the evaluation of the stability of quantum-based consensus mechanisms and their resilience to Byzantine faults.

Modern American Journal of Engineering, Technology, and Innovation•Mar 16, 2026•0 citations

Quantum blockchain based on integration of quantum entanglement and consensus algorithm

А. В. Сидоренко, I. A. Prikhodko

Objectives . The aim of this work is to develop and implement a conceptual model of a quantum-secured blockchain by integrating a quantum key distribution mechanism based on the E91 protocol into a classical architecture. Methods . The vulnerabilities of classical blockchain cryptographic mechanisms to threats posed by quantum computing are considered. To create a resilient architecture, it is proposed to combine the properties of quantum entanglement with classical cryptographic methods. The E91 quantum key distribution protocol, based on quantum entanglement and the Bell inequality test (CHSH test), is used as the foundation. A new field, E91 MAC, is introduced to link blocks in the chain, calculated using the HMAC algorithm from the hash of the previous block with a key generated by the E91 protocol. The Delegated Proof of Stake (DPoS) algorithm is chosen as the consensus mechanism. The software implementation includes simulating the E91 protocol using the IBM Quantum cloud platform and the Qiskit library, as well as deploying a peer-to-peer blockchain network with a CLI interface in Python using TCP sockets. Results . A conceptual model was developed and a prototype of a quantum-secured blockchain was implemented. A functional peer-to-peer network with the DPoS consensus algorithm and a distributed voting mechanism was created. The successful simulation of the E91 protocol confirmed the possibility of generating and verifying a quantum key. The fundamental feasibility of integrating a quantum authentication mechanism (E91 MAC) into the block creation and validation process was demonstrated. Conclusion . The proposed hybrid architecture demonstrates a novel approach to blockchain security, based not only on computational complexity but also on the fundamental laws of quantum mechanics. The integration of the E91 protocol and the DPoS mechanism provides potential resilience to quantum attacks and high network energy efficiency. The software prototype confirms the practical feasibility of the concept for creating secure next-generation distributed ledgers.

Informatics•Jun 28, 2026•0 citations

SQDPoS: A Secure and Practical Semi-Quantum Blockchain System for the Post-Quantum Era

Ang Liu, Qi An, Sijiang Xie +1 more

The rapid development of quantum computing poses severe threats to traditional blockchain security mechanisms, while existing full-quantum blockchains face challenges regarding high hardware costs and limited scalability. To address these issues, this paper proposes a secure and practical semi-quantum blockchain system. Specifically, a Semi-Quantum Delegated Proof of Stake consensus mechanism is constructed by integrating an adapted semi-quantum voting protocol with the Borda count method and a malicious behavior penalty model. Furthermore, a lightweight transaction verification framework is designed based on semi-quantum key distribution, enabling classical users with limited quantum capabilities to participate securely. Theoretical analysis demonstrates that the system achieves unconditional security against quantum attacks while maintaining high throughput. These results indicate that the proposed asymmetric resource design significantly lowers hardware barriers compared to full-quantum schemes, effectively balancing security, practicality, and cost-effectiveness for post-quantum blockchain networks.

Computers•Mar 27, 2026•2 citations

A Secure Scheme Based on a Hybrid of Classical-Quantum Communications Protocols for Managing Classical Blockchains

Ang Liu, Xiu‐Bo Chen, Shengwei Xu +5 more

Blockchain technology affords data integrity protection and building trust mechanisms in transactions for distributed networks, and, therefore, is seen as a promising revolutionary information technology. At the same time, the ongoing breakthrough in quantum computation technology contributes toward large-scale quantum computers, which might attack classic cryptography, seriously threatening the classic cryptography security currently employed in the blockchain. As a better alternative, a quantum blockchain has high expectations of being immune to quantum computing attacks perpetrated by quantum adversaries. Although several works have been presented, the problems of impracticality and inefficiency in quantum blockchain systems remain prominent and need to be addressed. First, this paper develops a quantum-secure blockchain (QSB) scheme by introducing a consensus mechanism-quantum proof of authority (QPoA) and an identity-based quantum signature (IQS)-wherein QPoA is used for new block generation and IQS is used for transaction signing and verification. Second, QPoA is developed by adopting a quantum voting protocol to achieve secure and efficient decentralization for the blockchain system, and a quantum random number generator (QRNG) is deployed for randomized leader node election to protect the blockchain system from centralized attacks like distributed denial of service (DDoS). Compared to previous work, our scheme is more practical and efficient without sacrificing security, greatly contributing to better addressing the challenges in the quantum era. Extensive security analysis demonstrates that our scheme provides better protection against quantum computing attacks than classic blockchains. Overall, our scheme presents a feasible solution for blockchain systems against quantum computing attacks through a quantum strategy, contributing toward quantum-secured blockchain in the quantum era.

Entropy•May 17, 2023•17 citations

Quantum Error Correction-Based Blockchain Consensus Mechanism Optimization

Jincheng Zhang

This paper investigates the integration of quantum error correction (QEC) techniques with blockchain consensus mechanisms to address inherent vulnerabilities and inefficiencies within traditional blockchain systems. The core claim centers around leveraging QEC's robust error detection and correction capabilities to bolster blockchain security, enhance consensus efficiency, and improve overall scalability. The proposed mechanism utilizes QEC to protect blockchain data from malicious attacks and environmental noise, thereby strengthening the consensus process. Furthermore, the application of QEC can accelerate the consensus algorithm, reducing latency and improving throughput. This work presents a novel approach to blockchain design, moving beyond classical cryptographic methods to incorporate the power of quantum mechanics for a more resilient and performant distributed ledger technology. The paper outlines the theoretical framework, proposes a specific QEC-enhanced consensus protocol, and discusses potential challenges and future research directions. The ultimate goal is to create a blockchain system that is inherently secure against attacks and capable of handling high transaction volumes with minimal delay. ---

•Aug 31, 2026•0 citations
Quantum blockchains provide inherent resilience against quantum adversaries and represent a promising alternative to classical blockchain systems in the quantum era. However, existing quantum blockchain architectures largely depend on entanglement to maintain inter-block connections, facing challenges in stability, consensus efficiency, and system verification. To address these issues, this work proposes a novel quantum blockchain framework based on quantum walks, which reduces reliance on entanglement while improving stability and connection efficiency. We further propose a quantum consensus mechanism based on a weighted quantum voting protocol, which enables a fairer voting process while reflecting the weights of different nodes. To validate the proposed framework, we conduct circuit simulations to evaluate the correctness and effectiveness of both the quantum walk-based block construction and the quantum voting consensus mechanism. Compared with existing entanglement-dependent approaches, our framework achieves stronger stability and enables simpler verification of block integrity, making it a practical candidate for quantum-era blockchain applications.
Quantum blockchain is expected to offer an alternative to classical blockchain to resist malicious attacks laughed by future quantum computers. Although a few quantum blockchain schemes have been constructed, their efficiency is low and unable to meet application requirements due to the fact that they lack of a suitable consensus mechanism. To tackle this issue, a consensus mechanism called quantum delegated proof of stake (QDPoS) is constructed by using quantum voting to provide fast decentralization for the quantum blockchain scheme at first. Then an efficient scheme is proposed for quantum blockchain based on QDPoS, where the classical information is initialized as a part of each single quantum state and these quantum states are entangled to form the chain. Compared with previous methods, the designed quantum blockchain scheme is more complete and carried out with higher efficiency, which greatly contributes to better adapting to the challenges of the quantum era.
This study proposes an experimental model of blockchain consensus that integrates the quantum computing paradigm with classical digital signature mechanisms. In the model, validators employ a commit–reveal scheme using ECDSA or RSA digital signatures, and the decision-making process is modeled in the presence of Byzantine-behaving nodes. The final consensus decision is based on a quantum voting primitive implemented using a GHZ-type entangled state through the Qiskit simulator. In addition, a per-qubit calibration and probability mitigation method is applied to reduce measurement errors. The research results are visualized through the quantum confirmation share per block, the distribution of votes from honest and Byzantine validators, and histograms of raw and mitigated probabilities. The obtained results allow the evaluation of the stability of quantum-based consensus mechanisms and their resilience to Byzantine faults.
Objectives . The aim of this work is to develop and implement a conceptual model of a quantum-secured blockchain by integrating a quantum key distribution mechanism based on the E91 protocol into a classical architecture. Methods . The vulnerabilities of classical blockchain cryptographic mechanisms to threats posed by quantum computing are considered. To create a resilient architecture, it is proposed to combine the properties of quantum entanglement with classical cryptographic methods. The E91 quantum key distribution protocol, based on quantum entanglement and the Bell inequality test (CHSH test), is used as the foundation. A new field, E91 MAC, is introduced to link blocks in the chain, calculated using the HMAC algorithm from the hash of the previous block with a key generated by the E91 protocol. The Delegated Proof of Stake (DPoS) algorithm is chosen as the consensus mechanism. The software implementation includes simulating the E91 protocol using the IBM Quantum cloud platform and the Qiskit library, as well as deploying a peer-to-peer blockchain network with a CLI interface in Python using TCP sockets. Results . A conceptual model was developed and a prototype of a quantum-secured blockchain was implemented. A functional peer-to-peer network with the DPoS consensus algorithm and a distributed voting mechanism was created. The successful simulation of the E91 protocol confirmed the possibility of generating and verifying a quantum key. The fundamental feasibility of integrating a quantum authentication mechanism (E91 MAC) into the block creation and validation process was demonstrated. Conclusion . The proposed hybrid architecture demonstrates a novel approach to blockchain security, based not only on computational complexity but also on the fundamental laws of quantum mechanics. The integration of the E91 protocol and the DPoS mechanism provides potential resilience to quantum attacks and high network energy efficiency. The software prototype confirms the practical feasibility of the concept for creating secure next-generation distributed ledgers.
The rapid development of quantum computing poses severe threats to traditional blockchain security mechanisms, while existing full-quantum blockchains face challenges regarding high hardware costs and limited scalability. To address these issues, this paper proposes a secure and practical semi-quantum blockchain system. Specifically, a Semi-Quantum Delegated Proof of Stake consensus mechanism is constructed by integrating an adapted semi-quantum voting protocol with the Borda count method and a malicious behavior penalty model. Furthermore, a lightweight transaction verification framework is designed based on semi-quantum key distribution, enabling classical users with limited quantum capabilities to participate securely. Theoretical analysis demonstrates that the system achieves unconditional security against quantum attacks while maintaining high throughput. These results indicate that the proposed asymmetric resource design significantly lowers hardware barriers compared to full-quantum schemes, effectively balancing security, practicality, and cost-effectiveness for post-quantum blockchain networks.
Blockchain technology affords data integrity protection and building trust mechanisms in transactions for distributed networks, and, therefore, is seen as a promising revolutionary information technology. At the same time, the ongoing breakthrough in quantum computation technology contributes toward large-scale quantum computers, which might attack classic cryptography, seriously threatening the classic cryptography security currently employed in the blockchain. As a better alternative, a quantum blockchain has high expectations of being immune to quantum computing attacks perpetrated by quantum adversaries. Although several works have been presented, the problems of impracticality and inefficiency in quantum blockchain systems remain prominent and need to be addressed. First, this paper develops a quantum-secure blockchain (QSB) scheme by introducing a consensus mechanism-quantum proof of authority (QPoA) and an identity-based quantum signature (IQS)-wherein QPoA is used for new block generation and IQS is used for transaction signing and verification. Second, QPoA is developed by adopting a quantum voting protocol to achieve secure and efficient decentralization for the blockchain system, and a quantum random number generator (QRNG) is deployed for randomized leader node election to protect the blockchain system from centralized attacks like distributed denial of service (DDoS). Compared to previous work, our scheme is more practical and efficient without sacrificing security, greatly contributing to better addressing the challenges in the quantum era. Extensive security analysis demonstrates that our scheme provides better protection against quantum computing attacks than classic blockchains. Overall, our scheme presents a feasible solution for blockchain systems against quantum computing attacks through a quantum strategy, contributing toward quantum-secured blockchain in the quantum era.
This paper investigates the integration of quantum error correction (QEC) techniques with blockchain consensus mechanisms to address inherent vulnerabilities and inefficiencies within traditional blockchain systems. The core claim centers around leveraging QEC's robust error detection and correction capabilities to bolster blockchain security, enhance consensus efficiency, and improve overall scalability. The proposed mechanism utilizes QEC to protect blockchain data from malicious attacks and environmental noise, thereby strengthening the consensus process. Furthermore, the application of QEC can accelerate the consensus algorithm, reducing latency and improving throughput. This work presents a novel approach to blockchain design, moving beyond classical cryptographic methods to incorporate the power of quantum mechanics for a more resilient and performant distributed ledger technology. The paper outlines the theoretical framework, proposes a specific QEC-enhanced consensus protocol, and discusses potential challenges and future research directions. The ultimate goal is to create a blockchain system that is inherently secure against attacks and capable of handling high transaction volumes with minimal delay. ---