Top Cited Papers
Open Access
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.
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: