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

ICT Express

Big Step: A fast quantum algorithm for nonce discovery in Proof-of-Work blockchains

Young-Hoon Park

Published Dec 2, 2025• 2 citations
Publisher

Abstract

Since the emergence of quantum computing, Grover’s algorithm has been widely studied as a method to attack Proof-of-Work (PoW) blockchains. However, it requires multiple oracle and diffuser iterations, causing high computational overhead and ancilla qubit usage. In this paper, we propose a novel quantum algorithm that efficiently finds valid nonces in PoW-based blockchains without iterative amplification. It introduces a non-unitary quantum operator that directly generates a superposition of valid nonces in one step. We also present an efficient quantum circuit implementation and theoretically prove that our algorithm significantly reduces computational resources compared to conventional Grover-based methods.

DOI
10.1016/j.icte.2025.11.023

Related papers

Enhancing Bitcoin Mining Using Quantum Search Space Expansion and Non-Unitary Operator

Yeonsong Suh, Younghoon Park

As quantum computers continue to advance, quantum algorithms for Bitcoin mining have attracted growing attention from researchers. Unlike conventional mining performed on classical computers, quantum computers using Grover’s algorithm can find a valid nonce more quickly by leveraging fundamental quantum properties such as superposition and amplitude amplification. However, existing quantum mining approaches require hybrid computation with classical machines due to the limited search space, which diminishes the benefits of quantum acceleration. Moreover, Grover’s algorithm consists of repeated oracle and diffusion steps, resulting in extensive use of gates and ancilla qubits. To address these issues, we propose a faster and more efficient quantum algorithm for Bitcoin mining. The proposed method expands the search space to include the extra nonce and timestamp, and redesigns the diffusion procedure using a non-unitary operator. By expanding the search space, the expected number of valid candidates can be increased to approximately one under the target difficulty assumption, thereby reducing, but not eliminating, the need for repeated classical-quantum reinitialization. In addition, the use of a non-unitary operator reduces the dependence on iterative Grover amplification. Our circuit-level analysis shows that the proposed model can preserve Bitcoin consensus constraints under bounded timestamp variation while reducing circuit-resource overhead in terms of gate count, circuit depth, and ancilla qubit requirements.

International Conference on Ubiquitous and Future Networks•Jul 1, 2026•1 citation

Implementation of Grover’s Iterator for Quantum Searching With an Arbitrary Number of Qubits

Sihyung Lee, Seung Yeob Nam

Grover’s algorithm harnesses the power of quantum computing to swiftly locate specific elements in an unstructured database, outperforming classical computers in tasks like database searching. This algorithm capitalizes on the unique ability of qubits to be in both 0 and 1 states simultaneously (superposition), allowing it to scan the entire search space at once. It then boosts the probability of the target element, making it more prominent. While the foundational concepts of Grover’s algorithm are well-documented, practical implementation using quantum operators, especially for large search spaces, remains less explored beyond basic examples with a small number of qubits. Existing general synthesis techniques often involve numerous operators or are time-consuming. Our proposed methods specifically address the amplitude-amplification component of Grover’s algorithm for any size of search space. These methods detail the required types and quantities of qubits and operators, emphasizing minimal usage and efficient assembly. Developed and evaluated in Python, our methods consistently identified target elements with over 95% accuracy and achieved configurations comparably compact as those in the existing literature but at a faster pace. We anticipate that these methods facilitate practical implementations of Grover’s algorithm across various domains.

IEEE Access•Jan 1, 2024•9 citations

Quantum Attacks and Defenses for Proof-of-Stake

Amr M. Khalifa, Ayman Mohammad Bahaa-Eldin, Mohamed Sobh

Advances in both quantum computation and blockchain systems necessitate a rigid analysis for the security of blockchains in the advent of powerful quantum computers. Computational problems that are proved or believed to be intractable by classical computers are known to be attacked by well-studied quantum algorithms. Such problems are used as basis to secure blockchains and hence the security of such systems must be defended. As proof-of-work is used in early blockchains to maintain consensus, proof-of-stake was proposed to lower its high energy consumption and provide a higher network throughput. Proof-of-Stake has hence got an increasing interest, variations, implementations and enhancements whilst its quantum security defenses remained almost the same. By comparing proof-of-work to proof-of-stake, we find that the latter is more vulnerable to certain attack vectors. We suggest general defenses for quantum-resilient blockchains and thoroughly analyze post-quantum signature schemes to select an appropriate alternative to the most serious threat on conventional digital signatures.

International Conference on Computer Engineering & Systems (ICCES)•Dec 1, 2019•21 citations

Implementation of Efficient Quantum Computing Algorithm for Searching

Nirhali Atharva, Malwade Rohit, P. Akshay +2 more

