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

Lecture notes in computer science

Improving Quantum Multi-Objective Optimization with Archiving and Substitution

Linus Ekstrøm, Takafumi Hosogi, Xavier Bonet-Monroig, Hao Wang, Thomas Bäck, Sebastian Schmitt

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-21480-5_4

Related papers

Improving the balance of trade-offs in multi-objective optimization with quantum computing

V. Akshay, Mile Gu

Nature Computational Science•Dec 16, 2025•0 citations

Multi-objective optimization in quantum parameter estimation

Beili Gong, Wei Cui

arXiv:1703.04203•Science China Physics Mechanics and Astronomy•Jan 22, 2018•8 citations

Improving Quantum Multi-Objective Optimization with Archiving and Substitution

Linus Ekstrøm, Takafumi Hosogi, Xavier Bonet-Monroig +3 more

Finding optimal solutions of conflicting objectives is a daily matter in many industrial applications, with multi-objective optimization trying to find the best solutions to them. The advent of quantum computing has led to researchers wondering if the promised exponential advantage can be obtained for these problems by variational quantum multi-objective optimization (QMOO) algorithm. Here, we improve it by introducing a Pareto Archive and dominated solutions substitution, clearly improving in hyper-volume convergence at additional quantum and classical cost. We propose the use of RMNK-landscapes as a unifying testbed for benchmarking QMOO, as it is common in classical multi-objective field. By devising a generic classical-to-quantum mapping of these landscapes, we perform a numerical hyperparameter tuning of QMOO, significantly enhancing its performance. Finally, we compare QMOO against well-known classical solvers for multi-objective tasks, NSGA-II/III, showing comparable results in small instances. Our results demonstrate that QMOO, when carefully tuned for the task at hand, might be advantageous on harder problems than its classical counterparts.

quant-pharXiv:2602.10952•Feb 12, 2026•0 citations

A quantum multi-objective optimization algorithm based on harmony search method

Alireza Sadeghi Hesar, Seyed Reza Kamel, Mahboobeh Houshmand

Soft Computing•Apr 25, 2021•23 citations

Quantum-Enhanced Multi-Objective Optimization

Maolin Luo, Jiapei Zhuang, Zuoheng Zou +1 more

Multi-objective combinatorial optimization requires identifying Pareto-optimal trade-off solutions among conflicting objectives, often making it more demanding than its single-objective counterpart. Although quantum multi-objective optimization methods have begun to emerge, most existing quantum optimization workflows are still built around single-objective or fixed-scalarization settings. Building on existing weighted-sum QAOA approaches to quantum multi-objective optimization, we propose QEMOO, a quantum-enhanced multi-objective optimization framework that combines Pareto-based selection and warm-started QAOA sampling in a multi-round protocol under the same total shot budget. We further introduce a PBI-inspired adaptive direction-update scheme to improve coverage in strongly conflicting benchmark regimes. Across three benchmark stages, QEMOO improves Pareto-front hypervolume over the single-pass weighted-sum QAOA baseline under matched shot budgets, suggesting a practical route toward shot-efficient quantum-assisted multi-objective optimization and its future applications.

quant-pharXiv:2607.18848•Jul 22, 2026•0 citations

Performance Evaluation of Three Kinds of Quantum Optimization

Bao Rong Chang, Hsiu Fen Tsai

Springer eBooks•Aug 25, 2007•0 citations
Finding optimal solutions of conflicting objectives is a daily matter in many industrial applications, with multi-objective optimization trying to find the best solutions to them. The advent of quantum computing has led to researchers wondering if the promised exponential advantage can be obtained for these problems by variational quantum multi-objective optimization (QMOO) algorithm. Here, we improve it by introducing a Pareto Archive and dominated solutions substitution, clearly improving in hyper-volume convergence at additional quantum and classical cost. We propose the use of RMNK-landscapes as a unifying testbed for benchmarking QMOO, as it is common in classical multi-objective field. By devising a generic classical-to-quantum mapping of these landscapes, we perform a numerical hyperparameter tuning of QMOO, significantly enhancing its performance. Finally, we compare QMOO against well-known classical solvers for multi-objective tasks, NSGA-II/III, showing comparable results in small instances. Our results demonstrate that QMOO, when carefully tuned for the task at hand, might be advantageous on harder problems than its classical counterparts.
Multi-objective combinatorial optimization requires identifying Pareto-optimal trade-off solutions among conflicting objectives, often making it more demanding than its single-objective counterpart. Although quantum multi-objective optimization methods have begun to emerge, most existing quantum optimization workflows are still built around single-objective or fixed-scalarization settings. Building on existing weighted-sum QAOA approaches to quantum multi-objective optimization, we propose QEMOO, a quantum-enhanced multi-objective optimization framework that combines Pareto-based selection and warm-started QAOA sampling in a multi-round protocol under the same total shot budget. We further introduce a PBI-inspired adaptive direction-update scheme to improve coverage in strongly conflicting benchmark regimes. Across three benchmark stages, QEMOO improves Pareto-front hypervolume over the single-pass weighted-sum QAOA baseline under matched shot budgets, suggesting a practical route toward shot-efficient quantum-assisted multi-objective optimization and its future applications.