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

Loading...
Thumbnail Image
Identifiers

Publication date

Advisors

Editors

Journal Title

Journal ISSN

Volume Title

Publisher

Metrics
Google Scholar
lacobus
Export

Research Projects

Organizational Units

Journal Issue

Abstract

Na á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.
In 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.

Description

Keywords

Bibliographic citation

Relation

Has part

Has version

Is based on

Is part of

Is referenced by

Is version of

Requires

Sponsors

Rights

Attribution-NonCommercial-ShareAlike 4.0 International