The K-SAT problem is a fundamental challenge in computational theory, widely used in artificial intelligence, cryptography, and optimization. Classical algorithms struggle with exponential time complexity, making them inefficient for large-scale instances. In this research, we propose an efficient quantum computing approach based on Grover’s algorithm to enhance the search process for satisfiable solutions in K-SAT problems. Our implementation leverages quantum superposition and amplitude amplification to explore multiple possible solutions simultaneously, reducing the search complexity from O (2ⁿ) in classical methods to O(√2ⁿ) in quantum computing. We design a quantum oracle that encodes the K-SAT clauses and integrates it into Grover’s iterative search framework. The performance is evaluated through Qiskit simulations, demonstrating a significant improvement in search efficiency compared to classical brute-force techniques. The results highlight the potential of quantum algorithms in solving complex combinatorial problems with enhanced speed and accuracy. This study contributes to the development of quantum-accelerated optimization methods, paving the way for real-world applications in machine learning, cryptanalysis, and large-scale data processing.

International Research Journal on Advanced Engineering Hub (IRJAEH)•May 21, 2025•0 citations

Quantum Entanglement-Driven Consensus: A Novel Paradigm for Ultra-Fast and Secure Blockchain Protocols

Anand Singh Rajawat, S.B. Goyal, Devesh Pratap Singh +2 more

It has also added quantum computing and blockchain technology in the list of opportunities never seen in the revolution of distributed consensus systems. In the article, the authors summarize a new variant of quantum protocol-based entanglement consensus (QEC), which deals with the deployment of quantum mechanics to facilitate transaction implementation in record time with robust security guarantees as compared to the traditional protocols. As stated contrary to classical consensus algorithms, including a Proof-of-Work (PoW), Practical Byzantine Fault Tolerance (PBFT), and others, our architecture uses quantum entanglement properties to provide instantaneous consensus among all distributed nodes and uses cryptographic security through quantum key distribution. Results achieved provide both theoretical and experimental discussion of the fact that QEC performs optimally with latency (sub-milliseconds) and can be considered one of the biggest increases compared to classical protocols. In its implementation, it recorded 99.7 percent reduction in energy usage relative to PoW and 85 percent high throughput relative to PBFT. These values were based on our own physical 8 node testbed which was tested under calibrated simulator conditions as detailed in the Experimental Setup. The results are applicable in the field of quantum blockchain that is under development because it introduces a robust paradigm to build quantum-enhanced distributed systems that can find their applications in financial products, Internet of Things network, and the security of critical infrastructure.

CRC Press eBooks•Nov 12, 2026•0 citations

Quantum advantage on proof of work

Dan A. Bard, Joseph J. Kearney, Carlos A. Pérez-Delgado

Proof-of-Work (PoW) is a fundamental underlying technology behind most major blockchain cryptocurrencies. It has been previously pointed out that quantum devices provide a computational advantage in performing PoW in the context of Bitcoin. Here we make the case that this quantum advantage extends not only to all existing PoW mechanisms, but to any possible PoW as well. This has strong consequences regarding both quantum-based attacks on the integrity of the entirety of the blockchain, as well as more legitimate uses of quantum computation for the purpose of mining Bitcoin and other cryptocurrencies. For the first case, we estimate when these quantum attacks will become feasible, for various cryptocurrencies, and discuss the impact of such attacks. For the latter, we derive a precise formula to calculate the economic incentive for switching to quantum-based cryptocurrency miners. Using this formula, we analyze several test scenarios, and conclude that investing in quantum hardware for cryptocurrency mining has the potential to pay off immensely.

