Quantum approximate multi-objective optimization
Top Cited Papers
Open Access
- 24 October 2025
- journal article
- research article
- Published by Springer Nature in Nature Computational Science
- Vol. 5 (12) , 1168-1177
Abstract
The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. 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.Keywords
All Related Versions
Funding Information
- Bundesministerium für Forschung, Technologie und Raumfahrt (05M2025)
- Bundesministerium für Forschung, Technologie und Raumfahrt (05M14ZAM)
- Bundesministerium für Forschung, Technologie und Raumfahrt (05M20ZBM)
- Bundesministerium für Forschung, Technologie und Raumfahrt (05M2025)
- DOE | National Nuclear Security Administration (89233218CNA000001)
- DOE | National Nuclear Security Administration (89233218CNA000001)
- Österreichische Forschungsförderungsgesellschaft (897481)
This publication has 52 references indexed in Scilit:
- Transfer learning of optimal QAOA parameters in combinatorial optimizationQuantum Information Processing, 2025
- On improvements of multi-objective branch and boundEURO Journal on Computational Optimization, 2024
- Scalable Quantum Approximate Optimiser for Pseudo-Boolean Multi-objective Optimisation2024
- A simple, efficient and versatile objective space algorithm for multiobjective integer programmingMathematical Methods of Operations Research, 2024
- Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers2023
- What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimizationComputers & Operations Research, 2022
- Easy to say they are Hard, but Hard to see they are Easy- Towards a Categorization of Tractable Multiobjective Combinatorial Optimization ProblemsJournal of Multi-Criteria Decision Analysis, 2016
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problemsEuropean Journal of Operational Research, 2014
- Multi-Objective Integer Programming: An Improved Recursive AlgorithmJournal of Optimization Theory and Applications, 2013
- Approximating the volume of unions and intersections of high-dimensional geometric objectsComputational Geometry, 2010