Quantum-Enhanced Multi-Objective Optimization

• URL: http://arxiv.org/abs/2607.18848v1
• Date: Tue, 21 Jul 2026 08:35:45 GMT
• Title: Quantum-Enhanced Multi-Objective Optimization
• Abstract summary: We propose QEMOO, a quantum-enhanced multi-objective optimization framework.<n>We introduce a PBI-inspired adaptive directionupdate scheme to improve coverage in strongly conflicting benchmark regimes.<n>Across three benchmark stages, QEMOO improves hypervolume over the single-pass weighted-sum QAOA baseline under matched shot budgets.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• A Momentum-Based Variance-Reduced Algorithm for Federated Multiobjective Optimization [3.8924391892411543]
  In real-world applications, machine learning models often need to optimize multiple and potentially conflicting objectives simultaneously.<n>We propose a momentum-based variance-reduced algorithm for federated multiobjective optimization.
  arXiv  Detail & Related papers  (2026-08-24T08:14:44Z)
• Towards Pareto-Optimal Tool-Integrated Agents with Pareto Ranking Policy Optimization [54.855135506924775]
  We introduce a two-stage multi-objective optimization framework for aligning tool-using large language models (LLMs) under competing objectives.<n>This design enables fine-grained, action-level optimization across multiple conflicting objectives.
  arXiv  Detail & Related papers  (2026-06-15T01:58:07Z)
• Multi-objective optimization by quantum annealing [0.0]
  An important task in multi-objective optimization is generating the Pareto front.<n>This problem was recently approached using the quantum approximate optimization algorithm (QAOA) on an IBM gate-model processor.<n>Here we compare these QAOA results with quantum annealing on the same two input problems, using the same methodology.
  arXiv  Detail & Related papers  (2025-11-03T17:21:36Z)
• Multiclass Portfolio Optimization via Variational Quantum Eigensolver with Dicke State Ansatz [0.0]
  We introduce a novel quantum framework for portfolio optimization that explicitly incorporates diversification.<n>A key strength of this ansatz is that it initializes the quantum system in a superposition of only feasible states.<n>Our findings demonstrate that, when combined with the CMA-ES, the Dicke state ansatz achieves superior performance in terms of convergence rate, approximation ratio, and measurement probability.
  arXiv  Detail & Related papers  (2025-08-19T15:45:07Z)
• Transfer-Based Strategies for Multi-Target Quantum Optimization [0.8481798330936976]
  We address the challenge of multi-target quantum optimization.<n>The objective is to simultaneously optimize multiple cost functions defined over the same quantum search space.<n>We investigate a range of strategies that enable knowledge transfer between related tasks.
  arXiv  Detail & Related papers  (2025-08-16T05:24:16Z)
• Quantum Approximate Multi-Objective Optimization [1.2564343689544843]
  Multi-objective optimization represents a compelling problem class to analyze with quantum computers.<n>In this work, we use low-depth Quantum Approximate Optimization Algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum cut problems.<n>We demonstrate its performance on an IBM Quantum computer, as well as with Matrix Product State numerical simulation, and show its potential to outperform classical approaches.
  arXiv  Detail & Related papers  (2025-03-28T18:00:25Z)
• Preference-Guided Diffusion for Multi-Objective Offline Optimization [64.08326521234228]
  We propose a preference-guided diffusion model for offline multi-objective optimization.<n>Our guidance is a preference model trained to predict the probability that one design dominates another.<n>Our results highlight the effectiveness of classifier-guided diffusion models in generating diverse and high-quality solutions.
  arXiv  Detail & Related papers  (2025-03-21T16:49:38Z)
• Scalable Min-Max Optimization via Primal-Dual Exact Pareto Optimization [66.51747366239299]
  We propose a smooth variant of the min-max problem based on the augmented Lagrangian.<n>The proposed algorithm scales better with the number of objectives than subgradient-based strategies.
  arXiv  Detail & Related papers  (2025-03-16T11:05:51Z)
• Variational Quantum Multi-Objective Optimization [5.381539115778766]
  We present a variational quantum optimization algorithm to solve discrete multi-objective optimization problems on quantum computers. We show the effectiveness of the proposed algorithm on several benchmark problems with up to five objectives.
  arXiv  Detail & Related papers  (2023-12-21T18:59:21Z)
• BOtied: Multi-objective Bayesian optimization with tied multivariate ranks [33.414682601242006]
  In this paper, we show a natural connection between non-dominated solutions and the extreme quantile of the joint cumulative distribution function. Motivated by this link, we propose the Pareto-compliant CDF indicator and the associated acquisition function, BOtied. Our experiments on a variety of synthetic and real-world problems demonstrate that BOtied outperforms state-of-the-art MOBO acquisition functions.
  arXiv  Detail & Related papers  (2023-06-01T04:50:06Z)
• Faster Last-iterate Convergence of Policy Optimization in Zero-Sum Markov Games [63.60117916422867]
  This paper focuses on the most basic setting of competitive multi-agent RL, namely two-player zero-sum Markov games. We propose a single-loop policy optimization method with symmetric updates from both agents, where the policy is updated via the entropy-regularized optimistic multiplicative weights update (OMWU) method. Our convergence results improve upon the best known complexities, and lead to a better understanding of policy optimization in competitive Markov games.
  arXiv  Detail & Related papers  (2022-10-03T16:05:43Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.