arXiv:2105.01821•Array•Jul 6, 2022•31 citations
Since the emergence of quantum computing, Grover’s algorithm has been widely studied as a method to attack Proof-of-Work (PoW) blockchains. However, it requires multiple oracle and diffuser iterations, causing high computational overhead and ancilla qubit usage. In this paper, we propose a novel quantum algorithm that efficiently finds valid nonces in PoW-based blockchains without iterative amplification. It introduces a non-unitary quantum operator that directly generates a superposition of valid nonces in one step. We also present an efficient quantum circuit implementation and theoretically prove that our algorithm significantly reduces computational resources compared to conventional Grover-based methods.
As quantum computers continue to advance, quantum algorithms for Bitcoin mining have attracted growing attention from researchers. Unlike conventional mining performed on classical computers, quantum computers using Grover’s algorithm can find a valid nonce more quickly by leveraging fundamental quantum properties such as superposition and amplitude amplification. However, existing quantum mining approaches require hybrid computation with classical machines due to the limited search space, which diminishes the benefits of quantum acceleration. Moreover, Grover’s algorithm consists of repeated oracle and diffusion steps, resulting in extensive use of gates and ancilla qubits. To address these issues, we propose a faster and more efficient quantum algorithm for Bitcoin mining. The proposed method expands the search space to include the extra nonce and timestamp, and redesigns the diffusion procedure using a non-unitary operator. By expanding the search space, the expected number of valid candidates can be increased to approximately one under the target difficulty assumption, thereby reducing, but not eliminating, the need for repeated classical-quantum reinitialization. In addition, the use of a non-unitary operator reduces the dependence on iterative Grover amplification. Our circuit-level analysis shows that the proposed model can preserve Bitcoin consensus constraints under bounded timestamp variation while reducing circuit-resource overhead in terms of gate count, circuit depth, and ancilla qubit requirements.
Grover’s algorithm harnesses the power of quantum computing to swiftly locate specific elements in an unstructured database, outperforming classical computers in tasks like database searching. This algorithm capitalizes on the unique ability of qubits to be in both 0 and 1 states simultaneously (superposition), allowing it to scan the entire search space at once. It then boosts the probability of the target element, making it more prominent. While the foundational concepts of Grover’s algorithm are well-documented, practical implementation using quantum operators, especially for large search spaces, remains less explored beyond basic examples with a small number of qubits. Existing general synthesis techniques often involve numerous operators or are time-consuming. Our proposed methods specifically address the amplitude-amplification component of Grover’s algorithm for any size of search space. These methods detail the required types and quantities of qubits and operators, emphasizing minimal usage and efficient assembly. Developed and evaluated in Python, our methods consistently identified target elements with over 95% accuracy and achieved configurations comparably compact as those in the existing literature but at a faster pace. We anticipate that these methods facilitate practical implementations of Grover’s algorithm across various domains.
Advances in both quantum computation and blockchain systems necessitate a rigid analysis for the security of blockchains in the advent of powerful quantum computers. Computational problems that are proved or believed to be intractable by classical computers are known to be attacked by well-studied quantum algorithms. Such problems are used as basis to secure blockchains and hence the security of such systems must be defended. As proof-of-work is used in early blockchains to maintain consensus, proof-of-stake was proposed to lower its high energy consumption and provide a higher network throughput. Proof-of-Stake has hence got an increasing interest, variations, implementations and enhancements whilst its quantum security defenses remained almost the same. By comparing proof-of-work to proof-of-stake, we find that the latter is more vulnerable to certain attack vectors. We suggest general defenses for quantum-resilient blockchains and thoroughly analyze post-quantum signature schemes to select an appropriate alternative to the most serious threat on conventional digital signatures.
The K-SAT problem is a fundamental challenge in computational theory, widely used in artificial intelligence, cryptography, and optimization. Classical algorithms struggle with exponential time complexity, making them inefficient for large-scale instances. In this research, we propose an efficient quantum computing approach based on Grover’s algorithm to enhance the search process for satisfiable solutions in K-SAT problems. Our implementation leverages quantum superposition and amplitude amplification to explore multiple possible solutions simultaneously, reducing the search complexity from O (2ⁿ) in classical methods to O(√2ⁿ) in quantum computing. We design a quantum oracle that encodes the K-SAT clauses and integrates it into Grover’s iterative search framework. The performance is evaluated through Qiskit simulations, demonstrating a significant improvement in search efficiency compared to classical brute-force techniques. The results highlight the potential of quantum algorithms in solving complex combinatorial problems with enhanced speed and accuracy. This study contributes to the development of quantum-accelerated optimization methods, paving the way for real-world applications in machine learning, cryptanalysis, and large-scale data processing.
It has also added quantum computing and blockchain technology in the list of opportunities never seen in the revolution of distributed consensus systems. In the article, the authors summarize a new variant of quantum protocol-based entanglement consensus (QEC), which deals with the deployment of quantum mechanics to facilitate transaction implementation in record time with robust security guarantees as compared to the traditional protocols. As stated contrary to classical consensus algorithms, including a Proof-of-Work (PoW), Practical Byzantine Fault Tolerance (PBFT), and others, our architecture uses quantum entanglement properties to provide instantaneous consensus among all distributed nodes and uses cryptographic security through quantum key distribution. Results achieved provide both theoretical and experimental discussion of the fact that QEC performs optimally with latency (sub-milliseconds) and can be considered one of the biggest increases compared to classical protocols. In its implementation, it recorded 99.7 percent reduction in energy usage relative to PoW and 85 percent high throughput relative to PBFT. These values were based on our own physical 8 node testbed which was tested under calibrated simulator conditions as detailed in the Experimental Setup. The results are applicable in the field of quantum blockchain that is under development because it introduces a robust paradigm to build quantum-enhanced distributed systems that can find their applications in financial products, Internet of Things network, and the security of critical infrastructure.
Proof-of-Work (PoW) is a fundamental underlying technology behind most major blockchain cryptocurrencies. It has been previously pointed out that quantum devices provide a computational advantage in performing PoW in the context of Bitcoin. Here we make the case that this quantum advantage extends not only to all existing PoW mechanisms, but to any possible PoW as well. This has strong consequences regarding both quantum-based attacks on the integrity of the entirety of the blockchain, as well as more legitimate uses of quantum computation for the purpose of mining Bitcoin and other cryptocurrencies. For the first case, we estimate when these quantum attacks will become feasible, for various cryptocurrencies, and discuss the impact of such attacks. For the latter, we derive a precise formula to calculate the economic incentive for switching to quantum-based cryptocurrency miners. Using this formula, we analyze several test scenarios, and conclude that investing in quantum hardware for cryptocurrency mining has the potential to pay off immensely.