| dc.contributor | Universidad Nacional de Asunción - Facultad Politécnica | |
| dc.creator | Baran Cegla, Benjamin | |
| dc.creator | Villagra, Marcos | |
| dc.date | 2022-04-27T18:31:54Z | |
| dc.date | 2022-04-27T18:31:54Z | |
| dc.date | 2019 | |
| dc.date.accessioned | 2023-09-25T13:29:22Z | |
| dc.date.available | 2023-09-25T13:29:22Z | |
| dc.identifier | http://hdl.handle.net/20.500.14066/3723 | |
| dc.identifier | doi:10.3390/axioms8010032 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/8806045 | |
| dc.description | In this work we show how to use a quantum adiabatic algorithm to solve multiobjective optimization problems. For the first time, we demonstrate a theorem proving that the quantum adiabatic algorithm can find Pareto-optimal solutions in finite-time, provided some restrictions to the problem are met. A numerical example illustrates an application of the theorem to a well-known problem in multiobjective optimization. This result opens the door to solve multiobjective optimization problems using current technology based on quantum annealing. | |
| dc.description | CONACYT – Consejo Nacional de Ciencia y Tecnología | |
| dc.description | PROCIENCIA | |
| dc.language | eng | |
| dc.relation | PINV15-208 | |
| dc.rights | open access | |
| dc.subject | 4 Transporte, telecomunicaciones y otras infraestructuras | |
| dc.subject | QUANTUM COMPUTATION | |
| dc.subject | MULTIOBJECTIVE OPTIMIZATION | |
| dc.subject | QUANTUM ADIABATIC EVOLUTION | |
| dc.subject | INFORMATICA | |
| dc.title | A quantum adiabatic algorithm for multiobjective combinatorial optimization | |
| dc.type | research article | |
