A quantum algorithm for proof of work
| dc.audience | generalPublic | |
| dc.contributor | Montes Pérez, Areli | |
| dc.contributor | Venegas Andraca, Salvador Elías | |
| dc.contributor.advisor | Montes Pérez, Areli; 0000-0001-8575-567X | |
| dc.contributor.advisor | Venegas Andraca, Salvador Elías; 0000-0001-7444-4534 | |
| dc.contributor.author | Cañete Leyva, Fabiola | |
| dc.creator | 0000-0003-3852-171X | |
| dc.date.accessioned | 2026-01-30T16:33:54Z | |
| dc.date.available | 2026-01-30T16:33:54Z | |
| dc.date.issued | 2025-08 | |
| dc.description.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". | |
| dc.folio | 20250826131118-9302-TL | |
| dc.format | ||
| dc.identificator | 1 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12371/31113 | |
| dc.language.iso | eng | |
| dc.matricula.creator | 201441115 | |
| dc.publisher | Benemérita Universidad Autónoma de Puebla | |
| dc.rights.acces | openAccess | |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0 | |
| dc.subject.classification | CIENCIAS FÍSICO MATEMÁTICAS Y CIENCIAS DE LA TIERRA | |
| dc.subject.lcc | Matemáticas--Instrumentos y máquinas--Máquinas de calculo--Ciencias de la computación--Computadoras cuánticas | |
| dc.subject.lcc | Finanzas--Banca--Transferencias electrónicas de fondos--Criptomonedas | |
| dc.subject.lcc | Matemáticas--Álgebra--Autómatas abstractos--Teoría de la codificación | |
| dc.subject.lcc | Computación cuántica--Investigación | |
| dc.subject.lcc | Bitcoin | |
| dc.thesis.career | Licenciatura en Física | |
| dc.thesis.degreediscipline | Área de Ingeniería y Ciencias Exactas | |
| dc.thesis.degreegrantor | Facultad de Ciencias Físico Matemáticas | |
| dc.thesis.degreetoobtain | Licenciado (a) en Física | |
| dc.title | A quantum algorithm for proof of work | |
| dc.type | Tesis de licenciatura | |
| dc.type.conacyt | bachelorThesis | |
| dc.type.degree | Licenciatura |
Files
Original bundle
1 - 2 of 2
- Name:
- 20250826131118-9302-CARTA.pdf
- Size:
- 348.74 KB
- Format:
- Adobe Portable Document Format