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

Blockchain platform with proof-of-work based on analog Hamiltonian optimisers

Kirill P. Kalinin, Natalia G. Berloff

Published Feb 27, 2018• 15 citations
arXivHTMLPDF

Abstract

The development of quantum information platforms such as quantum computers and quantum simulators that will rival classical Turing computations are typically viewed as a threat to secure data transmissions and therefore to crypto-systems and financial markets in general. We propose to use such platforms as a proof-of-work protocol for blockchain technology, which underlies cryptocurrencies providing a way to document the transactions in a permanent decentralised public record and to be further securely and transparently monitored. We reconsider the basis of blockchain encryption and suggest to move from currently used proof-of-work schemes to the proof-of-work performed by analog Hamiltonian optimisers. This approach has a potential to significantly increase decentralisation of the existing blockchains and to help achieve faster transaction times, therefore, removing the main obstacles for blockchain implementation. We discuss the proof-of-work protocols for a few most promising optimiser platforms: quantum annealing hardware based on D-wave simulators and a new class of gain-dissipative simulators.

DOI
10.48550/arxiv.1802.10091

Related papers

Quantum-resistance in blockchain networks

Marcos Allende, Diego López León, Sergio Cerón +11 more

The advent of quantum computing threatens blockchain protocols and networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor's algorithm on a large scale, the most used asymmetric algorithms, utilized for digital signatures and message encryption, such as RSA, (EC)DSA, and (EC)DH, will be no longer secure. Quantum computers will be able to break them within a short period of time. Similarly, Grover's algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work. Today, there are hundreds of billions of dollars denominated in cryptocurrencies and other digital assets that rely on blockchain ledgers as well as thousands of blockchain-based applications storing value in blockchain networks. Cryptocurrencies and blockchain-based applications require solutions that guarantee quantum resistance in order to preserve the integrity of data and assets in these public and immutable ledgers. The quantum threat and some potential solutions are well understood and presented in the literature. However, most proposals are theoretical, require large QKD networks, or propose new quantum-resistant blockchain networks to be built from scratch. Our work, which is presented in this paper, is pioneer in proposing an end-to-end framework for post-quantum blockchain networks that can be applied to existing blockchain to achieve quantum-resistance. We have developed an open-source implementation in an Ethereum-based (i.e., EVM compatible) network that can be extended to other existing blockchains. For the implementation we have (i) used quantum entropy to generate post-quantum key pairs, (ii) established post-quantum TLS connections and X.509 certificates to secure the exchange of information between blockchain nodes over the internet without needing a large QKD network, (iii) introduced a post-quantum second signature in transactions using Falcon-512 post-quantum keys, and (iv) developed the first on-chain verification of post-quantum signatures using three different mechanisms that are compared and analyzed: Solidity smart-contracts run by the validators for each transaction, modified EVM Opcode, and precompiled smart contracts.

arXiv:2106.06640•Scientific Reports•Apr 6, 2023•141 citations

The Future of Cryptocurrency: Quantum-Secure Blockchain Protocols

Rajat Verma

Quantum computing's development poses a significant threat to the cryptographic security of current blockchain technologies, potentially undermining the integrity of digital transactions. Quantum computers can break the complex mathematical problems that algorithms like RSA and ECC rely on, which could lead to vulnerabilities such as double-spending and fraud. To address these risks, the blockchain community is exploring quantum-resistant protocols that employ post-quantum cryptographic algorithms, which are designed to withstand quantum computing attacks. Quantum-secure blockchain protocols integrate quantum key distribution (QKD) and post-quantum cryptography (PQC) to enhance security. QKD uses quantum mechanics principles to secure communication channels, ensuring that any attempt to intercept the key introduces detectable anomalies. PQC involves algorithms like lattice-based, hash-based, or multivariate polynomial-based algorithms that are believed to be secure against quantum attacks. These protocols aim to maintain the confidentiality, integrity, and security of data transmitted over the blockchain, ensuring the longevity and reliability of blockchain systems in the face of evolving computational advancements. A quantum-secure blockchain scheme (QSB) utilizes a consensus mechanism, QPoA, and IQS. The QPoA is leveraged for block generation while the IQS is deployed in transaction verification1. Furthermore, the integration of quantum computing with blockchain can address current limitations, such as slow transaction speeds and lack of scalability, by optimizing calculations and enabling smarter, more sophisticated smart contracts. The development and implementation of quantum-resistant blockchains are essential for future-proofing digital transactions and maintaining trust in decentralized systems

