A quantum algorithm for proof of work
Date
2025-08
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Benemérita Universidad Autónoma de Puebla
Abstract
"Quantum computing seeks to harness physical phenomena at scales where the laws of quantum mechanics describe nature to process information. The concept was popularized by Richard Feynman in 1981, who suggested that quantum computers could simulate quantum systems more efficiently than classical computers. There are two main approaches in quantum computing: the gate-based model, which operates through circuits, and the analog approach, grounded in the adiabatic theorem. Unlike classical algorithms, quantum algorithms use non-classical gates that operate on qubits, allowing the exploitation of properties such as superposition and entanglement. This results in significantly faster performance for some problems. Notable examples include Shor's algorithm, which could break RSA cryptography, and Grover's algorithm, which offers quadratic speedup for unstructured search. This growth in the study and design of quantum algorithms stems from the possibility that quantum computers can solve problems that cannot be efficiently addressed by known classical algorithms".
Description
Keywords
Citation
Collections
Document Viewer
Select a file to preview:
Can't see the file? Try reloading