Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Lasers Optics & Photonics

Challenges in Multiobjective Optimization using a Quantum Adiabatic Computer

Benjamín Barán

Published Nov 10, 2017• 0 citations
OpenAlex

Related papers

Quantum-enhanced multiobjective large-scale optimization via parallelism

Bin Cao, Shanshan Fan, Jianwei Zhao +3 more

Swarm and Evolutionary Computation•May 7, 2020•125 citations

Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective

Daniel Ruffinelli, Benjamín Barán

Quantum Information Processing•Jul 26, 2017•17 citations

Multiobjective Optimization in a Quantum Adiabatic Computer

Benjamín Barán, Marcos Villagra

In this work we propose what we consider the first quantum algorithm for multiobjective combinatorial optimization, at least to the best of our knowledge. The proposed algorithm is based on the adiabatic algorithm of Farhi et al. and it is constructed by mapping a multiobjective combinatorial optimization problem into a Hamiltonian using a convex combination among objectives. We present mathematical properties of the eigenspectrum of the associated Hamiltonian and prove that the quantum adiabatic algorithm can find Pareto-optimal solutions provided certain convex combinations of objectives are used and the underlying multiobjective problem meets certain restrictions.

arXiv:1605.03152•Electronic Notes in Theoretical Computer Science•Dec 1, 2016•10 citations

Quantum Computing Approaches for Complex Optimization Problems

Parnapalli Maruthi, K. Rahul Naik, M. Charan +3 more

International Conference on Communication and Electronics Systems (ICCES)•Oct 1, 2026•0 citations

A Quantum Adiabatic Algorithm for Multiobjective Combinatorial Optimization

Benjamín Barán, Marcos Villagra

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.

Axioms•Mar 9, 2019•1 citation

Advancements in Quantum Algorithms for Solving Complex Optimization Problems

Emmanuel Adediran, Iyanuoluwa Fatoki, Taiwo Ogunyinka

•Jan 1, 2024•2 citations
In this work we propose what we consider the first quantum algorithm for multiobjective combinatorial optimization, at least to the best of our knowledge. The proposed algorithm is based on the adiabatic algorithm of Farhi et al. and it is constructed by mapping a multiobjective combinatorial optimization problem into a Hamiltonian using a convex combination among objectives. We present mathematical properties of the eigenspectrum of the associated Hamiltonian and prove that the quantum adiabatic algorithm can find Pareto-optimal solutions provided certain convex combinations of objectives are used and the underlying multiobjective problem meets certain restrictions.
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.