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

Physical Review A

Blockchain with proof of quantum work

M. H. S. Amin, Jack Raymond, Daniel Kinn, Gunnar Miller, Firas Hamze, Kelsey Hamer, Joel Pasvolsky, William Bernoudy, Andrew D. King, Samuel Kortas

Published Jan 30, 2026• 2 citations
Publisher
DOI
10.1103/m9jd-z9my

Related papers

Lattice-Based Proof-of-Work for Post-Quantum Blockchains

Rouzbeh Behnia, Eamonn W. Postlethwaite, Muslum Ozgur Ozmen +1 more

Lecture notes in computer science•Jan 1, 2022•13 citations

Blockchain consensus mechanism based on quantum zero-knowledge proof

Xiaojun Wen, Yongzhi Chen, Xincan Fan +3 more

Optics & Laser Technology•Nov 22, 2021•24 citations

A novel hybrid quantum-classical proof-of-work protocol for Blockchain mining

Najla Alharbi, Tarek Moulahi

Quantum Information Processing•Feb 16, 2026•1 citation

Blockchain and Quantum Computing

Brandon Rodenburg, S. P. Pappas

•Jan 1, 2017•15 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•19 citations

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

Kirill P. Kalinin, Natalia G. Berloff

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.

arXiv:1802.10091•Feb 27, 2018•13 citations
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 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.