Evidence map›Paper›PMID 41136743›Full record

ArticleNature computational science2025

Quantum approximate multi-objective optimization.

Ayse Kotil, Elijah Pelofske, Stephanie Riedmüller, Daniel J Egger, Stephan Eidenbenz, Thorsten Koch, Stefan Woerner

Abstract read
In one paragraph

Article in Nature computational science, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

7 authors.

Ayse KotilIBM Quantum, IBM Research Europe-Zurich, Rueschlikon, Switzerland.ORCID http://orcid.org/0009-0000-0857-5093
Elijah PelofskeLos Alamos National Laboratory, Los Alamos, NM, USA.ORCID http://orcid.org/0000-0003-2673-796X
Stephanie RiedmüllerZuse Institute Berlin, Berlin, Germany.ORCID http://orcid.org/0009-0006-4508-4262
Daniel J EggerIBM Quantum, IBM Research Europe-Zurich, Rueschlikon, Switzerland.ORCID http://orcid.org/0000-0002-5523-9807
Stephan EidenbenzLos Alamos National Laboratory, Los Alamos, NM, USA.ORCID http://orcid.org/0000-0002-2628-1854
Thorsten KochZuse Institute Berlin, Berlin, Germany.ORCID http://orcid.org/0000-0002-1967-0077
Stefan WoernerIBM Quantum, IBM Research Europe-Zurich, Rueschlikon, Switzerland. wor@zurich.ibm.com.ORCID http://orcid.org/0000-0002-5945-4707

Funding

Bundesministerium für Bildung und Forschung (Federal Ministry of Education and Research) 05M14ZAMBundesministerium für Bildung und Forschung (Federal Ministry of Education and Research) 05M2025Bundesministerium für Bildung und Forschung (Federal Ministry of Education and Research) 05M20ZBMDOE | National Nuclear Security Administration (NNSA) 89233218CNA000001Österreichische Forschungsförderungsgesellschaft (Austrian Research Promotion Agency) 897481
6 · The paper itself

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.

Identifiers

PMID41136743
PMCPMC12727516

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.