Blockchain Verifiable Proof of Quantum Supremacy as a Trigger for Quantum-Secure Signatures
Nicholas J.C. Papadopoulos

TL;DR
This paper proposes a blockchain-based smart contract that generates hard cryptographic puzzles to verify quantum supremacy and trigger quantum-secure fallback protocols, safeguarding assets against quantum threats.
Contribution
It introduces a novel Ethereum smart contract mechanism for trustless verification of quantum supremacy and transition to quantum-secure cryptography.
Findings
Successfully implemented the smart contract on Ethereum
Demonstrated the ability to verify quantum supremacy proofs
Established a protocol for transitioning to quantum-secure schemes
Abstract
Blockchain is a decentralized, distributed ledger technology that ensures transparency, security, and immutability through cryptographic techniques. However, advancements in quantum computing threaten the security of classical cryptographic schemes, jeopardizing blockchain integrity once cryptographic quantum supremacy is achieved. This milestone, defined here as the realization of quantum computers to solve practical cryptographic problems, would render existing security standards vulnerable, exposing blockchain assets (currency, data, etc.) to fraud and theft. To address this risk, we propose and implement a smart contract deployable on the Ethereum blockchain, having the ability to run applications on its blockchain, that generates classically intractable puzzles by probabilistically generating large, hard-to-factor numbers without requiring secret information. This contract then…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Mechanics and Applications · Quantum Information and Cryptography