International Journal of Artificial Intelligence Data Science and Machine Learning•Jan 1, 2021•0 citations

Blockchain with proof of quantum work

M. H. S. Amin, Jack Raymond, Daniel Kinn +7 more

We propose a blockchain architecture in which mining requires a quantum computer. The consensus mechanism is based on proof of quantum work, a quantum-enhanced alternative to traditional proof of work that leverages quantum supremacy to make mining intractable for classical computers. We have refined the blockchain framework to incorporate the probabilistic nature of quantum mechanics, ensuring stability against sampling errors and hardware inaccuracies. To validate our approach, we implemented a prototype blockchain on four D-Wave(TM) quantum annealing processors geographically distributed within North America, demonstrating stable operation across hundreds of thousands of quantum hashing operations. Our experimental protocol follows the same approach used in the recent demonstration of quantum supremacy [King et al. Science 2025], ensuring that classical computers cannot efficiently perform the same computation task. By replacing classical machines with quantum systems for mining, it is possible to significantly reduce the energy consumption and environmental impact traditionally associated with blockchain mining while providing a quantum-safe layer of security. Beyond serving as a proof of concept for a meaningful application of quantum computing, this work highlights the potential for other near-term quantum computing applications using existing technology.

arXiv:2503.14462•Physical Review A•Jan 30, 2026•8 citations

Post-Quantum Blockchain Proofs of Work.

Alexandru Cojocaru, Juan A. Garay, Aggelos Kiayias +2 more

A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. Arguably, its main impact has been in the setting of cryptocurrencies such as Bitcoin and its underlying blockchain protocol, which received significant attention in recent years due to its potential for various applications as well as for solving fundamental distributed computing questions in novel threat models. PoWs enable the linking of blocks in the blockchain data structure and thus the problem of interest is the feasibility of obtaining a sequence (chain) of such proofs. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity. Effectively, this is an extension of a threshold direct product theorem to an average-case unstructured search problem. Our proof, adding to active recent efforts, simplifies and generalizes the recording technique due to Zhandry (Crypto 2019). In addition, we revisit the formal treatment of security of the core of the Bitcoin consensus protocol, called the Bitcoin backbone (Eurocrypt 2015), against quantum adversaries and show that its security holds under a quantum analogue of the ``honest majority'' assumption that we formulate. Our analysis indicates that security of the Bitcoin backbone protocol is guaranteed provided that the number of adversarial quantum queries is bounded so that each quantum query is worth $O(p^{-1/2})$ classical ones, where $p$ is the probability of success of a single classical query to the protocol's underlying hash function. Somewhat surprisingly, the wait time for safe settlement in the case of quantum adversaries matches the safe settlement time in the classical case.

•Dec 1, 2021•0 citations

Quantum-Resistant Blockchain Protocols for Secure Transactions

Vishal Puneyani, Vivekananda Bhat K

The advent of quantum computing threatens the cryptographic security of traditional blockchain systems, potentially rendering current encryption techniques obsolete. This paper explores quantum-resistant blockchain protocols that leverage post-quantum cryptographic algorithms to ensure secure transactions. We analyze various quantum-safe cryptographic methods, such as lattice-based, hash-based, and multivariate polynomial cryptography, evaluating their feasibility for blockchain applications. Through comparative analysis, we discuss their computational efficiency and security guarantees. Our findings suggest that integrating quantum-resistant cryptographic techniques into blockchain frameworks is essential for future-proofing decentralized systems. This paper explores the integration of quantum-resistant cryptographic algorithms within blockchain technology. The proposed approach utilizes CRYSTALS-Dilithium for digital signatures, ensuring secure transaction verification in a post-quantum era. While Kyber is a robust key exchange mechanism, it is not suitable for signing transactions. The implementation is tested on standard hardware, demonstrating feasibility without requiring specialized quantum computing infrastructure.

IEEE Access•Jan 1, 2025•11 citations

Quantum Computing and Blockchain Security

Navya Mathur, Mokshita Bajpai, Vedika Murarka +3 more

