Algoritmo de computación cuántica para optimización

dc.contributor.authorRivas Pidre, Pablo
dc.contributor.tutorPena Brage, Francisco José
dc.date.accessioned2026-04-15T16:22:38Z
dc.date.available2026-04-15T16:22:38Z
dc.date.issued2025-07
dc.description.abstractNa área da computación cuántica, existe un gran interese no aproveitamento das propiedades cuánticas para resolver problemas de optimización pola súa potencial vantaxe fronte aos métodos clásicos. Neste traballo introdúcense os fundamentos da computación cuántica, tanto os elementosbásicos —o cúbit e o p-cúbit— como as portas cuánticas e o proceso de medición. A continuación,formúlanse problemas de optimización mediante hamiltonianos e descríbense os modelos QUBOe Ising. Explórase a computación adiabática (teorema adiabático) e introdúcese o Quantum Approximate Optimization Algorithm (QAOA). Detállase a arquitectura híbrida clásico-cuántica do Variational Quantum Eigensolver (VQE), os seus métodos de optimización variacional e as súas aplicacións prácticas. Finalmente, compárase o rendemento da computación clásica fronte á cuántica a través das clases de complexidade, discútese a vantaxe cuántica e explóranse as futuras liñas de investigación matemática nesta área.
dc.description.abstractIn the field of quantum computing, there is considerable interest in leveraging quantum properties to solve optimization problems, due to their potential advantage over classical methods. This thesis introduces the fundamentals of quantum computing, covering both basic elements —the qubit and the p-qubit— as well as quantum gates and the measurement process. It then explores how optimization problems can be modeled using Hamiltonians, with particular focus on the QUBO and Ising models. The work delves into adiabatic quantum computing (adiabatic theorem) and presents the Quantum Approximate Optimization Algorithm (QAOA). It also details the hybrid classical–quantum architecture of the Variational Quantum Eigensolver (VQE), its variational optimization techniques, and practical applications. Finally, the performance of classical versus quantum computing is compared through complexity classes, the notion of quantum advantage is discussed, and future lines of mathematical research in this area are explored.
dc.identifier.urihttps://hdl.handle.net/10347/46727
dc.language.isoglg
dc.rightsAttribution-NonCommercial-ShareAlike 4.0 International
dc.rights.accessRightsopen access
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/
dc.titleAlgoritmo de computación cuántica para optimización
dc.typebachelor thesis
dspace.entity.typePublication
relation.isTutorOfPublication15536553-63bb-4db1-8dae-2ca08fda6c48
relation.isTutorOfPublication.latestForDiscovery15536553-63bb-4db1-8dae-2ca08fda6c48

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Rivas_algoritmo_ de_computación_ cuántica_ para_optimización.pdf
Size:
808.65 KB
Format:
Adobe Portable Document Format