A Quantum Adiabatic Algorithm for Multiobjective Combinatorial Optimization

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....

Full description

Bibliographic Details
Main Authors: Benjamín Barán, Marcos Villagra
Format: Article
Language:English
Published: MDPI AG 2019-03-01
Series:Axioms
Subjects:
Online Access:http://www.mdpi.com/2075-1680/8/1/32
id doaj-d3dde40db7474a2286d955326ad145e0
record_format Article
spelling doaj-d3dde40db7474a2286d955326ad145e02020-11-24T22:15:45ZengMDPI AGAxioms2075-16802019-03-01813210.3390/axioms8010032axioms8010032A Quantum Adiabatic Algorithm for Multiobjective Combinatorial OptimizationBenjamín Barán0Marcos Villagra1Núcleo de Investigación y Desarrollo Tecnológico, Universidad Nacional de Asunción, San Lorenzo C.P. 2619, ParaguayNúcleo de Investigación y Desarrollo Tecnológico, Universidad Nacional de Asunción, San Lorenzo C.P. 2619, ParaguayIn 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.http://www.mdpi.com/2075-1680/8/1/32quantum computationmultiobjective optimizationquantum adiabatic evolution
collection DOAJ
language English
format Article
sources DOAJ
author Benjamín Barán
Marcos Villagra
spellingShingle Benjamín Barán
Marcos Villagra
A Quantum Adiabatic Algorithm for Multiobjective Combinatorial Optimization
Axioms
quantum computation
multiobjective optimization
quantum adiabatic evolution
author_facet Benjamín Barán
Marcos Villagra
author_sort Benjamín Barán
title A Quantum Adiabatic Algorithm for Multiobjective Combinatorial Optimization
title_short A Quantum Adiabatic Algorithm for Multiobjective Combinatorial Optimization
title_full A Quantum Adiabatic Algorithm for Multiobjective Combinatorial Optimization
title_fullStr A Quantum Adiabatic Algorithm for Multiobjective Combinatorial Optimization
title_full_unstemmed A Quantum Adiabatic Algorithm for Multiobjective Combinatorial Optimization
title_sort quantum adiabatic algorithm for multiobjective combinatorial optimization
publisher MDPI AG
series Axioms
issn 2075-1680
publishDate 2019-03-01
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.
topic quantum computation
multiobjective optimization
quantum adiabatic evolution
url http://www.mdpi.com/2075-1680/8/1/32
work_keys_str_mv AT benjaminbaran aquantumadiabaticalgorithmformultiobjectivecombinatorialoptimization
AT marcosvillagra aquantumadiabaticalgorithmformultiobjectivecombinatorialoptimization
AT benjaminbaran quantumadiabaticalgorithmformultiobjectivecombinatorialoptimization
AT marcosvillagra quantumadiabaticalgorithmformultiobjectivecombinatorialoptimization
_version_ 1725793233810751488