Blockchain technology, renowned for its decentralized and secure nature, faces a formidable challenge from the rapid advancement of quantum computing. Quantum algorithms, such as Shor's algorithm, possess the potential to break the classical cryptographic schemes (e.g., RSA, ECC) that underpin current blockchain security, rendering transactions vulnerable. This paper comprehensively analyzes this quantum threat and explores a suite of quantum-resistant solutions to fortify blockchain systems. Key solutions investigated include Post-Quantum Cryptography (PQC), Quantum Key Distribution (QKD) integrated with blockchain platforms, and quantum-inspired algorithms like Quantum-Influenced Quantum Walks (QIQW). The study further examines the application of these quantum-enhanced security measures in critical domains such as IoT-based smart cities, financial systems, and critical infrastructure, proposing frameworks like the PDI (Privacy, Decentralization, Integrity) model. Finally, the paper discusses future research directions, including the development of scalable quantum-resistant protocols, quantum-assisted performance enhancements, and the synergistic potential of quantum networks and machine learning. The conclusion emphasizes that proactive integration of quantum-resistant measures is imperative to ensure the long-term security, resilience, and trustworthiness of blockchain technology in the forthcoming quantum era.

Wiley eBooks•Aug 21, 2026•0 citations
The development of quantum information platforms such as quantum computers and quantum simulators that will rival classical Turing computations are typically viewed as a threat to secure data transmissions and therefore to crypto-systems and financial markets in general. We propose to use such platforms as a proof-of-work protocol for blockchain technology, which underlies cryptocurrencies providing a way to document the transactions in a permanent decentralised public record and to be further securely and transparently monitored. We reconsider the basis of blockchain encryption and suggest to move from currently used proof-of-work schemes to the proof-of-work performed by analog Hamiltonian optimisers. This approach has a potential to significantly increase decentralisation of the existing blockchains and to help achieve faster transaction times, therefore, removing the main obstacles for blockchain implementation. We discuss the proof-of-work protocols for a few most promising optimiser platforms: quantum annealing hardware based on D-wave simulators and a new class of gain-dissipative simulators.
The advent of quantum computing threatens blockchain protocols and networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor's algorithm on a large scale, the most used asymmetric algorithms, utilized for digital signatures and message encryption, such as RSA, (EC)DSA, and (EC)DH, will be no longer secure. Quantum computers will be able to break them within a short period of time. Similarly, Grover's algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work. Today, there are hundreds of billions of dollars denominated in cryptocurrencies and other digital assets that rely on blockchain ledgers as well as thousands of blockchain-based applications storing value in blockchain networks. Cryptocurrencies and blockchain-based applications require solutions that guarantee quantum resistance in order to preserve the integrity of data and assets in these public and immutable ledgers. The quantum threat and some potential solutions are well understood and presented in the literature. However, most proposals are theoretical, require large QKD networks, or propose new quantum-resistant blockchain networks to be built from scratch. Our work, which is presented in this paper, is pioneer in proposing an end-to-end framework for post-quantum blockchain networks that can be applied to existing blockchain to achieve quantum-resistance. We have developed an open-source implementation in an Ethereum-based (i.e., EVM compatible) network that can be extended to other existing blockchains. For the implementation we have (i) used quantum entropy to generate post-quantum key pairs, (ii) established post-quantum TLS connections and X.509 certificates to secure the exchange of information between blockchain nodes over the internet without needing a large QKD network, (iii) introduced a post-quantum second signature in transactions using Falcon-512 post-quantum keys, and (iv) developed the first on-chain verification of post-quantum signatures using three different mechanisms that are compared and analyzed: Solidity smart-contracts run by the validators for each transaction, modified EVM Opcode, and precompiled smart contracts.
Quantum computing's development poses a significant threat to the cryptographic security of current blockchain technologies, potentially undermining the integrity of digital transactions. Quantum computers can break the complex mathematical problems that algorithms like RSA and ECC rely on, which could lead to vulnerabilities such as double-spending and fraud. To address these risks, the blockchain community is exploring quantum-resistant protocols that employ post-quantum cryptographic algorithms, which are designed to withstand quantum computing attacks. Quantum-secure blockchain protocols integrate quantum key distribution (QKD) and post-quantum cryptography (PQC) to enhance security. QKD uses quantum mechanics principles to secure communication channels, ensuring that any attempt to intercept the key introduces detectable anomalies. PQC involves algorithms like lattice-based, hash-based, or multivariate polynomial-based algorithms that are believed to be secure against quantum attacks. These protocols aim to maintain the confidentiality, integrity, and security of data transmitted over the blockchain, ensuring the longevity and reliability of blockchain systems in the face of evolving computational advancements. A quantum-secure blockchain scheme (QSB) utilizes a consensus mechanism, QPoA, and IQS. The QPoA is leveraged for block generation while the IQS is deployed in transaction verification1. Furthermore, the integration of quantum computing with blockchain can address current limitations, such as slow transaction speeds and lack of scalability, by optimizing calculations and enabling smarter, more sophisticated smart contracts. The development and implementation of quantum-resistant blockchains are essential for future-proofing digital transactions and maintaining trust in decentralized systems
We propose a blockchain architecture in which mining requires a quantum computer. The consensus mechanism is based on proof of quantum work, a quantum-enhanced alternative to traditional proof of work that leverages quantum supremacy to make mining intractable for classical computers. We have refined the blockchain framework to incorporate the probabilistic nature of quantum mechanics, ensuring stability against sampling errors and hardware inaccuracies. To validate our approach, we implemented a prototype blockchain on four D-Wave(TM) quantum annealing processors geographically distributed within North America, demonstrating stable operation across hundreds of thousands of quantum hashing operations. Our experimental protocol follows the same approach used in the recent demonstration of quantum supremacy [King et al. Science 2025], ensuring that classical computers cannot efficiently perform the same computation task. By replacing classical machines with quantum systems for mining, it is possible to significantly reduce the energy consumption and environmental impact traditionally associated with blockchain mining while providing a quantum-safe layer of security. Beyond serving as a proof of concept for a meaningful application of quantum computing, this work highlights the potential for other near-term quantum computing applications using existing technology.
A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. Arguably, its main impact has been in the setting of cryptocurrencies such as Bitcoin and its underlying blockchain protocol, which received significant attention in recent years due to its potential for various applications as well as for solving fundamental distributed computing questions in novel threat models. PoWs enable the linking of blocks in the blockchain data structure and thus the problem of interest is the feasibility of obtaining a sequence (chain) of such proofs. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity. Effectively, this is an extension of a threshold direct product theorem to an average-case unstructured search problem. Our proof, adding to active recent efforts, simplifies and generalizes the recording technique due to Zhandry (Crypto 2019). In addition, we revisit the formal treatment of security of the core of the Bitcoin consensus protocol, called the Bitcoin backbone (Eurocrypt 2015), against quantum adversaries and show that its security holds under a quantum analogue of the ``honest majority'' assumption that we formulate. Our analysis indicates that security of the Bitcoin backbone protocol is guaranteed provided that the number of adversarial quantum queries is bounded so that each quantum query is worth O(p−1/2)O(p^{-1/2})O(p−1/2) classical ones, where ppp is the probability of success of a single classical query to the protocol's underlying hash function. Somewhat surprisingly, the wait time for safe settlement in the case of quantum adversaries matches the safe settlement time in the classical case.
The advent of quantum computing threatens the cryptographic security of traditional blockchain systems, potentially rendering current encryption techniques obsolete. This paper explores quantum-resistant blockchain protocols that leverage post-quantum cryptographic algorithms to ensure secure transactions. We analyze various quantum-safe cryptographic methods, such as lattice-based, hash-based, and multivariate polynomial cryptography, evaluating their feasibility for blockchain applications. Through comparative analysis, we discuss their computational efficiency and security guarantees. Our findings suggest that integrating quantum-resistant cryptographic techniques into blockchain frameworks is essential for future-proofing decentralized systems. This paper explores the integration of quantum-resistant cryptographic algorithms within blockchain technology. The proposed approach utilizes CRYSTALS-Dilithium for digital signatures, ensuring secure transaction verification in a post-quantum era. While Kyber is a robust key exchange mechanism, it is not suitable for signing transactions. The implementation is tested on standard hardware, demonstrating feasibility without requiring specialized quantum computing infrastructure.
Blockchain technology, renowned for its decentralized and secure nature, faces a formidable challenge from the rapid advancement of quantum computing. Quantum algorithms, such as Shor's algorithm, possess the potential to break the classical cryptographic schemes (e.g., RSA, ECC) that underpin current blockchain security, rendering transactions vulnerable. This paper comprehensively analyzes this quantum threat and explores a suite of quantum-resistant solutions to fortify blockchain systems. Key solutions investigated include Post-Quantum Cryptography (PQC), Quantum Key Distribution (QKD) integrated with blockchain platforms, and quantum-inspired algorithms like Quantum-Influenced Quantum Walks (QIQW). The study further examines the application of these quantum-enhanced security measures in critical domains such as IoT-based smart cities, financial systems, and critical infrastructure, proposing frameworks like the PDI (Privacy, Decentralization, Integrity) model. Finally, the paper discusses future research directions, including the development of scalable quantum-resistant protocols, quantum-assisted performance enhancements, and the synergistic potential of quantum networks and machine learning. The conclusion emphasizes that proactive integration of quantum-resistant measures is imperative to ensure the long-term security, resilience, and trustworthiness of blockchain technology in the forthcoming quantum era.